English
Related papers

Related papers: Vertex Posets, Monotone Path Polytopes, and Chow P…

200 papers

The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. The chain polynomials of the partition lattices and their standard type $B$ analogues are shown to have only real roots.…

Combinatorics · Mathematics 2023-01-03 Christos A. Athanasiadis , Katerina Kalampogia-Evangelinou

We continue the study of real polynomials acting entrywise on matrices of fixed dimension to preserve positive semidefiniteness, together with the related analysis of order properties of Schur polynomials. Previous work has shown that,…

Classical Analysis and ODEs · Mathematics 2023-10-30 Alexander Belton , Dominique Guillot , Apoorva Khare , Mihai Putinar

Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…

Combinatorics · Mathematics 2007-05-23 S. Gao , A. G. B. Lauder

We generalize the notion of graded posets to what we call sign-graded (labeled) posets. We prove that the $W$-polynomial of a sign-graded poset is symmetric and unimodal. This extends a recent result of Reiner and Welker who proved it for…

Combinatorics · Mathematics 2012-04-18 Petter Branden

The M\"obius polynomial is an invariant of ranked posets, closely related to the M\"obius function. In this paper, we study the M\"obius polynomial of face posets of convex polytopes. We present formulas for computing the M\"obius…

Combinatorics · Mathematics 2016-08-18 Meena Jagadeesan , Susan Durst

The monotone path polytope of a polytope $P$ encapsulates the combinatorial behavior of the shadow vertex rule (a pivot rule used in linear programming) on $P$. Computing monotone path polytopes is the entry door to the larger subject of…

Combinatorics · Mathematics 2025-10-24 Germain Poullot

Consider the problem, usually called the P\'olya-Chebotarev problem, of finding a continuum in the complex plane including some given points such that the logarithmic capacity of this continuum is minimal. We prove that each connected…

Complex Variables · Mathematics 2013-06-27 Klaus Schiefermayr

For any positive integers $a$ and $b$, we enumerate all colored partitions made by noncrossing diagonals of a convex polygon into polygons whose number of sides is congruent to $b$ modulo $a$. For the number of such partitions made by a…

Combinatorics · Mathematics 2017-01-23 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

To every poset P, Stanley (1986) associated two polytopes, the order polytope and the chain polytope, whose geometric properties reflect the combinatorial qualities of P. This construction allows for deep insights into combinatorics by way…

Combinatorics · Mathematics 2017-05-08 Thomas Chappell , Tobias Friedl , Raman Sanyal

We investigate a trivariate polynomial associated with rooted trees. It generalises a bivariate polynomial for rooted trees that was recently introduced by Liu. We show that this polynomial satisfies a deletion-contraction recursion and can…

Combinatorics · Mathematics 2022-02-15 Valisoa Razanajatovo Misanantenaina , Stephan Wagner

Given a pair of finite posets $A \subseteq P$, the function counting integer-valued order preserving extensions of an order preserving map $\lambda : A\rightarrow \mathbb{Z}$ from $A$ to $P$ is given by a piecewise polynomial in $\lambda$.…

Combinatorics · Mathematics 2026-04-20 Katharina Jochemko , Krishna Menon

We introduce two polynomials (in $q$) associated with a finite poset $P$ that encode some information on the covering relation in $P$. If $P$ is a distributive lattice, and hence $P$ is isomorphic to the poset of dual order ideals in a…

Combinatorics · Mathematics 2012-05-22 Dmitri I. Panyushev

A conjecture of Beauville and Voisin states that for an irreducible symplectic variety X, any polynomial relation between classes of divisors and the Chern classes of X which holds in cohomology already holds in the Chow groups. We verify…

Algebraic Geometry · Mathematics 2009-07-31 Andrea Ferretti

We classify projective toric manifolds whose dual variety is not a hypersurface in the dual projective space. Under the standard dictionary between toric geometry and convex geometry, they correspond to certain convex Delzant integer…

Algebraic Geometry · Mathematics 2007-05-23 Sandra Di Rocco

In 1986 Stanley associated to a poset the order polytope. The close interplay between its combinatorial and geometric properties makes the order polytope an object of tremendous interest. Double posets were introduced in 2011 by Malvenuto…

Combinatorics · Mathematics 2022-09-15 Aenne Benjes

We call a poset factorable if its characteristic polynomial has all positive integer roots. Inspired by inductive and divisional freeness of a central hyperplane arrangement, we introduce and study the notion of inductive posets and their…

Combinatorics · Mathematics 2024-01-09 Roberto Pagaria , Maddalena Pismataro , Tan Nhat Tran , Lorenzo Vecchi

The multiple root loci among univariate polynomials of degree $n$ are indexed by partitions of $n$. We study these loci and their conormal varieties. The projectively dual varieties are joins of such loci where the partitions are hooks. Our…

Algebraic Geometry · Mathematics 2015-10-26 Hwangrae Lee , Bernd Sturmfels

In this paper, we derive recurrence relations of forcing polynomials for monotonic CHS and the other is CHS with one turning.

Combinatorics · Mathematics 2021-12-01 Shuang Zhao

We establish basic facts about the varieties of homogeneous polynomials divisible by powers of linear forms, and explain consequences for geometric complexity theory. This includes quadratic set-theoretic equations, a description of the…

Algebraic Geometry · Mathematics 2012-04-23 Harlan Kadish , J. M. Landsberg

In a previous paper: A. Paszkiewicz, T. Sobieszek, Additive Entropies of Partitions, we have given a description of additive partition entropies that is real functions $I$ on the set of finite partitions that are additive on stochastically…

Information Theory · Computer Science 2015-03-20 Tomasz Sobieszek