Related papers: Unimodality, log-concavity, real-rootedness and be…

In this paper we study unimodality problems for the independence polynomial of a graph, including unimodality, log-concavity and reality of zeros. We establish recurrence relations and give factorizations of independence polynomials for…

Given a graph $G$, its independence sequence is the integral sequence $a_1,a_2,...,a_n$, where $a_i$ is the number of independent sets of vertices of size i. In the late 80's Alavi, Erdos, Malde, Schwenk showed that this sequence need not…

This paper is devoted to the study of the log-convexity of combinatorial sequences. We show that the log-convexity is preserved under componentwise sum, under binomial convolution, and by the linear transformations given by the matrices of…

We study rational homology groups of one-point compactifications of spaces of complex monic polynomials with multiple roots. These spaces are indexed by number partitions. A standard reformulation in terms of quotients of orbit arrangements…

In this paper, we investigate two properties concerning the unimodality of the $\delta$-vectors of lattice polytopes, which are log-concavity and alternatingly increasingness. For lattice polytopes $\mathcal{P}$ of dimension $d$, we prove…

The unimodality conjecture posed by Tolman in the conference `Moment maps in Various Geometry" in 2005 states that if (M,w) is a 2n-dimensional smooth compact symplectic manifold equipped with a Hamiltonian circle action with only isolated…

Simion had a unimodality conjecture concerning the number of lattice paths in a rectangular grid with the Ferrers diagram of a partition removed. Hildebrand recently showed the stronger result that these numbers are log concave. Here we…

The homological information about a filtered simplicial complex over the poset of positive real numbers is often presented by a barcode which depicts the evolution of the associated Betti numbers. However, there is a wonderfully complex…

Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…

New criteria are shown that certain combinations of finite unimodal polynomials are unimodal. %Given unimodal polynomials with explicit expressions and dependent recursion relations, we propose an approach to determine their modes. As…

We give a short proof of the log-concavity of the coefficients of the reduced characteristic polynomial of a matroid. The proof uses an extension of the theory of Lorentzian polynomials to convex cones, and reproves the Hodge-Riemann…

Unimodality, pivotal in statistical analysis, offers insights into dataset structures and drives sophisticated analytical procedures. While unimodality's confirmation is straightforward for one-dimensional data using methods like…

Gao and Xie (2021) conjectured that the inverse Kazhdan-Lusztig polynomial of any matroid is log-concave. Although the inverse Kazhdan-Lusztig polynomial may not always have only real roots, we conjecture that the Hadamard product of an…

We study the stratification of the space of monic polynomials with real coefficients according to the number and multiplicities of real zeros. In the first part, for each of these strata we provide a purely combinatorial chain complex…

In 1987, Alavi, Malde, Schwenk and Erd\H{o}s conjectured that the independence polynomials of trees are unimodal. Subsequently, many researchers proposed strengthening this conjecture to log-concavity. In 2023, Kadrawi, Levit, Yosef, and…

This paper investigates the independence polynomials arising from iterated strong products of cycle graphs, examining their algebraic symmetries and combinatorial structures. Leveraging modular arithmetic and Galois theory, we establish…

For any matroid $M$, we compute the Tutte polynomial $T_M(x,y)$ using the mixed intersection numbers of certain classes in the combinatorial Chow ring $A^\bullet(M)$ arising from hypersimplices. Using the mixed Hodge-Riemann relations, we…

With the exponential surge in diverse multi-modal data, traditional uni-modal retrieval methods struggle to meet the needs of users seeking access to data across various modalities. To address this, cross-modal retrieval has emerged,…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…