On relations for zeros of $f$-polynomials and $f^{+}$-polynomials
Tadashi Ishibe

TL;DR
This paper investigates the zeros of $f$-polynomials and $f^{+}$-polynomials associated with cluster complexes of root systems, revealing their real, simple roots within (0,1) and their interlacing properties.
Contribution
It establishes the real, simple roots of $f$- and $f^{+}$-polynomials for root systems and describes their interlacing, including asymptotic behavior for types A, B, and D.
Findings
$f$-polynomials have exactly $l$ real roots in (0,1)
$f^{+}$-polynomials have roots in (0,1] with a root at 1
Roots of $f^{+}$-polynomials interlace with roots of $f$-polynomials
Abstract
Let be an irreducible (possibly noncrystallographic) root system of rank of type . For the corresponding cluster complex , which is known as pure -dimensional simplicial complex, we define the generating function of the number of faces of with dimension , which is called the {\it -polynomial}. We show that the -polynomial has exactly simple real zeros on the interval and the smallest root for the infinite series of type , and monotone decreasingly converges to zero as the rank tends to infinity. We also consider the generating function (called the {\it -polynomial}) of the number of faces of the positive part of the complex with dimension , whose zeros are real and simple and are located in the interval , including a simple root at . We show that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Algebraic structures and combinatorial models · Advanced Algebra and Geometry
