Related papers: Counting Descents in Standard Young Tableaux
We present a conjectual hook formula concerning the number of the standard tableaux on "cylindric" skew diagrams. Our formula can be seen as an extension of Naruse's hook formula for skew diagrams. Moreover, we prove our conjecture in some…
We study the enumeration of bargraphs with respect to some corner statistics. We find generating functions for the number of bargraphs that tracks the corner statistics of interest, the number of cells, and the number of columns. The…
Let $F$ be a number field and $p\geq7$ a rational prime. We obtain a simple descent criterion characterising those projective Galois representations $\overline\rho:G_F\to\mathrm{PGL}_2(\mathbb{F}_p)$ for which the corresponding twist…
We consider the relation between various permutation statistics and properties of permutation tableaux. We answer some of the questions of Steingrimsson and Williams (math.CO/0507149), in particular, on the distribution of the bistatistic…
In recent work of Baik, Deift and Rains convergence of moments was established for the limiting joint distribution of the lengths of the first k rows in random Young tableaux. The main difficulty was obtaining a good estimate for the tail…
Let E be an elliptic curve over Q (or, more generally, a number field). Then on the one hand, we have the finitely generated abelian group E(Q), on the other hand, there is the Shafarevich-Tate group Sha(Q,E). Descent is a general method of…
Cylindric Young tableaux are combinatorial objects that first appeared in the 1990s. A natural extension of the classical notion of a Young tableau, they have since been used several times, most notably by Gessel and Krattenthaler and by…
In a recent article we introduced a mechanism for producing a presentation of the descent algebra of the symmetric group as a quiver with relations, the mechanism arising from a new construction of the descent algebra as a homomorphic image…
We present refined enumeration formulas for lattice paths in $\mathbb{Z}^2$ with two kinds of steps, by keeping track of the number of descents (i.e., turns in a given direction), the major index (i.e., the sum of the positions of the…
The purpose of the present article is to define and study a new class of descent algebras, called twisted descent algebras. These algebras are associated to the Barratt-Joyal theory of twisted bialgebras in the same way than classical…
The paper describes a system of rays declining at small angles in lasers. The correlation between a group of rays and binomial coefficients is shown. The correlation of distribution of rays in the system of numbers placed in a…
Baryshnikov and Romik derived the combinatorial identities for the numbers of the $m$-strip tableaux. This generalized the classical Andr\'e's theorem for the number of up-down permutations. They asked for a bijective proof for the…
This is an elementary exposition of the basic descent theorems for algebraic schemes over fields (Grothendieck, Weil, ...).
The celebrated hook-length formula gives a product formula for the number of standard Young tableaux of a straight shape. In 2014, Naruse announced a more general formula for the number of standard Young tableaux of skew shapes as a…
Quasi-Yamanouchi tableaux are a subset of semistandard Young tableaux and refine standard Young tableaux. They are closely tied to the descent set of standard Young tableaux and were introduced by Assaf and Searles to tighten Gessel's…
We provide an algebraic-geometrical interpretation of the classical semistandard Young-tableaux via the notion of Seshadri stratifications. The columns appearing in such a tableau correspond to vanishing multiplicities of certain rational…
We give some special values of Grothendieck polynomials and an explicit formula for the number of set-valued tableaux. For Young diagrams consisting of a single row or a single column, both the value and number are written by the Gauss'…
We introduce near triple arrays as binary row-column designs with at most two consecutive values for the replication numbers of symbols, for the intersection sizes of pairs of rows, pairs of columns and pairs of a row and a column. Near…
In this paper we first study $k \times n$ Youden rectangles of small orders. We have enumerated all Youden rectangles for a range of small parameter values, excluding the almost square cases where $k = n-1$, in a large scale computer…
We consider the practical computation of rational points on y^2=x(x^2+ax+b). The algebra necessary for a 4-descent procedure is described. A simple further descent is then described which only uses integer arithmetic. Numerous examples are…