相关论文: On the $q$-Enumeration of Barely Set-Valued Tablea…
We consider a new kind of straight and shifted plane partitions/Young tableaux --- ones whose diagrams are no longer of partition shape, but rather Young diagrams with boxes erased from their upper right ends. We find formulas for the…
A standard barely set-valued tableau of shape $\lambda$ is a filling of the Young diagram $\lambda$ with integers $1,2,\dots,|\lambda|+1$ such that the integers are increasing in each row and column, and every cell contains one integer…
In this paper we establish an order statistics model of Young tableaux. Multiple integration over nested simplexes is applied to the enumeration of Young tableaux. A brief proof of Frobenius-Young's and Aitken's formulas is given. Partially…
We introduce a family of univariate polynomials indexed by integer partitions. At prime powers, they count the number of subspaces in a finite vector space that transform under a regular diagonal matrix in a specified manner. This…
The notion of a barely set-valued semistandard Young tableau was introduced by Reiner, Tenner and Yong in their study of the probability distribution of edges in the Young lattice of partitions. Given a partition $\lambda$ and a positive…
We use the 0-1 tableaux as a tool for enumerating permutations and partitions with restricted minima. The method used is extended for permutation pairs and partition pairs generated by a bipartite 0-1 tableaux.
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.…
This paper introduces two matrix analogues for set partitions. A composition matrix on a finite set X is an upper triangular matrix whose entries partition X, and for which there are no rows or columns containing only empty sets. A…
We present a matrix-theoretic approach for studying and enumerating finite posets through their incidence representations, referred to as poset matrices. Naturally labelled posets are encoded as Boolean lower triangular matrices, allowing a…
Standard set-valued Young tableaux are a generalization of standard Young tableaux in which cells may contain more than one integer, with the added conditions that every integer at position $(i,j)$ must be smaller than every integer at…
We prove a product formula for the remaining cases of the weighted enumeration of self-complementary plane partitions contained in a given box where adding one half of an orbit of cubes and removing the other half of the orbit changes the…
Vacillating tableaux are sequences of integer partitions that satisfy specific conditions. The concept of vacillating tableaux stems from the representation theory of the partition algebra and the combinatorial theory of crossings and…
Plane partitions naturally appear in many problems of statistical physics and quantum field theory, for instance, in the theory of faceted crystals and of topological strings on Calabi-Yau threefolds. In this paper a connection is made…
In certain finite posets, the expected down-degree of their elements is the same whether computed with respect to either the uniform distribution or the distribution weighting an element by the number of maximal chains passing through it.…
Standard set-valued Young tableaux are a generalization of standard Young tableaux where cells can contain unordered sets of integers, with the added condition that every integer at position $(i,j)$ must be smaller that every integer at…
The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. The chain polynomials of the partition lattices and their standard type $B$ analogues are shown to have only real roots.…
Tree-like tableaux are objects in bijection with alternative or permutation tableaux. They have been the subject of a fruitful combinatorial study for the past few years. In the present work, we define and study a new subclass of tree-like…
The partition algebra is an associative algebra with a basis of set-partition diagrams and multiplication given by diagram concatenation. It contains as subalgebras a large class of diagram algebras including the Brauer, planar partition,…
Quasi-Yamanouchi tableaux connect the two most studied types of tableaux. They are a subset of semistandard Young tableaux that are also a refinement on standard Young tableaux, and they can be used to improve the fundamental quasisymmetric…
We introduce elliptic weights of boxed plane partitions and prove that they give rise to a generalization of MacMahon's product formula for the number of plane partitions in a box. We then focus on the most general positive degenerations of…