English
Related papers

Related papers: Shuffle Invariance of the Super-RSK Algorithm

200 papers

We show that for an infinitely many natural numbers $k$ there are $k$-uniform hypergraphs which admit a `rescaling phenomenon' as described in [9]. More precisely, let $\mathcal{A}(k,I, n)$ denote the class of $k$-graphs on $n$ vertices in…

Combinatorics · Mathematics 2018-07-09 Tomasz Łuczak , Joanna Polcyn , Christian Reiher

We investigate the mathematics behind unshuffles, a type of card shuffle closely related to classical perfect shuffles. To perform an unshuffle, deal all the cards alternately into two piles and then stack the one pile on top of the other.…

Combinatorics · Mathematics 2024-10-09 Cornelia A. Van Cott , Katie Wang

We investigate the evolution in time of the position of a fixed number in the insertion tableau when the Robinson-Schensted-Knuth algorithm is applied to a sequence of random numbers. When the length of the sequence tends to infinity, a…

Combinatorics · Mathematics 2022-06-01 Mikołaj Marciniak

The purpose of this thesis is to present certain viewpoints on the geometric representation theory of Nakajima cyclic quiver varieties, in relation to the Maulik-Okounkov stable basis. Our main technical tool is the shuffle algebra, which…

Representation Theory · Mathematics 2015-05-20 Andrei Neguţ

We introduce the slack of a recording tableau in the quantum Littlewood-Richardson (LR) map and show that it inherits the needed data from LR-Sundaram tableaux to define the inverse of the quantum LR map. Notably this enriched slack…

Combinatorics · Mathematics 2026-05-28 Olga Azenhas

We generalize the shuffle theorem and its $(km,kn)$ version, as conjectured by Haglund et al. and Bergeron et al., and proven by Carlsson and Mellit, and Mellit, respectively. In our version the $(km,kn)$ Dyck paths on the combinatorial…

Combinatorics · Mathematics 2021-09-07 Jonah Blasiak , Mark Haiman , Jennifer Morse , Anna Pun , George H. Seelinger

This paper presents a perturbation analysis framework for nonsmooth optimization on connected Riemannian manifolds to bridge the gap between the rapid development of algorithmic approaches and a robust theoretical foundation. Using…

Optimization and Control · Mathematics 2025-10-01 Yuexin Zhou , Chao Ding , Yangjing Zhang

The HRT (Heil-Ramanathan-Topiwala) conjecture stipulates that the set of any finitely many time-frequency shifts of a non-zero square Lebesgue integrable function is linearly independent. The present work settles two special cases of this…

Functional Analysis · Mathematics 2024-01-15 Kasso A. Okoudjou , Vignon Oussa

We study an infinite version of the "jeu de taquin" sliding game, which can be thought of as a natural measure-preserving transformation on the set of infinite Young tableaux equipped with the Plancherel probability measure. We use methods…

Probability · Mathematics 2015-03-18 Dan Romik , Piotr Śniady

We study the zero sets of the independence polynomial on recursive sequences of graphs. We prove that for a maximally independent starting graph and a stable and expanding recursion algorithm, the zeros of the independence polynomial are…

Dynamical Systems · Mathematics 2024-11-25 Mikhail Hlushchanka , Han Peters

We investigate the $k$-cycle shuffle on repeated cards, namely on a deck consisting of $l$ identical copies of each of $m$ card types, with total size $n=ml$. We establish asymptotic results for the total variation mixing of this shuffle,…

Probability · Mathematics 2026-03-31 Jiahe Shen

These are detailed lecture notes of the crash-course on shuffle algebras delivered by the author at Tokyo University of Marine Science and Technology during the second week of March 2019. These notes consist of three chapters, providing a…

Representation Theory · Mathematics 2023-08-15 Alexander Tsymbaliuk

We consider a notion of uniform thinning for a finite sequence of random variables $(X_1,...,X_n)$ obtained by removing one random variable, uniformly at random. If a triangular array of random variables $(X_{n,k} : n \in \mathbb{N}_+, 1…

Probability · Mathematics 2007-05-23 Shannon Starr

Virtually all state-of-the-art methods for training supervised machine learning models are variants of SGD enhanced with a number of additional tricks, such as minibatching, momentum, and adaptive stepsizes. One of the tricks that works so…

Machine Learning · Computer Science 2021-04-20 Grigory Malinovsky , Alibek Sailanbayev , Peter Richtárik

We study the structure of hypersurface orbital varieties of sl(N,C) (those that are hypersurfaces in the nilradical of some parabolic subalgebra) and how information about this structure is encoded in the standard Young tableau associated…

Representation Theory · Mathematics 2007-05-23 Elise Benlolo , Yasmine B. Sanderson

We present a new framework for the analysis and design of randomized algorithms for solving various types of linear systems, including consistent or inconsistent, full rank or rank-deficient. Our method is formulated with four randomized…

Optimization and Control · Mathematics 2022-08-25 Deren Han , Jiaxin Xie

In supersymmetric quantum mechanics, shape invariance is a sufficient condition for solvability. We show that all conventional additive shape invariant superpotentials that are independent of $\hbar$ obey two partial differential equations.…

High Energy Physics - Theory · Physics 2011-11-10 Jonathan Bougie , Asim Gangopadhyaya , Jeffry V. Mallow

We investigate the regularity of invariant curves of rotation number $1/2$ for a special class of symplectic twist maps of the annulus, billiard maps. We construct strictly convex smooth tables close to the circle having singular (i.e. not…

Dynamical Systems · Mathematics 2025-08-13 Stefano Baranzini

We exhibit a weight-preserving bijection between semi-standard Young tableaux and semi-skyline augmented fillings to provide a combinatorial proof that the Schur functions decompose into nonsymmetric functions indexed by compositions. The…

Combinatorics · Mathematics 2009-04-02 Sarah Mason

Let $K^{(r)}_{s_1,s_2,\cdots,s_r}$ be the complete $r$-partite $r$-uniform hypergraph and $ex(n,K^{(r)}_{s_1,s_2,\cdots,s_r})$ be the maximum number of edges in any $n$-vertex $K^{(r)}_{s_1,s_2,\cdots,s_r}$-free $r$-uniform hypergraph. It…

Combinatorics · Mathematics 2017-01-02 Jie Ma , Xiaofan Yuan , Mingwei Zhang