Related papers: The $cd$-Index: A Survey
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.
F-index of a graph is the sum of the cube of the degrees of the vertices. In this paper, we investigate the F-indices of unicyclic graphs by introducing some transformation, and characterize the unicyclic graphs with the first five largest…
The dimension is a key measure of complexity of partially ordered sets. Small dimension allows succinct encoding. Indeed if $P$ has dimension $d$, then to know whether $x \leq y$ in $P$ it is enough to check whether $x\leq y$ in each of the…
An Eulerian orientation is an orientation of the edges of a graph such that every vertex is balanced: its in-degree equals its out-degree. Counting Eulerian orientations corresponds to the crucial partition function in so-called ``ice-type…
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We give a representation of directed graphs by k-posets; this provides a new proof of the universality of the homomorphism order of k-posets. This…
A well-known conjecture of McMullen, proved by Billera, Lee and Stanley, describes the face numbers of simple polytopes. The necessary and sufficient condition is that the toric g-vector of the polytope is an M-vector, that is, the vector…
A barcode is a finite multiset of intervals on the real line, $B = \{ (b_i, d_i)\}_{i=1}^n$. Barcodes are important objects in topological data analysis, where they serve as summaries of the persistent homology groups of a filtration. The…
A cluster graph is a graph whose every connected component is a complete graph. Given a simple undirected graph $G$, a subset of vertices inducing a cluster graph is called an independent union of cliques (IUC), and the IUC polytope…
We associate in a natural way to any partially ordered set $(P,\leq)$ a directed graph $E_P$ (where the vertices of $E_P$ correspond to the elements of $P$, and the edges of $E_P$ correspond to related pairs of elements of $P$), and then…
Sorting is a foundational problem in computer science that is typically employed on sequences or total orders. More recently, a more general form of sorting on partially ordered sets (or posets), where some pairs of elements are…
Counting linear extensions is a fundamental problem in poset theory. It is known to be #P-complete, with polynomial-time formulas available in special cases. In this work, we develop new recursive formulas for counting linear extensions of…
Circular perfect graphs are those undirected graphs such that the circular clique number is equal to the circular chromatic number for each induced subgraph. They form a strict superclass of the perfect graphs, whose index coding broadcast…
We develop a direct method to recover an orthoalgebra from its poset of Boolean subalgebras. For this a new notion of direction is introduced. Directions are also used to characterize in purely order-theoretic terms those posets that are…
We extend a recently established combinatorial index formula applying to Lie poset algebras of types B, C, and D. Then, using the extended index formula, we determine a characterization of contact Lie poset algebras of types B, C, and D…
The interval poset of a permutation catalogues the intervals that appear in its one-line notation, according to set inclusion. We study this poset, describing its structural, characterizing, and enumerative properties.
We derive an identity for certain linear combinations of polylogarithm functions with negative exponents, which implies relations for linear combinations of Eulerian numbers. The coefficients of our linear combinations are related to…
According to the structural balance theory, a signed graph is considered structurally balanced when it can be partitioned into a number of modules such that positive and negative edges are respectively located inside and between the…
The queue-number of a poset is the queue-number of its cover graph viewed as a directed acyclic graph, i.e., when the vertex order must be a linear extension of the poset. Heath and Pemmaraju conjectured that every poset of width $w$ has…
There is a natural notion of a subdivision of a lower Eulerian poset called a strong formal subdivision, which abstracts the notion of a polyhedral subdivision of a polytope, or a proper, surjective morphism of fans. We show that there is a…
We introduce two new partial orders on the standard Young tableaux of a given partition shape, in analogy with the strong and weak Bruhat orders on permutations. Both posets are ranked by the major index statistic offset by a fixed shift.…