相关论文: On the sign-imbalance of skew partition shapes

Recently, Armon and Swanson introduced signed standard tableaux and a corresponding super major index that refines the classical major index. In this paper, we prove that signed standard tableaux of rectangular shape exhibit a cyclic…

We extend work of McKay, Morse, and Wilf by giving exact formulas and asymptotic formulas for the number of skew Young tableaux T in two situations: (1) the "inside shape" and total number of cells of T are fixed, and (2) the inside shape…

We introduce the dual affine Robinson-Schensted correspondence that gives a bijection between the extended affine symmetric group and tuples $(\bar{P},\bar{Q},\lambda,N)$, where $\bar{P}$ and $\bar{Q}$ are tabloids, $\lambda$ is a…

We investigate some scalar transmission problems between a classical positive material and a negative one, whose physical coefficients are negative. First, we consider cases where the negative inclusion is a disk in 2d and a ball in 3d.…

In previous work Regev used part of the representation theory of Lie superalgebras to compute the values of a character of the symmetric group whose decomposition into irreducible constituents is described by semistandard…

This paper makes a combinatorial study of the two monoids and the two types of tableaux that arise from the two possible generalizations of the Patience Sorting algorithm from permutations (or standard words) to words. For both types of…

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.…

Canon permutations are permutations of the multiset having $k$ copies of each integer between $1$ and $n$, with the property that the subsequences obtained by taking the $j$th copy of each entry, for each fixed $j$, are all the same. For…

We define a number of related combinatorial objects, each of which possesses a surprising symmetry. We include several applications such as a combinatorial explanation for certain fixed points of the involution $\omega$ on the ring of…

In this paper, we develop the Robinson-Schensted correspondence between the elements of the groups $G_{r}$ $(\mathbb{Z}_{p^{r}}\rtimes \mathbb{Z}^{*}_{p^{r}})$ and $SG_{r}$ $(\mathbb{Z}_{p^{r-1}}\rtimes \mathbb{Z}^{*}_{p^{r}})$, along with…

We bound the number of standard tableaux of skew shapes via thick hook decompositions in the Naruse hook length formula. Combining this with elementary counting arguments in the Murnaghan--Nakayama rule, we establish a uniform bound on…

Egecioglu and Remmel gave an interpretation for the entries of the inverse Kostka matrix K^{-1} in terms of special rim-hook tableaux. They were able to use this interpretation to give a combinatorial proof that KK^{-1}=I but were unable to…

The study of longest increasing subsequences (LIS) in permutations led to that of Young diagrams via Robinson-Schensted's (RS) correspondence. In a celebrated paper, Vershik and Kerov obtained a limit theorem for such diagrams and found…

The skewness of a graph G is the minimum number of edges in G whose removal results in a planar graph. By appropriately introducing a weight to each edge of a graph, we determine, among other thing, the skewness of the generalized Petersen…

We introduce a generalization of semistandard composition tableaux called permuted composition tableaux. These tableaux are intimately related to permuted basement semistandard augmented fillings studied by Haglund, Mason and Remmel. Our…

Motivated by the problem of the small-scale sign distribution of Laplace eigenfunctions, we introduce a strong notion of sign-balance for (eigen)functions, and prove that random eigenfunctions are sign-balanced above a precisely determined…

Young's lattice, the lattice of all Young diagrams, has the Robinson-Schensted-Knuth correspondence, the correspondence between certain matrices and pairs of semi-standard Young tableaux with the same shape. Fomin introduced generalized…

We introduce an object called a decorated Young tableau which can equivalently be viewed as a continuous time trajectory of Young diagrams or as a non-intersecting line ensemble. By a natural extension of the Robinson-Schensted…

We introduce the notions of Schr\"oder shape and of Schr\"oder tableau, which provide some kind of analogs of the classical notions of Young shape and Young tableau. We investigate some properties of the partial order given by containment…

We introduce a Littlewood-Richardson rule based on an algorithmic deformation of skew Young diagrams and present a bijection with the classical rule. The result is a direct combinatorial interpretation and proof of the geometric rule…