arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1507.03059math.COcs.DMmath.OC
收藏

旗代数上Turán平方和多项式的对称性

Symmetry in Turán Sums of Squares Polynomials from Flag Algebras

Annie Raymond, Mohit Singh, Rekha R. Thomas

摘要:

极值组合学中的图兰问题要求找到避免指定子图的图和超图的边密度的渐近界。Razborov提出的旗代数理论提供了基于半定规划的强大方法来找到在Turán问题中建立边密度不等式的平方和。多项式类似物的旗代数实体的工作,我们证明了这样的总和的平方创建的旗代数可以检索到从一个限制版本的自适应半定方案提出的Gatermann和Parrilo。这涉及到使用对称群的表示论来寻找不变多项式的简洁平方和表达式。这种联系揭示了旗代数平方和的若干组合和结构性质,为研究Turán及其它相关问题提供了新的工具.

英文摘要:

Turán problems in extremal combinatorics ask to find asymptotic bounds on the edge densities of graphs and hypergraphs that avoid specified subgraphs. The theory of flag algebras proposed by Razborov provides powerful methods based on semidefinite programming to find sums of squares that establish edge density inequalities in Turán problems. Working with polynomial analogs of the flag algebra entities, we prove that such sums of squares created by flag algebras can be retrieved from a restricted version of the symmetry-adapted semidefinite program proposed by Gatermann and Parrilo. This involves using the representation theory of the symmetric group for finding succinct sums of squares expressions for invariant polynomials. The connection reveals several combinatorial and structural properties of flag algebra sums of squares, and offers new tools for Turán and other related problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑