Related papers: Naruse hook formula for linear extensions of mobil…
We define oriented posets with correpsonding rank matrices, where linking two posets by an edge corresponds to matrix multiplication. In particular, linking chains via this method gives us fence posets, and taking traces gives us circular…
Define an expansion poset to be the poset of monomials of a cluster variable attached to an arc in a polygon, where each monomial is represented by the corresponding combinatorial object from some fixed combinatorial cluster expansion…
Inspired by the infinite families of finite and affine root systems, we consider a "stretching" operation on general crystallographic root systems which, on the level of Coxeter diagrams, replaces a vertex with a path of unlabeled edges. We…
A jump is a pair of consecutive elements in an extension of a poset which are incomparable in the original poset. The arboreal jump number is an NP-hard problem that aims to find an arboreal extension of a given poset with minimum number of…
The geometric and algebraic theory of valuations on cones is applied to understand identities involving summing certain rational functions over the set of linear extensions of a poset.
The classical way of extending an $[n, k, d]$ linear code $\C$ is to add an overall parity-check coordinate to each codeword of the linear code $\C$. This extended code, denoted by $\overline{\C}(-\bone)$ and called the standardly extended…
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…
Recently, Han obtained two hook length formulas for binary trees and asked for combinatorial proofs. One of Han's formulas has been generalized to k-ary trees by Yang. Sagan has found a probabilistic proof of Yang's extension. We give…
Recently, a new weighted generalization of the branching rule for the hook lengths, equivalent to the hook formula, was proved. In this paper, we generalize the complementary branching rule, which can be used to prove Burnside's formula. We…
We create a framework for studying symmetric chain decompositions of families of finite posets based on the geometry of polytopes. Our framework unifies almost all known results regarding symmetric chain decompositions of the Young posets…
In this work we introduce and study various generalizations of the notion of increasingly labelled trees, where the label of a child node is always larger than the label of its parent node, to multilabelled tree families, where the nodes in…
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…
Representing visual data using compact binary codes is attracting increasing attention as binary codes are used as direct indices into hash table(s) for fast non-exhaustive search. Recent methods show that ranking binary codes using…
Given a primitive collection of vectors in the integer lattice, we count the number of ways it can be extended to a basis by vectors with sup-norm bounded by $T$, producing an asymptotic estimate as $T \to \infty$. This problem can be…
Sign imbalance is a statistic on posets which counts the difference between the number of even and odd linear extensions. We prove complexity results about the sign imbalance and parity of linear extensions, focusing on the representative…
In this paper, we give a constructive method for linear extensions of Zadeh's fuzzy orders. We also characterize Zadeh's fuzzy orders by their linear extensions.
Extensions of real numbers in more than two dimensions, in particular quaternions and octonions are finding applications in physics due to the fact that they naturally capture certain symmetries of physical systems. Here it is shown that…
Let $(\mathcal{P},\leqslant)$ be a finite poset. Define the numbers $a_1,a_2,\ldots$ (respectively, $c_1,c_2,\ldots$) so that $a_1+\ldots+a_k$ (respectively, $c_1+\ldots+c_k$) is the maximal number of elements of $\mathcal{P}$ which may be…
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…
We study linear response for families of skew-product dynamical systems with contracting fibres. Our approach is based on a sectional transfer operator acting on families of probability measures along the fibres. The operator allows to…