English
Related papers

Related papers: Chain enumeration, partition lattices and polynomi…

200 papers

The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…

Combinatorics · Mathematics 2025-07-08 Bruce E Sagan , Sheila Sundaram

For stacked simplicial complexes, (special subclasses of such are: trees, triangulations of polygons, stacked polytopes), we give an explicit bijection between partitions of facets (for trees: edges), and partitions of vertices into…

Combinatorics · Mathematics 2024-01-17 Gunnar Fløystad

This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…

Classical Analysis and ODEs · Mathematics 2008-03-11 Steve Fisk

Polynomials which afford nonnegative, real-rooted symmetric decompositions have been investigated recently in algebraic, enumerative and geometric combinatorics. Br\"and\'en and Solus have given sufficient conditions under which the image…

Combinatorics · Mathematics 2021-03-08 Christos A. Athanasiadis , Eleni Tzanaki

The (extended) Linial arrangement $\mathcal{L}_{\Phi}^m$ is a certain finite truncation of the affine Weyl arrangement of a root system $\Phi$ with a parameter $m$. Postnikov and Stanley conjectured that all roots of the characteristic…

Combinatorics · Mathematics 2019-02-19 Masahiko Yoshinaga

We are interested in representations and characterizations of lattice polynomial functions f:L^n -> L, where L is a given bounded distributive lattice. In companion papers [arXiv 0901.4888, arXiv 0808.2619], we investigated certain…

Rings and Algebras · Mathematics 2010-03-15 Miguel Couceiro , Jean-Luc Marichal

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

We introduce the priority lattice, a structure arising from the priority search algorithm on rooted trees and forests. We prove bijectively that its maximal chains are labeled by parking functions, and that the maximal chains of its…

Combinatorics · Mathematics 2026-04-01 Adrián Lillo , Mercedes Rosas

The proper parts of face lattices of convex polytopes are shown to satisfy a strong form of the Cohen--Macaulay property, namely that removing from their Hasse diagram all edges in any closed interval results in a Cohen--Macaulay poset of…

Combinatorics · Mathematics 2015-11-11 Christos A. Athanasiadis , Myrto Kallipoliti

Some cubic polynomials over the integers have three distinct real roots with continued fractions that all have the same common tail. We characterize the polynomials for which this happens, and then investigate the situation for other…

Number Theory · Mathematics 2015-09-01 Alexandra Hobby , David Hobby

In this paper we consider the classical problem of computing linear extensions of a given poset which is well known to be a difficult problem. However, in our setting the elements of the poset are multivariate polynomials, and only a small…

Combinatorics · Mathematics 2021-03-05 Shane Kepley , Konstantin Mischaikow , Lun Zhang

In this paper we consider the characteristic polynomial of not necessarily ranked posets. We do so by allowing the rank to be an arbitrary function from the poset to the nonnegative integers. We will prove two results showing that the…

Combinatorics · Mathematics 2014-11-13 Joshua Hallam

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

In this paper we study partitions whose successive ranks belong to a given set. We enumerate such partitions while keeping track of the number of parts, the largest part, the side of the Durfee square, and the height of the Durfee…

Combinatorics · Mathematics 2022-11-17 Sylvie Corteel , Sergi Elizalde , Carla Savage

We introduce a family of univariate polynomials indexed by integer partitions. At prime powers, they count the number of subspaces in a finite vector space that transform under a regular diagonal matrix in a specified manner. This…

Combinatorics · Mathematics 2024-09-17 Amritanshu Prasad , Samrith Ram

We prove two recent conjectures of Bourn and Erickson (2023) regarding the real-rootedness of a certain family of polynomials $N_n(t)$ as well as the sum of their coefficients. These polynomials arise as the numerators of generating…

Combinatorics · Mathematics 2024-07-09 Ming-Jian Ding , Jiang Zeng

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

In this paper, we study the posets of classes of subgroups of finite group having same set of orders of elements. We show that this poset is a chain only in the case of p-groups and moreover, we characterize all finite groups for which this…

Group Theory · Mathematics 2026-03-09 Sachin Ballal , Tushar Halder

For real polynomials with (sparse) exponents in some fixed set, \[ \Psi(t)=x+y_1t^{k_1}+\ldots +y_L t^{k_L}, \] we analyse the types of root structures that might occur as the coefficients vary. We first establish a stratification of roots…

Classical Analysis and ODEs · Mathematics 2022-04-12 Reuben Wheeler

Linearized polynomials appear in many different contexts, such as rank metric codes, cryptography and linear sets, and the main issue regards the characterization of the number of roots from their coefficients. Results of this type have…

Combinatorics · Mathematics 2020-05-07 Olga Polverino , Ferdinando Zullo