English
Related papers

Related papers: Two classes of posets with real-rooted chain polyn…

200 papers

We classify finite posets with a particular sorting property, generalizing a result for rectangular arrays. Each poset is covered by two sets of disjoint saturated chains such that, for any original labeling, after sorting the labels along…

Combinatorics · Mathematics 2007-05-23 Bridget Eileen Tenner

We define several sorts of mappings on a poset like monotone, strictly monotone, upper cone preserving and variants of these. Our aim is to characterize posets in which some of these mappings coincide. We define special mappings determined…

Combinatorics · Mathematics 2021-03-01 Ivan Chajda , Helmut Länger

Huh-Stevens and Ferroni-Schr\"oter independently conjectured that Hilbert-Poincar\'e series of Chow rings of geometric lattices have only real zeros. Ferroni, Matherne and the second author extended this conjecture to Chow polynomials of…

Combinatorics · Mathematics 2025-11-11 Petter Brändén , Lorenzo Vecchi

June Huh and Matthew Stevens conjectured that the Hilbert-Poincar\'e series of the Chow ring of any matroid is a polynomial with only real zeros. We prove this conjecture for the class of uniform matroids. We also prove that the Chow…

Combinatorics · Mathematics 2025-09-19 Petter Brändén , Lorenzo Vecchi

We introduce two partially ordered sets, $P^A_n$ and $P^B_n$, of the same cardinalities as the type-A and type-B noncrossing partition lattices. The ground sets of $P^A_n$ and $P^B_n$ are subsets of the symmetric and the hyperoctahedral…

Combinatorics · Mathematics 2007-05-23 Miklós Bóna , Rodica Simion

In certain finite posets, the expected down-degree of their elements is the same whether computed with respect to either the uniform distribution or the distribution weighting an element by the number of maximal chains passing through it.…

Combinatorics · Mathematics 2018-08-14 Victor Reiner , Bridget Eileen Tenner , Alexander Yong

Given a symmetric monoidal category $C$ with product $\sqcup$, where the neutral element for the product is an initial object, we consider the poset of $\sqcup$-complemented subobjects of a given object $X$. When this poset has finite…

Combinatorics · Mathematics 2025-07-30 Kevin Ivan Piterman , Volkmar Welker

We consider path ideals associated to special classes of posets such as tree posets and cycles. We express their property of being sequentially Cohen-Macaulay in terms of the underlying poset. Moreover, monomial ideals, which arise from the…

Commutative Algebra · Mathematics 2013-04-18 Martina Kubitzke , Anda Olteanu

A polynomial is real-rooted if all of its roots are real. For every polynomial $f(t) \in {\mathbf R}[t]$, the Hermite-Sylvester theorem associates a quadratic form $\Phi_2$ such that $f(t)$ is real-rooted if and only if $\Phi_2$ is positive…

Number Theory · Mathematics 2022-12-14 Melvyn B. Nathanson

We refine a technique used in a paper by Schur on real-rooted polynomials. This amounts to an extension of a theorem of Wagner on Hadamard products of Toeplitz matrices. We also apply our results to polynomials for which the Neggers-Stanley…

Combinatorics · Mathematics 2012-04-18 Petter Brändén

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…

Symbolic Computation · Computer Science 2017-04-14 Victor Y. Pan , Liang Zhao

Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for…

Data Structures and Algorithms · Computer Science 2023-04-11 Prateek Bhakta , Ben Cousins , Matthew Fahrbach , Dana Randall

We consider the set of monic real univariate polynomials of a given degree $d$ with non-vanishing coefficients, with given signs of the coefficients and with given quantities $pos$ of their positive and $neg$ of their negative roots (all…

Classical Analysis and ODEs · Mathematics 2022-09-26 Vladimir Petrov Kostov

We prove real-rootedness for the Poincar\'e polynomial \[ P_n(t)=\sum_{i=0}^{n-3} \dim H^{2i}(\overline{\mathcal M}_{0,n};\mathbb{Q})t^i \] of the Deligne--Mumford moduli space $\overline{\mathcal M}_{0,n}$ of stable $n$-pointed rational…

Algebraic Geometry · Mathematics 2026-05-29 Gergely Bérczi , Young-Hoon Kiem

We provide necessary and sufficient conditions on the unimodality of a convolution of two sequences of binomial coefficients preceded by a finite number of ones. These convolution sequences arise as as rank sequences of posets of…

Combinatorics · Mathematics 2019-10-07 Tricia Muldoon Brown

In this paper, we explore combinatorial properties of the posets associated with Kohnert polynomials. In particular, we determine a sufficient condition guaranteeing when such ``Kohnert posets'' are bounded and two necessary conditions for…

Combinatorics · Mathematics 2023-09-15 Laura Colmenarejo , Felix Hutchins , Nicholas Mayers , Etienne Phillips

We investigate structural properties of the cone of roots of relative Steiner polynomials of convex bodies. We prove that they are closed, monotonous with respect to the dimension, and that they cover the whole upper half-plane, except the…

Metric Geometry · Mathematics 2011-12-21 Martin Henk , María A. Hernández Cifre , Eugenia Saorín

It is well-known that the coordinator polynomials of the classical root lattice of type $A_n$ and those of type $C_n$ are real-rooted. They can be obtained, either by the Aissen-Schoenberg-Whitney theorem, or from their recurrence…

Combinatorics · Mathematics 2012-10-26 David G. L. Wang , Tongyuan Zhao

In this paper, we exhibit new monotonicity properties of roots of families of orthogonal polynomials $P_n^{(z)}(x)$ depending polynomially on a parameter (Laguerre and Gegenbauer). By establishing that $P_n^{(z)}(x)$ are realrooted in $z$…

Classical Analysis and ODEs · Mathematics 2024-12-10 Aurelien Xavier Gribinski

We characterize the finite distributive lattices which admit a complete valuation, that is bijective over a set of consecutive natural numbers, with the additional conditions of completeness (Definition 2.3). We prove that such lattices are…

Discrete Mathematics · Computer Science 2013-09-12 Francesco Marigo