In this paper, we first give formulas for the order polynomial $Ω(\Pw; t)$ and the Eulerian polynomial $e(\Pw; λ)$ of a finite labeled poset $(P, ω)$ using the adjacency matrix of what we call the $ω$-graph of $(P, ω)$. We then derive various recursion formulas for $Ω(\Pw; t)$ and $e(\Pw; λ)$ and discuss some applications of these formulas to Bernoulli numbers and Bernoulli polynomials. Finally, we give a recursive algorithm using a single linear operator on a vector space. This algorithm provides a uniform method to construct a family of new invariants for labeled posets $(\Pw)$, which includes the order polynomial $Ω(\Pw; t)$ and the invariant $\tilde e(\Pw; λ) =\frac {e(\Pw; λ)}{(1-λ)^{|P|+1}}$. The well-known quasi-symmetric function invariant of labeled posets and a further generalization of our construction are also discussed.
We prove that the posets of connected components of intersections of toric and elliptic arrangements defined by root systems are EL-shellable and we compute their homotopy type. Our method rests on Bibby's description of such posets by means of "labeled partitions": after giving an EL-labeling and counting homology chains for general posets of labeled partitions, we obtain the stated results by considering the appropriate subposets.
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 universal order is a distributive lattice. We investigate some other properties, namely the infinite distributivity, the computation of infinite suprema and infima, and the complexity of certain decision problems involving the homomorphism order of k-posets. Sublattices are also examined.
The $P$-partition generating function of a (naturally labeled) poset $P$ is a quasisymmetric function enumerating order-preserving maps from $P$ to $\mathbb{Z}^+$. Using the Hopf algebra of posets, we give necessary conditions for two posets to have the same generating function. In particular, we show that they must have the same number of antichains of each size, as well as the same shape (as defined by Greene). We also discuss which shapes guarantee uniqueness of the $P$-partition generating function and give a method of constructing pairs of non-isomorphic posets with the same generating fu…
To every labeled poset (P,ω), one can associate a quasisymmetric generating function for its (P,ω)-partitions. We ask: when do two labeled posets have the same generating function? Since the special case corresponding to skew Schur function equality is still open, a complete classification of equality among (P,ω) generating functions is likely too much to expect. Instead, we determine necessary conditions and separate sufficient conditions for two labeled posets to have equal generating functions. We conclude with a classification of all equalities for labeled posets with small numbers of line…
Given a finite graded poset with labeled Hasse diagram, we construct a quasi- symmetric generating function for (saturated) chains whose labels have fixed descents. This is a common generalization of a generating function for the flag f-vector defined by Ehrenborg and of a symmetric function associated to certain edge-labeled posets which arose in the theory of Schubert polynomials. We show this construction gives a Hopf morphism from an incidence algebra of edge-labeled posets to the Hopf algebra of quasi-symmetric functions.
Each labeled rooted tree is associated with a hyperplane arrangement, which is free with exponents given by the depths of the vertices of this tree. The intersection lattices of these arrangements are described through posets of forests. These posets are used to define coalgebras, whose dual algebras are shown to have a simple presentation by generators and relations.
In this paper we give a generalization of Chebyshev polynomials and using this we describe the Möbius function of the generalized subword order from a poset {a1,...as,c |ai<c}, which contains an affirmative answer for the conjecture by Björner, Sagan, Vatter.[5,10]
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 graded posets by associating a simplicial polytopal sphere to each graded poset $P$. By proving that the $W$-polynomials of sign-graded posets has the right sign at -1, we are able to prove the Charney-Davis Conjecture for these spheres (whenever they are flag).
We prove the unimodality of the Ehrhart $δ$-polynomial of the chain polytope of the zig-zag poset, which was conjectured by Kirillov. First, based on a result due to Stanley, we show that this polynomial coincides with the $W$-polynomial for the zig-zag poset with some natural labeling. Then, its unimodality immediately follows from a result of Gasharov, which states that the $W$-polynomials of naturally labeled graded posets of rank $1$ or $2$ are unimodal.
Let $X$ be a finite set, $Z \subseteq X$ and $y \notin X$. Marcel Erné showed in 1981, that the number of posets on $X$ containing $Z$ as an antichain equals the number of posets $R$ on $X \cup \{ y \}$ in which the points of $Z \cup \{ y \}$ are exactly the maximal points of $R$. We prove the following generalization: For every poset $Q$ with carrier $Z$, the number of posets on $X$ containing $Q$ as an induced sub-poset equals the number of posets $R$ on $X \cup \{ y \}$ which contain $Q^d + A_y$ as an induced sub-poset and in which the maximal points of $Q^d + A_y$ are exactly the maximal p…
Three families of posets depending on a nonnegative integer parameter $m$ are introduced. The underlying sets of these posets are enumerated by the $m$-Fuss Catalan numbers. Among these, one is a generalization of Stanley lattices and another one is a generalization of Tamari lattices. The three families of posets are related: they fit into a chain for the order extension relation and they share some properties. Two associative algebras are constructed as quotients of generalizations of the Malvenuto-Reutenauer algebra. Their products describe intervals of our analogues of Stanley lattices and…
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 flag vectors of all graded posets. It also defines a k-analogue of the Mobius function and k-Eulerian posets, which are 2k-thick. Several characterizations of k-Eulerian posets are given. The generalized Dehn-Sommerville equations are proved for flag vectors of k-Eulerian posets. A new inequality is proved to be valid and sharp for rank 8 Eulerian posets.
The $(P, ω)$-partition generating function of a labeled poset $(P, ω)$ is a quasisymmetric function enumerating certain order-preserving maps from $P$ to $\mathbb{Z}^+$. We study the expansion of this generating function in the recently introduced type 1 quasisymmetric power sum basis $\{ψ_α\}$. Using this expansion, we show that connected, naturally labeled posets have irreducible $P$-partition generating functions. We also show that series-parallel posets are uniquely determined by their partition generating functions. We conclude by giving a combinatorial interpretation for the coefficients…
One of the central issues in extremal set theory is Sperner's theorem and its generalizations. Among such generalizations is the best-known BLYM inequality and the Ahlswede--Zhang (AZ) identity which surprisingly generalizes the BLYM inequality into an identity. Sperner's theorem and the BLYM inequality has been also generalized to a wide class of posets. Another direction in this research was the study of more part Sperner systems. In this paper we derive AZ type identities for regular posets. We also characterize all maximum 2-part Sperner systems for a wide class of product posets.
An order-theoretic generalization of Seymour relations describing the connection between the set-theoretic blocker, deletion, and contraction maps on clutters, is presented.
Peterson and Proctor obtained a formula which expresses the multivariate generating function for $P$-partitions on a $d$-complete poset $P$ as a product in terms of hooks in $P$. In this paper, we give a skew generalization of Peterson--Proctor's hook formula, i.e., a formula for the generating function for $(P \setminus F)$-partitions for a $d$-complete poset $P$ and its order filter $F$, by using the notion of excited diagrams. Our proof uses the Billey-type formula and the Chevalley-type formula in the equivariant $K$-theory of Kac--Moody partial flag varieties. This generalization provides…
We define a new class of countable groups, which are defined by its action on the set of monotonic numberings (diagrams) of an arbitrary finite or countable partial ordered set (poset). These groups are generated by the set of involutions? and in the case of finite posets could be considered as generalization of Coxeter's symmetric groups. We discuss the problems concerned to infinite groups jf this type, in particular the problem of the descripton of invariant measures on the space of numberings (central measures)with respect to actions of those groups. The probelms are tightly connected with…
A poset has the non-messing-up property if it has two covering sets of disjoint saturated chains so that for any labeling of the poset, sorting the labels along one set of chains and then sorting the labels along the other set yields a linear extension of the poset. The linear extension yielded by thus twice sorting a labeled non-messing-up poset may be independent of which sort was performed first. Here we characterize such sort-invariant labelings for convex subposets of a cylinder. They are completely determined by avoidance of a particular subpattern: a diamond of four elements whose small…
We introduce $δ$-cliffs, a generalization of permutations and increasing trees depending on a range map $δ$. We define a first lattice structure on these objects and we establish general results about its subposets. Among them, we describe sufficient conditions to have EL-shellable posets, lattices with algorithms to compute the meet and the join of two elements, and lattices constructible by interval doubling. Some of these subposets admit natural geometric realizations. Then, we introduce three families of subposets which, for some maps $δ$, have underlying sets enumerated by the Fuss-Catala…
We introduce a new combinatorial invariant, which we call crosscut poset, that is finer than the crosscut complex. We exhibit many applications of the crosscut poset which include a generalization of Björner's crosscut theorem and two results concerning the fixed point property and the fixed simplex property.
We consider the inversion enumerator I_n(q), which counts labeled trees or, equivalently, parking functions. This polynomial has a natural extension to generalized parking functions. Substituting q = -1 into this generalized polynomial produces the number of permutations with a certain descent set. In the classical case, this result implies the formula I_n(-1) = E_n, the number of alternating permutations. We give a combinatorial proof of these formulas based on the involution principle. We also give a geometric interpretation of these identities in terms of volumes of generalized chain polyto…
Poset-theoretic generalizations of set-theoretic committee constructions are presented. The structure of the corresponding subposets is described. Sequences of irreducible fractions associated to the principal order ideals of finite bounded posets are considered and those related to the Boolean lattices are explored; it is shown that such sequences inherit all the familiar properties of the Farey sequences.
We show that the well known {\em homotopy complementation formula} of Björner and Walker admits several closely related generalizations on different classes of topological posets (lattices). The utility of this technique is demonstrated on some classes of topological posets including the Grassmannian and configuration posets, $\widetilde{\mathbf G}_n(R)$ and $\exp_n(X)$ which were introduced and studied by V.~Vassiliev. Among other applications we present a reasonably complete description, in terms of more standard spaces, of homology types of configuration posets $\exp_n(S^m)$ which leads to …
Ceballos and Pons generalized weak order on permutations to a partial order on certain labeled trees, thereby introducing a new class of lattices called $s$-weak order. They also generalized the Tamari lattice by defining a particular sublattice of $s$-weak order called the $s$-Tamari lattice. We prove that the homotopy type of each open interval in $s$-weak order and in the $s$-Tamari lattice is either a ball or sphere. We do this by giving $s$-weak order and the $s$-Tamari lattice a type of edge labeling known as an SB-labeling. We characterize which intervals are homotopy equivalent to sphe…
Birational rowmotion is a discrete dynamical system on the set of all positive real-valued functions on a finite poset, which is a birational lift of combinatorial rowmotion on order ideals. It is known that combinatorial rowmotion for a minuscule poset has order equal to the Coxeter number, and exhibits the file homomesy phenomenon for refined order ideal cardinality statistic. In this paper we generalize these results to the birational setting. Moreover, as a generalization of birational promotion on a product of two chains, we introduce birational Coxeter-motion on minuscule posets, and pro…
We introduce Cayley posets as posets arising naturally from pairs $S<T$ of semigroups, much in the same way that Cayley graph arises from a (semi)group and a subset. We show that Cayley posets are a common generalization of several known classes of posets, e.g. posets of numerical semigroups (with torsion) and more generally affine semigroups. Furthermore, we give Sabidussi-type characterizations for Cayley posets and for several subclasses in terms of their endomorphism monoid. We show that large classes of posets are Cayley posets, e.g., series-parallel posets and (generalizations of) join-s…
We introduce a class of posets, which includes both ribbon posets (skew shapes) and $d$-complete posets, such that their number of linear extensions is given by a determinant of a matrix whose entries are products of hook lengths. We also give $q$-analogues of this determinantal formula in terms of the major index and inversion statistics. As applications, we give families of tree posets whose numbers of linear extensions are given by generalizations of Euler numbers, we draw relations to Naruse-Okada's positive formulas for the number of linear extensions of skew $d$-complete posets, and we g…
We use a classical result of McCord and reduction methods of finite spaces to prove a generalization of Thomason's theorem on homotopy colimits over posets. In particular this allows us to characterize the homotopy colimits of diagrams of simplicial complexes in terms of the Grothendieck construction on the diagrams of their face posets. We also derive analogues of well known results on homotopy colimits in the combinatorial setting, including a cofinality theorem and a generalization of Quillen's Theorem A for posets.
We construct a poset from a simple acyclic digraph together with a valuation on its vertices, and we compute the values of its Möbius function. We show that the weak order on Coxeter groups of type A, B, affine A, and the flag weak order on the wreath product $\mathbb{Z} \_r \wr S\_n$ introduced by Adin, Brenti and Roichman, are special instances of our construction. We conclude by associating a quasi-symmetric function to each element of these posets. In the $A$ and $\widetilde{A}$ cases, this function coincides respectively with the classical Stanley symmetric function, and with Lam's affine…
Some posets of binary leaf-labeled trees are shown to be supersolvable lattices and explicit EL-labelings are given. Their characteristic polynomials are computed, recovering their known factorization in a different way.
The Rees product of partially ordered sets was introduced by Björner and Welker. Using the theory of lexicographic shellability, Linusson, Shareshian and Wachs proved formulas, of significance in the theory of gamma-positivity, for the dimension of the homology of the Rees product of a graded poset $P$ with a certain $t$-analogue of the chain of the same length as $P$. Equivariant generalizations of these formulas are proven in this paper, when a group of automorphisms acts on $P$, and are applied to establish the Schur gamma-positivity of certain symmetric functions arising in algebraic and g…
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 and Reutenauer as a generalization of Stanleys labelled posets. A double poset is a finite set equipped with two partial orders. To a double poset Chappell, Friedl and Sanyal (2017) associated the double order polytope. They determined the combinatorial structure for the class of compatible double posets. In this paper we generalize their description to all d…
A modular semilattice is a semilattice generalization of a modular lattice. We establish a Birkhoff-type representation theorem for modular semilattices, which says that every modular semilattice is isomorphic to the family of ideals in a certain poset with additional relations.This new poset structure, which we axiomatize in this paper, is called a PPIP (projective poset with inconsistent pairs). A PPIP is a common generalization of a PIP (poset with inconsistent pairs) and a projective ordered space. The former was introduced by Barthélemy and Constantin for establishing Birkhoff-type theore…
We consider the graded $§_n$-modules of higher diagonally harmonic polynomials in three sets of variables (the trivariate case), and show that they have interesting ties with generalizations of the Tamari poset and parking functions. In particular we get several nice formulas for the associated Hilbert series and graded Frobenius characteristic. This also leads to entirely new combinatorial formulas.
We determine the Möbius function of the poset of compositions of an integer. In fact we give two proofs of this formula, one using an involution and one involving discrete Morse theory. The composition poset turns out to be intimately connected with subword order, whose Möbius function was determined by Björner. We show that using a generalization of subword order, we can obtain both Björner's results and our own as special cases.
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 paper is to extend these results to polynomials in several variables. To this end we study multivariate extensions of P-Eulerian polynomials and prove that for certain posets these polynomials are stable, i.e., non-vanishing whenever all variables are in the upper half-plane of the complex plane. A natural setting for our proofs is the Malvenuto-Reutenauer algeb…
By using techniques of poset representation theory, we present a formula for the number of partitions of a positive integer into three polygonal numbers.
We introduce and study s-lecture hall P-partitions which is a generalization of s-lecture hall partitions to labeled (weighted) posets. We provide generating function identities for s-lecture hall P-partitions that generalize identities obtained by Savage and Schuster for s-lecture hall partitions, and by Stanley for P-partitions. We also prove that the corresponding (P,s)-Eulerian polynomials are real-rooted for certain pairs (P,s), and speculate on unimodality properties of these polynomials.
Young's lattice is a partial order on integer partitions whose saturated chains correspond to standard Young tableaux, one type of combinatorial object that generates the Schur basis for symmetric functions. Generalizing Young's lattice, we introduce a new partial order on weak compositions that we call the key poset. Saturated chains in this poset correspond to standard key tableaux, the combinatorial objects that generate the key polynomials, a nonsymmetric polynomial generalization of the Schur basis. Generalizing skew Schur functions, we define skew key polynomials in terms of this new pos…
We describe a Markov-Chain-Monte-Carlo algorithm which can be used to generate naturally labeled n-element posets at random with a probability distribution of one's choice. Implementing this algorithm for the uniform distribution, we explore the approach to the asymptotic regime in which almost every poset takes on the three-layer structure described by Kleitman and Rothschild (KR). By tracking the n-dependence of several order-invariants, among them the height of the poset, we observe an oscillatory behavior which is very unlike a monotonic approach to the KR regime. Only around n=40 or so do…
