English
Related papers

Related papers: Flag vectors of Eulerian partially ordered sets

200 papers

A partially ordered set is r-thick if every nonempty open interval contains at least r elements. This paper studies the flag vectors of graded, r-thick posets and shows the smallest convex cone containing them is isomorphic to the cone of…

Combinatorics · Mathematics 2007-05-23 Margaret M. Bayer , Gabor Hetyei

A graded partially ordered set is Eulerian if every interval has the same number of elements of even rank and of odd rank. Face lattices of convex polytopes are Eulerian. For Eulerian partially ordered sets, the flag vector can be encoded…

Combinatorics · Mathematics 2007-05-23 Margaret M. Bayer

The closure of the convex cone generated by all flag $f$-vectors of graded posets is shown to be polyhedral. In particular, we give the facet inequalities to the polar cone of all nonnegative chain-enumeration functionals on this class of…

Combinatorics · Mathematics 2016-09-07 Louis J. Billera , Gábor Hetyei

We study algebraic and homological properties of facet ideals of order complexes of posets which we call ideals of maximal flags of posets or simply flag ideals. We characterize the unmixed and Cohen-Macaulay flag ideals of graded posets.…

Commutative Algebra · Mathematics 2017-06-20 Amin Nematbakhsh

This is a survey of the $cd$-index of Eulerian partially ordered sets. The $cd$-index is an encoding of the numbers of chains, specified by ranks, in the poset. It is the most efficient such encoding, incorporating all the affine relations…

Combinatorics · Mathematics 2020-06-05 Margaret M. Bayer

The flag vector contains all the face incidence data of a polytope, and in the poset setting, the chain enumerative data. It is a classical result due to Bayer and Klapper that for face lattices of polytopes, and more generally, Eulerian…

Combinatorics · Mathematics 2014-10-08 Richard Ehrenborg , Mark Goresky , Margaret Readdy

We prove that the partial order on the set of matchings of 2n points on a circle, given by resolving crossings, is an Eulerian poset.

Combinatorics · Mathematics 2014-06-24 Thomas Lam

The notion of level posets is introduced. This class of infinite posets has the property that between every two adjacent ranks the same bipartite graph occurs. When the adjacency matrix is indecomposable, we determine the length of the…

Combinatorics · Mathematics 2014-06-10 Richard Ehrenborg , Gábor Hetyei , Margaret Readdy

In this paper we study finite Eulerian posets which are binomial, Sheffer or triangular. These important classes of posets are related to the theory of generating functions and to geometry. The results of this paper are organized as…

Combinatorics · Mathematics 2010-01-20 Hoda Bidkhori

The flag f-vectors of three-colored complexes are characterized. This also characterizes the flag h-vectors of balanced Cohen-Macaulay complexes of dimension two, as well as the flag h-vectors of balanced shellable complexes of dimension…

Combinatorics · Mathematics 2010-06-25 Andrew Frohmader

We extend the definition of coarse flag Hilbert--Poincar\'e series to matroids; these series arise in the context of local Igusa zeta functions associated to hyperplane arrangements. We study these series in the case of oriented matroids by…

Combinatorics · Mathematics 2025-05-21 Lukas Kühne , Joshua Maglione

We determine a family of functors from a poset to abelian groups such that the higher direct limits vanish on them. This is done by first characterizing the projective functors. Then a spectral sequence arising from the grading of the poset…

Algebraic Topology · Mathematics 2007-11-08 Antonio Diaz

We show that if a $d$-dimensional Cohen-Macaulay complex is, in a certain sense, sufficiently "close" to being balanced, then there is a $d$-dimensional balanced Cohen-Macaulay complex having the same $f$-vector. This in turn provides some…

Combinatorics · Mathematics 2010-10-13 Jonathan Browder

Huggett and Moffatt characterized all bipartite partial duals of a plane graph in terms of all-crossing directions of its medial graph. Then Metsidik and Jin characterized all Eulerian partial duals of a plane graph in terms of…

Combinatorics · Mathematics 2017-06-14 Qingying Deng , Xian'an Jin

We prove a number of new restrictions on the enumerative properties of homology manifolds and semi-Eulerian complexes and posets. These include a determination of the affine span of the fine $h$-vector of balanced semi-Eulerian complexes…

Combinatorics · Mathematics 2007-09-26 Ed Swartz

The number of planar Eulerian maps with n edges is well-known to have a simple expression. But what is the number of planar Eulerian orientations with n edges? This problem appears to be difficult. To approach it, we define and count…

Combinatorics · Mathematics 2025-04-11 Nicolas Bonichon , Mireille Bousquet-Mélou , Paul Dorbec , Claire Pennarun

The P-Eulerian polynomial counts the linear extensions of a labeled partially ordered set, P, by their number of descents. It is known that the P-Eulerian polynomials are real-rooted for various classes of posets P. The purpose of this…

Combinatorics · Mathematics 2016-04-15 Petter Brändén , Madeleine Leander

Let $G$ be a graph, and $H$ be a finite subgraph of $G$. We say that $H$ is a (semi) $S$-Eulerian subgraph if there exists a closed (open) trail $T$ in $G$ such that each edge of $H$ appears in $T$. We show that the problem of determining…

Combinatorics · Mathematics 2026-02-18 Marcin Stawiski

The $n^{th}$ partial flag incidence algebra of a poset $P$ is the set of functions from $P^n$ to some ring which are zero on non-partial flag vectors. These partial flag incidence algebras for $n>2$ are not commutative, not unitary, and not…

Combinatorics · Mathematics 2022-02-01 Max Wakefield

A conjecture of Kalai and Eckhoff that the face vector of an arbitrary flag complex is also the face vector of some particular balanced complex is verified.

Combinatorics · Mathematics 2007-05-23 Andrew Frohmader
‹ Prev 1 2 3 10 Next ›