相关论文: Cyclic descents for near-hook and two-row shapes

A cyclic descent function on standard Young tableaux of size $n$ is a function that restricts to the usual descent function when $n$ is omitted, such that the number of standard Young tableaux of given shape with cyclic descent set…

A notion of cyclic descents on standard Young tableaux (SYT) of rectangular shape was introduced by Rhoades, and extended to certain skew shapes by Adin, Elizalde and Roichman. The cyclic descent set restricts to the usual descent set when…

The notion of descent set, for permutations as well as for standard Young tableaux (SYT), is classical. Cellini introduced a natural notion of {\em cyclic descent set} for permutations, and Rhoades introduced such a notion for SYT --- but…

We examine a few families of semistandard Young tableaux, for which we observe the cyclic sieving phenomenon under promotion. The first family we consider consists of stretched hook shapes, where we use the cocharge generating polynomial as…

We study shifted standard Young tableaux (SYT). The limiting surface of uniformly random shifted SYT of staircase shape is determined, with the integers in the SYT as heights. This implies via properties of the Edelman-Greene bijection…

In 2010, B. Rhoades proved that promotion together with the fake-degree polynomial associated with rectangular standard Young tableaux give an instance of the cyclic sieving phenomenon. We extend this result to all skew standard Young…

We present a bijection between the set of standard Young tableaux of staircase minus rectangle shape, and the set of marked shifted standard Young tableaux of a certain shifted shape. Numerically, this result is due to DeWitt (2012).…

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…

This paper deals with the distribution of descent number in standard Young tableaux of certain shapes. A simple explicit formula is presented for the number of tableaux of any shape with two rows, with any specified number of descents. For…

The ring of cyclic quasi-symmetric functions and its non-Escher subring are introduced in this paper. A natural basis consists of fundamental cyclic quasi-symmetric functions; for the non-Escher subring they arise as toric $P$-partition…

A new descent set statistic on involutions, defined geometrically via their interpretation as matchings, is introduced in this paper, and shown to be equi-distributed with the standard one. This concept is then applied to construct explicit…

We introduce a notion of {\em cyclic Schur-positivity} for sets of permutations, which naturally extends the classical notion of Schur-positivity, and it involves the existence of a bijection from permutations to standard Young tableaux…

In this paper, we study a new cyclic sieving phenomenon on the set $\mathsf{SST}_n(\lambda)$ of semistandard Young tableaux with the cyclic action $\mathsf{c}$ arising from its $U_q(\mathfrak{sl}_n)$-crystal structure. We prove that if…

We characterize the class of cycle decompositions that can achieve all Young tableau shapes (except the trivial ones with a single row or a single column) under the Robinson--Schensted--Knuth (RSK) correspondence, a property that we call…

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…

The expectation of the descent number of a random Young tableau of a fixed shape is given, and concentration around the mean is shown. This result is generalized to the major index and to other descent functions. The proof combines…

In this note, we provide a short proof of Theorem 3.3 in the paper titled \emph{Crystals, semistandard tableaux and cyclic sieving phenomenon}, by Y.-T.~Oh and E.~Park, which concerns a cyclic sieving phenomenon on semi-standard Young…

An increasing tableau is a semistandard tableau with strictly increasing rows and columns. It is well known that the Catalan numbers enumerate both rectangular standard Young tableaux of two rows and also Dyck paths. We generalize this to a…

The problem of finding Schur-positive sets of permutations, originally posed by Gessel and Reutenauer, has seen some recent developments. Schur-positive sets of pattern-avoiding permutations have been found by Sagan et al and a general…

Let $\delta=(\delta_1,\ldots,\delta_n)$ be a string of letters $h$ and $v$. We define a Young tableau to be $\delta$-semistandard if the entries are weakly increasing along rows and columns, and the entries $i$ form a horizontal strip if…