Related papers: Equality of P-partition generating functions
We show that for every orthomodular poset P of finite height there can be defined two operators forming an adjoint pair with respect to an order-like relation defined on the power set of P. This enables us to introduce the so-called…
In this paper starting process with the infinite number of types of particles \mu(t) generate stopped branching process \xi(t), if by falling of the first one into the non empty set S process stops. Here we consider the generating…
The hypergeometric distribution is a popular distribution, whose properties have been extensively investigated. Generating functions of this distribution, such as the probability-generating function, the moment-generating function, and the…
A quotient of a poset $P$ is a partial order obtained on the equivalence classes of an equivalence relation $\theta$ on $P$; $\theta$ is then called a congruence if it satisfies certain conditions, which vary according to different…
We introduce the notion of crossings and nestings of a permutation. We compute the generating function of permutations with a fixed number of weak exceedances, crossings and nestings. We link alignments and permutation patterns to these…
In this paper we study generating functions resembling the rank of strongly unimodal sequences. We give combinatorial interpretations, identities in terms of mock modular forms, asymptotics, and a parity result. Our functions imitate a…
The algebra of so-called shifted symmetric functions on partitions has the property that for all elements a certain generating series, called the $q$-bracket, is a quasimodular form. More generally, if a graded algebra $A$ of functions on…
Many combinatorial generating functions can be expressed as combinations of symmetric functions, or extracted as sub-series and specializations from such combinations. Gessel has outlined a large class of symmetric functions for which the…
A poset is representable if it can be embedded in a field of sets in such a way that existing finite meets and joins become intersections and unions respectively (we say finite meets and joins are preserved). More generally, for cardinals…
A q-series with nonnegative power series coefficients is called positive. The partition statistics BG-rank is defined as an alternating sum of parities of parts of a partition. It is known that the generating function for the number of…
We define the partition and $n$-point correlation functions for a vertex operator superalgebra on a genus two Riemann surface formed by sewing two tori together. For the free fermion vertex operator superalgebra we obtain a closed formula…
We construct an evidently positive multiple series as a generating function for partitions satisfying the multiplicity condition in Schur's partition theorem. Refinements of the series when parts in the said partitions are classified…
Equivalence relations on the edge set of a graph $G$ that satisfy restrictive conditions on chordless squares play a crucial role in the theory of Cartesian graph products and graph bundles. We show here that such relations in a natural way…
Branched covers of the complex projective line ramified over $0,1$ and $\infty$ (Grothendieck's {\em dessins d'enfant}) of fixed genus and degree are effectively enumerated. More precisely, branched covers of a given ramification profile…
A production function $f$ is called quasi-sum if there are strict monotone functions $F, h_1,...,h_n$ with $F'>0$ such that $$f(x)= F(h_1 (x_1)+...+h_n (x_n)).$$ The justification for studying quasi-sum production functions is that these…
We construct the independent particle representation for the Semistandard Young Tableaux (SsYT) of skew shape $\lambda/\mu.$ The partition function of this particle system gives the generating function of the SsYT of skew shape…
In 1995, the first author introduced a multivariate generating function {$G$} that tracks the distribution of ascents and descents in labeled binary trees. In addition to proving that $G$ is symmetric, he conjectured that $G$ is Schur…
A partition of a finite poset into chains places a natural upper bound on the size of a union of k antichains. A chain partition is k-saturated if this bound is achieved. Greene and Kleitman proved that, for each k, every finite poset has a…
The paper introduce a new type of partitions where the largest part appears exactly once, and the remaining parts constitute a partition of that largest part. We derive the generating function associated with these partitions and…
We show that a recent identity of Beck-Gessel-Lee-Savage on the generating function of symmetrically contrained compositions of integers generalizes naturally to a family of convex polyhedral cones that are invariant under the action of a…