scholarly journals Asymptotics for the Distributions of Subtableaux in Young and Up-Down Tableaux

10.37236/1886 ◽  
2006 ◽  
Vol 11 (2) ◽  
Author(s):  
David J. Grabiner
Keyword(s):  
Random Walk ◽  
Young Tableau ◽  
Young Tableaux ◽  
Similar Formula ◽  
K Cells ◽  
Standard Tableau ◽  
Asymptotic Probability ◽  
Standard Young Tableau

Let $\mu$ be a partition of $k$, and $T$ a standard Young tableau of shape $\mu$. McKay, Morse, and Wilf show that the probability a randomly chosen Young tableau of $N$ cells contains $T$ as a subtableau is asymptotic to $f^\mu/k!$ as $N$ goes to infinity, where $f^\mu$ is the number of all tableaux of shape $\mu$. We use a random-walk argument to show that the analogous asymptotic probability for randomly chosen Young tableaux with at most $n$ rows is proportional to $\prod_{1\le i < j\le n}\bigl((\mu_i-i)-(\mu_j-j)\bigr)$; as $n$ goes to infinity, the probabilities approach $f^\mu/k!$ as expected. We have a similar formula for up-down tableaux; the probability approaches $f^\mu/k!$ if $\mu$ has $k$ cells and thus the up-down tableau is actually a standard tableau, and approaches 0 if $\mu$ has fewer than $k$ cells.

scholarly journals Combinatorics of Tableau Inversions

10.37236/4932 ◽  
2015 ◽  
Vol 22 (2) ◽  
Author(s):  
Jonathan E. Beagley ◽  
Paul Drube
Keyword(s):  
Betti Number ◽  
Young Tableau ◽  
Betti Numbers ◽  
Young Tableaux ◽  
Standard Tableau ◽  
Specific Standard ◽  
Different Shapes ◽  
Springer Fibers ◽  
Standard Young Tableau ◽  
Fixed Standard

A tableau inversion is a pair of entries in row-standard tableau $T$ that lie in the same column of $T$ yet lack the appropriate relative ordering to make $T$ column-standard.  An $i$-inverted Young tableau is a row-standard tableau along with precisely $i$ inversion pairs. Tableau inversions were originally introduced by Fresse to calculate the Betti numbers of Springer fibers in Type A, with the number of $i$-inverted tableaux that standardize to a fixed standard Young tableau corresponding to a specific Betti number of the associated fiber. In this paper we approach the topic of tableau inversions from a completely combinatorial perspective. We develop formulas enumerating the number of $i$-inverted Young tableaux for a variety of tableaux shapes, not restricting ourselves to inverted tableau that standardize a specific standard Young tableau, and construct bijections between $i$-inverted Young tableaux of a certain shape with $j$-inverted Young tableaux of different shapes. Finally, we share some the results of a computer program developed to calculate tableaux inversions.

scholarly journals Enumeration of Standard Young Tableaux of Shifted Strips with Constant Width

10.37236/6466 ◽  
2017 ◽  
Vol 24 (2) ◽  
Author(s):  
Ping Sun
Keyword(s):  
Integral Method ◽  
Recurrence Relations ◽  
Young Tableau ◽  
Constant Width ◽  
Young Tableaux ◽  
Pell Number ◽  
Standard Young Tableaux ◽  
Standard Young Tableau

Let $g_{n_1,n_2}$ be the number of standard Young tableau of truncated shifted shape with $n_1$ rows and $n_2$ boxes in each row. By using the integral method this paper derives the recurrence relations of $g_{3,n}$, $g_{n,4}$ and $g_{n,5}$ respectively. Specifically, $g_{n,4}$ is the $(2n-1)$-st Pell number.

scholarly journals Inversions of Semistandard Young Tableaux

10.37236/5469 ◽  
2016 ◽  
Vol 23 (1) ◽  
Author(s):  
Paul Drube
Keyword(s):  
Young Tableau ◽  
Betti Numbers ◽  
Young Tableaux ◽  
Closed Formula ◽  
General Shape ◽  
Combinatorial Objects ◽  
Standard Tableau ◽  
Specific Shape ◽  
Springer Fibers ◽  
Standard Young Tableaux

A tableau inversion is a pair of entries from the same column of a row-standard tableau that lack the relative ordering necessary to make the tableau column-standard. An $i$-inverted Young tableau is a row-standard tableau with precisely $i$ inversion pairs, and may be interpreted as a generalization of (column-standard) Young tableaux. Inverted Young tableaux that lack repeated entries were introduced by Fresse to calculate the Betti numbers of Springer fibers in Type A, and were later developed as combinatorial objects in their own right by Beagley and Drube. This paper generalizes earlier notions of tableau inversions to row-standard tableaux with repeated entries, yielding an interesting new generalization of semistandard (as opposed to merely standard) Young tableaux. We develop a closed formula for the maximum numbers of inversion pairs for a row-standard tableau with a specific shape and content, and show that the number of $i$-inverted tableaux of a given shape is invariant under permutation of content. We then enumerate $i$-inverted Young tableaux for a variety of shapes and contents, and generalize an earlier result that places $1$-inverted Young tableaux of a general shape in bijection with $0$-inverted Young tableaux of a variety of related shapes.

scholarly journals Generating Functions for Inverted Semistandard Young Tableaux and Generalized Ballot Numbers

10.37236/6376 ◽  
2017 ◽  
Vol 24 (2) ◽  
Author(s):  
Paul Drube
Keyword(s):  
Generating Function ◽  
Generating Functions ◽  
Young Tableau ◽  
Young Tableaux ◽  
Dyck Paths ◽  
Standard Tableau ◽  
Ballot Numbers ◽  
Standard Young Tableaux

An inverted semistandard Young tableau is a row-standard tableau along with a collection of inversion pairs that quantify how far the tableau is from being column semistandard. Such a tableau with precisely $k$ inversion pairs is said to be a $k$-inverted semistandard Young tableau. Building upon earlier work by Fresse and the author, this paper develops generating functions for the numbers of $k$-inverted semistandard Young tableaux of various shapes $\lambda$ and contents $\mu$. An easily-calculable generating function is given for the number of $k$-inverted semistandard Young tableaux that "standardize" to a fixed semistandard Young tableau. For $m$-row shapes $\lambda$ and standard content $\mu$, the total number of $k$-inverted standard Young tableaux of shape $\lambda$ is then enumerated by relating such tableaux to $m$-dimensional generalizations of Dyck paths and counting the numbers of "returns to ground" in those paths. In the rectangular specialization of $\lambda = n^m$ this yields a generating function that involves $m$-dimensional analogues of the famed Ballot numbers. Our various results are then used to directly enumerate all $k$-inverted semistandard Young tableaux with arbitrary content and two-row shape $\lambda = a^1 b^1$, as well as all $k$-inverted standard Young tableaux with two-column shape $\lambda=2^n$.

scholarly journals A Sundaram type Bijection for SO(3): Vacillating Tableaux and Pairs of Standard Young Tableaux and Orthogonal Littlewood-Richardson Tableaux

10.37236/7713 ◽  
2018 ◽  
Vol 25 (3) ◽  
Author(s):  
Judith Jagenteufel
Keyword(s):  
Orthogonal Group ◽  
Young Tableau ◽  
Young Tableaux ◽  
Tensor Power ◽  
Direct Sum ◽  
Special Orthogonal Group ◽  
Direct Sum Decomposition ◽  
Descent Set ◽  
Standard Young Tableaux ◽  
Standard Young Tableau

Motivated by the direct-sum-decomposition of the $r^{\text{th}}$ tensor power of the defining representation of the special orthogonal group $\mathrm{SO}(2k + 1)$, we present a bijection between vacillating tableaux and pairs consisting of a standard Young tableau and an orthogonal Littlewood-Richardson tableau for $\mathrm{SO}(3)$.Our bijection preserves a suitably defined descent set. Using it we determine the quasi-symmetric expansion of the Frobenius characters of the isotypic components.On the combinatorial side we obtain a bijection between Riordan paths and standard Young tableaux with 3 rows, all of even length or all of odd length.

scholarly journals Symmetry properties of the Novelli-Pak-Stoyanovskii algorithm

2014 ◽  
Vol DMTCS Proceedings vol. AT,... (Proceedings) ◽  
Author(s):  
Robin Sulzgruber
Keyword(s):  
Young Tableau ◽  
Sorting Algorithm ◽  
Young Tableaux ◽  
Hook Length ◽  
Jeu De Taquin ◽  
Bijective Proof ◽  
Symmetry Properties ◽  
International Audience ◽  
Standard Young Tableaux ◽  
Standard Young Tableau

International audience The number of standard Young tableaux of a fixed shape is famously given by the hook-length formula due to Frame, Robinson and Thrall. A bijective proof of Novelli, Pak and Stoyanovskii relies on a sorting algorithm akin to jeu-de-taquin which transforms an arbitrary filling of a partition into a standard Young tableau by exchanging adjacent entries. Recently, Krattenthaler and Müller defined the complexity of this algorithm as the average number of performed exchanges, and Neumann and the author proved it fulfils some nice symmetry properties. In this paper we recall and extend the previous results and provide new bijective proofs.

A maxdrop statistic for standard Young tableaux

2021 ◽  
pp. 2150105
Author(s):  
Mark Dukes ◽  
Toufik Mansour
Keyword(s):  
Generating Function ◽  
Young Tableau ◽  
Young Tableaux ◽  
Standard Young Tableaux ◽  
Permutation Statistic ◽  
Standard Young Tableau

In this paper, we introduce a new statistic on standard Young tableaux that is closely related to the maxdrop permutation statistic that was introduced by the first author. We prove that the value of the statistic must be attained at one of the corners of the standard Young tableau. We determine the coefficients of the generating function of this statistic over two-row standard Young tableaux having [Formula: see text] cells. We prove several results for this new statistic that include unimodality of the coefficients for the two-row case.

scholarly journals Joint Burke's Theorem and RSK Representation for a Queue and a Store

2003 ◽  
Vol DMTCS Proceedings vol. AC,... (Proceedings) ◽  
Author(s):  
Moez Draief ◽  
Jean Mairesse ◽  
Neil O'Connell
Keyword(s):  
Young Tableau ◽  
Transient Behavior ◽  
Arrival Process ◽  
Single Server ◽  
Storage Model ◽  
Server Queue ◽  
Rsk Algorithm ◽  
International Audience ◽  
The Stability ◽  
Standard Young Tableau

International audience Consider the single server queue with an infinite buffer and a FIFO discipline, either of type M/M/1 or Geom/Geom/1. Denote by $\mathcal{A}$ the arrival process and by $s$ the services. Assume the stability condition to be satisfied. Denote by $\mathcal{D}$ the departure process in equilibrium and by $r$ the time spent by the customers at the very back of the queue. We prove that $(\mathcal{D},r)$ has the same law as $(\mathcal{A},s)$ which is an extension of the classical Burke Theorem. In fact, $r$ can be viewed as the departures from a dual storage model. This duality between the two models also appears when studying the transient behavior of a tandem by means of the RSK algorithm: the first and last row of the resulting semi-standard Young tableau are respectively the last instant of departure in the queue and the total number of departures in the store.

Investigation of properties of equivalence classes of permutations by inverse Robinson — Schensted — Knuth transformation

2019 ◽  
pp. 11-22
Author(s):  
N. N. Vassiliev ◽  
V. S. Duzhin ◽  
A. D. Kuzmin
Keyword(s):  
Software Package ◽  
Numerical Experiments ◽  
Young Tableau ◽  
Infinite Sequence ◽  
Equivalence Classes ◽  
Young Tableaux ◽  
Young Diagrams ◽  
C Programming ◽  
Set Of Permutations ◽  
Knuth Equivalence

Introduction:All information about a permutation, i.e. about an element of a symmetric groupS(n), is contained in a pair of Young tableaux mapped to it by RSK transformation. However, when considering an infinite sequence of natural or real numbers instead of a permutation, all information about it is contained only in an insertion infinite Young tableau. The connection between the first element of an infinite sequence of uniformly distributed random values and the limit angle of the recording tableau nerve was found in a recent work by D. Romik and P. Śniady. However, so far there were no massive numerical experiments devoted to the reconstruction of the beginning of such a sequence by the beginning of an insertion Young tableau. The reconstruction accuracy is very important, because even the value of the first element of a sequence can be determined only by an infinite tableau.Purpose:Developing a software package for operations on Young diagrams and Young tableaux, and its application for numerical experiments with large Young tableaux. Studying the properties of Knuth equivalence classes and dual Knuth equivalence classes on a set of permutations by numerical experiments using direct and inverse RSK transformation.Results:A software package is developed using the C ++ programming language. It includes functions for dealing with Young diagrams and tableaux. The dependence of values of the first element of a permutation obtained by inverse RSK transformation on the recording tableau nerve end coordinates was investigated by conducting massive numerical experiments. Standard deviations of these values were calculated for permutations of different sizes. We determined possible positions of 1 in permutations of the same Knuth equivalence class. It has been found out that the number of these positions does not exceed the number of corner boxes of the corresponding Young diagram. Experiments showed that for a fixed insertion tableau, the value of the first element of a permutation depends only on the recording tableau nerve end coordinates.

Sign in / Sign up

Export Citation Format

Share Document