Piotr Śniady
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Piotr Śniady has a total of 59 co-authors. Here are the top co-authors by number of shared publications:
- Benoît Collins
Department of Mathematics, Graduate School of Science, Kyoto University, Kyoto 606-8502, Japan
10 shared publications - Valentin Féray
Universität Zürich
6 shared publications - Łukasz Maślanka
Institute of Mathematics Polish Academy of Sciences ul. Śniadeckich 8 00-656 Warszawa Poland
5 shared publications - Mikołaj Marciniak
Interdisciplinary Doctoral School “Academia Copernicana”, Faculty of Mathematics and Computer Science, Nicolaus Copernicus University in Toruń, Toruń, Poland
4 shared publications - Sho Matsumoto
Graduate School of Science and Engineering, Kagoshima University, Kagoshima, Japan
4 shared publications - Alexander Russell
University of Connecticut, USA
3 shared publications
Latest Publications
- 1 September 2026
- Published by Institute of Mathematical Statistics in The Annals of Probability
- Vol. 54 (5) , 2626-2688
Fluctuations of Schensted row insertion
We investigate asymptotic probabilistic phenomena arising from the application of the Schensted row insertion algorithm, a key component of the Robinson–Schensted–Knuth (RSK) correspondence, to random inputs. Our analysis centers on a random tableau T with a given shape λ, which may itself be random or deterministic. We examine the stochastic properties of the position of the new box created when inserting a deterministic entry into T. Specifically, we focus on the fluctuations of this position around its expected value as the size of the Young diagram λ approaches infinity. Our findings reveal that these fluctuations are asymptotically Gaussian, with the mean and variance expressed in terms of Kerov’s transition measure of the diagram λ. An important application of this analysis is the RSK algorithm applied to a finite, long sequence of independent, identically distributed random variables. While there remains a gap in the reasoning for this case, we present an explicit conjecture regarding its behavior.
- 1 September 2026
- Published by Institute of Mathematical Statistics in The Annals of Probability
- Vol. 54 (5) , 2626-2688
Fluctuations of Schensted row insertion
We investigate asymptotic probabilistic phenomena arising from the application of the Schensted row insertion algorithm, a key component of the Robinson–Schensted–Knuth (RSK) correspondence, to random inputs. Our analysis centers on a random tableau T with a given shape λ, which may itself be random or deterministic. We examine the stochastic properties of the position of the new box created when inserting a deterministic entry into T. Specifically, we focus on the fluctuations of this position around its expected value as the size of the Young diagram λ approaches infinity. Our findings reveal that these fluctuations are asymptotically Gaussian, with the mean and variance expressed in terms of Kerov’s transition measure of the diagram λ. An important application of this analysis is the RSK algorithm applied to a finite, long sequence of independent, identically distributed random variables. While there remains a gap in the reasoning for this case, we present an explicit conjecture regarding its behavior.
- Open Access
- 1 January 2025
- Published by Institute of Mathematical Statistics in Electronic Journal of Probability
- Vol. 30 (none) , 1-26
Modulus of continuity of Kerov transition measure for continual Young diagrams
The transition measure is a foundational concept introduced by Sergey Kerov to represent the shape of a Young diagram as a centered probability measure on the real line. Over a period of decades the transition measure turned out to be an invaluable tool for many problems of the asymptotic representation theory of the symmetric groups. Kerov also showed how to expand this notion for a wider class of continual diagrams so that the transition measure provides a homeomorphism between a subclass of continual diagrams (having a specific support) and a class of centered probability measures with a support contained in a specific interval. We quantify the modulus of continuity of this homeomorphism. More specifically, we study the dependence of the cumulative distribution function of Kerov transition measure on the profile of a diagram at the locations where the profile is not too steep.
- 1 January 2025
- Published by Institute of Mathematical Statistics in Electronic Journal of Probability
- Vol. 30 (none) , 1-26
Open AccessModulus of continuity of Kerov transition measure for continual Young diagrams
The transition measure is a foundational concept introduced by Sergey Kerov to represent the shape of a Young diagram as a centered probability measure on the real line. Over a period of decades the transition measure turned out to be an invaluable tool for many problems of the asymptotic representation theory of the symmetric groups. Kerov also showed how to expand this notion for a wider class of continual diagrams so that the transition measure provides a homeomorphism between a subclass of continual diagrams (having a specific support) and a class of centered probability measures with a support contained in a specific interval. We quantify the modulus of continuity of this homeomorphism. More specifically, we study the dependence of the cumulative distribution function of Kerov transition measure on the profile of a diagram at the locations where the profile is not too steep.
- Open Access
- 12 January 2024
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 31 (1) , P1.23
Bijection Between Trees in Stanley Character Formula and Factorizations of a Cycle
Stanley and Féray gave a formula for the irreducible character of the symmetric group related to a multi-rectangular Young diagram. This formula shows that the character is a polynomial in the multi-rectangularcoordinates and gives an explicit combinatorial interpretation for its coefficients in terms of counting certain decorated maps (i.e., graphs drawn on surfaces). In the current paper we concentrate on the coefficients of thetop-degree monomials in the Stanley character polynomial, which corresponds to counting certain decorated plane trees. We give an explicit bijection between such trees and minimal factorizations of a cycle.
- 12 January 2024
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 31 (1) , P1.23
Open AccessBijection Between Trees in Stanley Character Formula and Factorizations of a Cycle
Stanley and Féray gave a formula for the irreducible character of the symmetric group related to a multi-rectangular Young diagram. This formula shows that the character is a polynomial in the multi-rectangularcoordinates and gives an explicit combinatorial interpretation for its coefficients in terms of counting certain decorated maps (i.e., graphs drawn on surfaces). In the current paper we concentrate on the coefficients of thetop-degree monomials in the Stanley character polynomial, which corresponds to counting certain decorated plane trees. We give an explicit bijection between such trees and minimal factorizations of a cycle.
- Open Access
Bijection between trees in Stanley character formula and factorizations of a cycle
Stanley and F\'eray gave a formula for the irreducible character of the symmetric group related to a multi-rectangular Young diagram. This formula shows that the character is a polynomial in the multi-rectangular coordinates and gives an explicit combinatorial interpretation for its coefficients in terms of counting certain decorated maps (i.e., graphs drawn on surfaces). In the current paper we concentrate on the coefficients of the top-degree monomials in the Stanley character polynomial, which corresponds to counting certain decorated plane trees. We give an explicit bijection between such trees and minimal factorizations of a cycle.
Open AccessBijection between trees in Stanley character formula and factorizations of a cycle
Stanley and F\'eray gave a formula for the irreducible character of the symmetric group related to a multi-rectangular Young diagram. This formula shows that the character is a polynomial in the multi-rectangular coordinates and gives an explicit combinatorial interpretation for its coefficients in terms of counting certain decorated maps (i.e., graphs drawn on surfaces). In the current paper we concentrate on the coefficients of the top-degree monomials in the Stanley character polynomial, which corresponds to counting certain decorated plane trees. We give an explicit bijection between such trees and minimal factorizations of a cycle.
- 29 December 2022
- Published by Elsevier in Advances in Applied Mathematics
- Vol. 145
Poisson limit theorems for the Robinson–Schensted correspondence and for the multi-line Hammersley process
- 29 December 2022
- Published by Elsevier in Advances in Applied Mathematics
- Vol. 145
Poisson limit theorems for the Robinson–Schensted correspondence and for the multi-line Hammersley process
- Open Access
Poisson limit theorems for the Robinson-Schensted correspondence and for the multi-line Hammersley process
We consider Robinson-Schensted-Knuth algorithm applied to a random input and study the growth of the bottom rows of the corresponding Young diagrams. We prove multidimensional Poisson limit theorem for the resulting Plancherel growth process. In this way we extend the result of Aldous and Diaconis to more than just one row. This result can be interpreted as convergence of the multi-line Hammersley process to its stationary distribution which is given by a collection of independent Poisson point processes.
Open AccessPoisson limit theorems for the Robinson-Schensted correspondence and for the multi-line Hammersley process
We consider Robinson-Schensted-Knuth algorithm applied to a random input and study the growth of the bottom rows of the corresponding Young diagrams. We prove multidimensional Poisson limit theorem for the resulting Plancherel growth process. In this way we extend the result of Aldous and Diaconis to more than just one row. This result can be interpreted as convergence of the multi-line Hammersley process to its stationary distribution which is given by a collection of independent Poisson point processes.
- Open Access
Second class particles and limit shapes of evacuation and sliding paths for random tableaux
We investigate two closely related setups. In the first one we consider a TASEP-style system of particles with specified initial and final configurations. The probability of each history of the system is assumed to be equal. We show that the rescaled trajectory of the \emph{second class particle} converges (as the size of the system tends to infinity) to a random arc of an ellipse. In the second setup we consider a uniformly random Young tableau of square shape and look for typical (in the sense of probability) sliding paths and evacuation paths in the asymptotic setting as the size of the square tends to infinity. We show that the probability distribution of such paths converges to a random meridian connecting the opposite corners of the square. We also discuss analogous results for non-square Young tableaux.
Open AccessSecond class particles and limit shapes of evacuation and sliding paths for random tableaux
We investigate two closely related setups. In the first one we consider a TASEP-style system of particles with specified initial and final configurations. The probability of each history of the system is assumed to be equal. We show that the rescaled trajectory of the \emph{second class particle} converges (as the size of the system tends to infinity) to a random arc of an ellipse. In the second setup we consider a uniformly random Young tableau of square shape and look for typical (in the sense of probability) sliding paths and evacuation paths in the asymptotic setting as the size of the square tends to infinity. We show that the probability distribution of such paths converges to a random meridian connecting the opposite corners of the square. We also discuss analogous results for non-square Young tableaux.
- Open Access
- 1 January 2022
- Published by European Mathematical Society - EMS - Publishing House GmbH in Documenta Mathematica
- Vol. 27, 2183-2273
Second class particles and limit shapes of evacuation and sliding paths for random tableaux.
We investigate two closely related setups. In the first one we consider a TASEP-style system of particles with specified initial and final configurations. The probability of each history of the system is assumed to be equal. We show that the rescaled trajectory of the second class particle converges (as the size of the system tends to infinity) to a random arc of an ellipse. In the second setup we consider a uniformly random Young tableau of square shape and look for typical (in the sense of probability) sliding paths and evacuation paths in the asymptotic setting as the size of the square tends to infinity. We show that the probability distribution of such paths converges to a random meridian connecting the opposite corners of the square. We also discuss analogous results for non-square Young tableaux.
- 1 January 2022
- Published by European Mathematical Society - EMS - Publishing House GmbH in Documenta Mathematica
- Vol. 27, 2183-2273
Open AccessSecond class particles and limit shapes of evacuation and sliding paths for random tableaux.
We investigate two closely related setups. In the first one we consider a TASEP-style system of particles with specified initial and final configurations. The probability of each history of the system is assumed to be equal. We show that the rescaled trajectory of the second class particle converges (as the size of the system tends to infinity) to a random arc of an ellipse. In the second setup we consider a uniformly random Young tableau of square shape and look for typical (in the sense of probability) sliding paths and evacuation paths in the asymptotic setting as the size of the square tends to infinity. We show that the probability distribution of such paths converges to a random meridian connecting the opposite corners of the square. We also discuss analogous results for non-square Young tableaux.
- Open Access
- 17 August 2021
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 181 (4) , 1053-1103
Poisson limit of bumping routes in the Robinson–Schensted correspondence
We consider the Robinson–Schensted–Knuth algorithm applied to a random input and investigate the shape of the bumping route (in the vicinity of the y-axis) when a specified number is inserted into a large Plancherel-distributed random tableau. We show that after a projective change of the coordinate system the bumping route converges in distribution to the Poisson process.
- 17 August 2021
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 181 (4) , 1053-1103
Open AccessPoisson limit of bumping routes in the Robinson–Schensted correspondence
We consider the Robinson–Schensted–Knuth algorithm applied to a random input and investigate the shape of the bumping route (in the vicinity of the y-axis) when a specified number is inserted into a large Plancherel-distributed random tableau. We show that after a projective change of the coordinate system the bumping route converges in distribution to the Poisson process.
- Open Access
Poisson limit of bumping routes in the Robinson-Schensted correspondence
We consider the Robinson-Schensted-Knuth algorithm applied to a random input and investigate the shape of the bumping route (in the vicinity of the $y$-axis) when a specified number is inserted into a large Plancherel-distributed tableau. We show that after a projective change of the coordinate system the bumping route converges in distribution to the Poisson process.
Open AccessPoisson limit of bumping routes in the Robinson-Schensted correspondence
We consider the Robinson-Schensted-Knuth algorithm applied to a random input and investigate the shape of the bumping route (in the vicinity of the $y$-axis) when a specified number is inserted into a large Plancherel-distributed tableau. We show that after a projective change of the coordinate system the bumping route converges in distribution to the Poisson process.