论文标题
图形匹配的模棱两可的日志covity
Equivariant log-concavity of graph matchings
论文作者
论文摘要
对于任何图表,我们表明,匹配给出的图形自动形态组的分级置换表示形式是强烈的log-concave。该证明提供了受kratthenthaler组合图的启发的一系列均等注射剂,并减少了硬Lefschetz定理。
For any graph, we show that the graded permutation representation of the graph automorphism group given by matchings is strongly equivariantly log-concave. The proof gives a family of equivariant injections inspired by a combinatorial map of Kratthenthaler and reduces to the hard Lefschetz theorem.