Shuffle Invariance of the Super-RSK Algorithm

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.

Download Full-text

Non-symmetric Cauchy kernels

Discrete Mathematics & Theoretical Computer Science ◽

10.46298/dmtcs.2359 ◽

2013 ◽

Vol DMTCS Proceedings vol. AS,... (Proceedings) ◽

Author(s):

Olga Azenhas ◽

Aram Emami

Keyword(s):

Type A ◽

Cauchy Kernel ◽

Double Crystal ◽

Crystal Graphs ◽

Sum Of Products ◽

Key Polynomials ◽

Demazure Characters ◽

Rsk Algorithm ◽

International Audience ◽

Demazure Atoms

International audience Using an analogue of the Robinson-Schensted-Knuth (RSK) algorithm for semi-skyline augmented fillings, due to Sarah Mason, we exhibit expansions of non-symmetric Cauchy kernels $∏_(i,j)∈\eta (1-x_iy_j)^-1$, where the product is over all cell-coordinates $(i,j)$ of the stair-type partition shape $\eta$ , consisting of the cells in a NW-SE diagonal of a rectangle diagram and below it, containing the biggest stair shape. In the spirit of the classical Cauchy kernel expansion for rectangle shapes, this RSK variation provides an interpretation of the kernel for stair-type shapes as a family of pairs of semi-skyline augmented fillings whose key tableaux, determined by their shapes, lead to expansions as a sum of products of two families of key polynomials, the basis of Demazure characters of type A, and the Demazure atoms. A previous expansion of the Cauchy kernel in type A, for the stair shape was given by Alain Lascoux, based on the structure of double crystal graphs, and by Amy M. Fu and Alain Lascoux, relying on Demazure operators, which was also used to recover expansions for Ferrers shapes.

Download Full-text

Investigation of insertion tableau evolution in the Robinson-Schensted-Knuth correspondence

Discrete and Continuous Models and Applied Computational Science ◽

10.22363/2658-4670-2019-27-4-316-324 ◽

2019 ◽

Vol 27 (4) ◽

pp. 316-324

Author(s):

Vasilii S. Duzhin

Keyword(s):

Software Package ◽

Ordered Set ◽

Input Sequence ◽

Computer Experiments ◽

Young Tableaux ◽

Young Diagrams ◽

Rsk Algorithm ◽

2D And 3D ◽

Linearly Ordered Set

Robinson-Schensted-Knuth (RSK) correspondence occurs in different contexts of algebra and combinatorics. Recently, this topic has been actively investigated by many researchers. At the same time, many investigations require conducting the computer experiments involving very large Young tableaux. The article is devoted to such experiments. RSK algorithm establishes a bijection between sequences of elements of linearly ordered set and the pairs of Young tableaux of the same shape called insertion tableau and recording tableau . In this paper we study the dynamics of tableau and the dynamics of different concrete values in tableau during the iterations of RSK algorithm. Particularly, we examine the paths within tableaux called bumping routes along which the elements of an input sequence pass. The results of computer experiments with Young tableaux of sizes up to 108 were presented. These experiments were made using the software package for dealing with 2D and 3D Young diagrams and tableaux.

Download Full-text

On the convergence of bumping routes to their limit shapes in the RSK algorithm: numerical experiments

Information and Control Systems ◽

10.31799/1684-8853-2021-6-2-9 ◽

2021 ◽

pp. 2-9

Author(s):

Nikolay Vassiliev ◽

Vasilii Duzhin ◽

Artem Kuzmin

Keyword(s):

Numerical Experiments ◽

Least Squares Method ◽

Computer Experiments ◽

Young Tableaux ◽

Limit Shape ◽

Mean Values ◽

Limit Shapes ◽

Rsk Algorithm ◽

Fourth Root ◽

Special Rules

Introduction: The Robinson — Schensted — Knuth (RSK) algorithm transforms a sequence of elements of a linearly ordered set into a pair of Young tableaux P, Q of the same shape. This transformation is based on the process of bumping and inserting elements in tableau P according to special rules. The trajectory formed by all the boxes of the tableau P shifted in the RSK algorithm is called the bumping route. D. Romik and P. Śniady in 2016 obtained an explicit formula for the limit shape of the bumping route, which is determined by its first element. However, the rate of convergence of the bumping routes to the limit shape has not been previously investigated either theoretically or by numerical experiments. Purpose: Carrying out computer experiments to study the dynamics of the bumping routes produced by the RSK algorithm on Young tableaux as their sizes increase. Calculation of statistical means and variances of deviations of bumping routes from their limit shapes in the L2 metric for various values fed to the input of the RSK algorithm. Results: A series of computer experiments have been carried out on Young tableaux, consisting of up to 10 million boxes. We used 300 tableaux of each size. Different input values (0.1, 0.3, 0.5, 0.7, 0.9) were added to each such tableau using the RSK algorithm, and the deviations of the bumping routes built from these values from the corresponding limit shapes were calculated. The graphs of the statistical mean values and variances of these deviations were produced. It is noticed that the deviations decrease in proportion to the fourth root of the tableau size n. An approximation of the dependence of the mean values of deviations on n was obtained using the least squares method.

Download Full-text