Combinatorial and spectral analysis of matrix patterns

矩阵模式的组合和谱分析

• 批准号: 203336-2011
• 负责人: VanderMeulen, Kevin
• 金额: $ 0.73万
• 依托单位: Redeemer University College
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2013
• 资助国家: 加拿大
• 起止时间: 2013-01-01 至 2014-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=523437
• 关键词: Combinatorial; spectral; analysis; matrix; patterns

The proposed research explores the interplay between two different areas of mathematics, namely linear algebra and graph theory. One particular type of problem being explored is how mathematics on arrays of numbers is affected by qualitative information, such as the pattern of positive, negative and zero entries in the array. Sometimes this information alone is sufficient to observe significant restrictions on results, independent of the magnitude of the individual numbers in the array. These sign patterns can be modeled using graph theory and this theory can provide insights into the restrictions for given patterns. Part of this research entails determining what restrictions can be discovered with these models, and likewise, how these models can help demonstrate lack of restrictions.

拟议的研究探讨了两个不同领域的数学领域之间的相互作用，即线性代数和图理论。 探索的一种特殊类型的问题是数字数组上的数学如何受定性信息的影响，例如数组中正，负和零条目的模式。有时，仅此信息就足以观察到对结果的显着限制，而与阵列中单个数字的大小无关。可以使用图理论对这些符号模式进行建模，该理论可以提供有关给定模式限制的见解。这项研究的一部分需要确定这些模型可以发现哪些限制，并且同样，这些模型如何帮助证明缺乏限制。