English
Related papers

Related papers: Permutations whose reverse shares the same recordi…

200 papers

We present a version of the RSK correspondence based on the Pitman transform and geometric considerations. This version unifies ordinary RSK, dual RSK and continuous RSK. We show that this version is both a bijection and an isometry, two…

Probability · Mathematics 2022-04-27 Duncan Dauvergne , Mihai Nica , Bálint Virág

By considering the specialisation $s_{\lambda}(1,q,q^2,...,q^{n-1})$ of the Schur function, Stanley was able to describe a formula for the number of semistandard Young tableaux of shape $\lambda$ in terms of two properties of the boxes in…

Combinatorics · Mathematics 2019-08-15 Peter S. Campbell , Anna Stokke

Let R: V x V -> V x V be a Hecke type solution of the quantum Yang-Baxter equation (a Hecke symmetry). Then, the Hilbert-Poincre' series of the associated R-exterior algebra of the space V is a ratio of two polynomials of degree m…

Quantum Algebra · Mathematics 2007-05-23 D. Gurevich , P. Pyatov , P. Saponov

It has been proven that when connecting two infinite semi-cylinders or waveguides with a finite cylinder or resonator at a certain frequency, it is possible to transmit a signal almost completely from one semi-cylinder to another. In this…

Mathematical Physics · Physics 2024-11-26 Andrey L. Delitsyn , Irina K. Troshina

We continue work begun in \cite{ptab} which introduced \emph{perforated tableaux} as a combinatorial model for crystals of type $A_{n-1}$, emphasizing connections to the classical Robinson-Schensted-Knuth (RSK) correspondence and Lusztig…

Combinatorics · Mathematics 2022-09-29 Glenn D. Appleby , Tamsen Whitehead

We study the problem of identifying an n-bit string using a single quantum query to an oracle that computes the Hamming distance between the query and hidden strings. The standard action of the oracle on a response register of dimension r…

Quantum Physics · Physics 2009-12-04 David A. Meyer , James Pommersheim

We give a solution to a problem posed by Corteel and Nadeau concerning permutation tableaux of length n and the number of occurrences of the dashed pattern 32--1 in permutations on [n]. We introduce the inversion number of a permutation…

Combinatorics · Mathematics 2010-07-29 William Y. C. Chen , Lewis H. Liu

We consider two related problems arising from a question of R. Graham on quasirandom phenomena in permutation patterns. A ``pattern'' in a permutation $\sigma$ is the order type of the restriction of $\sigma : [n] \to [n]$ to a subset $S…

Combinatorics · Mathematics 2008-01-29 Joshua Cooper , Andrew Petrarca

Let $\mathcal{W}$ be a complete local commutative Noetherian ring with residue field $k$ of positive characteristic $p$. We study the inverse problem for the versal deformation rings $R_{\mathcal{W}}(\Gamma,V)$ relative to $\mathcal{W}$ of…

Number Theory · Mathematics 2013-09-03 Frauke M. Bleher , Ted Chinburg , Bart de Smit

We describe the limit (for two topologies) of large uniform random square permutations, i.e., permutations where every point is a record. The starting point for all our results is a sampling procedure for asymptotically uniform square…

Probability · Mathematics 2020-11-10 Jacopo Borga , Erik Slivken

The reconstruction problem for permutations on $n$ elements from their erroneous patterns which are distorted by transpositions is presented in this paper. It is shown that for any $n \geq 3$ an unknown permutation is uniquely…

Combinatorics · Mathematics 2007-05-23 Elena Konstantinova , Vladimir Levenshtein , Johannes Siemons

For each integer k >= 2, let F(k) denote the largest n for which there exists a permutation \sigma \in S_n, all of whose patterns of length k are distinct. We prove that F(k) = k + \lfloor \sqrt{2k-3} \rfloor + e_k, where e_k \in {-1,0} for…

Combinatorics · Mathematics 2012-06-12 Peter Hegarty

The Burge correspondence yields a bijection between simple labelled graphs and semistandard Young tableaux of threshold shape. We characterize the simple graphs of hook shape by peak and valley conditions on Burge arrays. This is the first…

Combinatorics · Mathematics 2023-08-11 Joseph Pappe , Digjoy Paul , Anne Schilling

We extend Friedman's theorem to show that, for any fixed $r>1$, a random $2r$--regular Schreier graph associated with the action of $r$ uniformly random permutations of $[n]$ on $k_{n}$--tuples of distinct elements in $[n]$ has a…

Representation Theory · Mathematics 2025-10-27 Ewan Cassidy

We consider a large family of equivalence relations on permutations in Sn that generalise those discovered by Knuth in his study of the Robinson-Schensted correspondence. In our most general setting, two permutations are equivalent if one…

Combinatorics · Mathematics 2011-11-17 Steven Linton , James Propp , Tom Roby , Julian West

We show that every complete noetherian local commutative ring R with residue field k can be realized as a universal deformation ring of a continuous linear representation of a profinite group. More specifically, R is the universal…

Representation Theory · Mathematics 2014-01-21 Krzysztof Dorobisz

We explore a relationship between the classical representation theory of a complex, semisimple Lie algebra \g and the resonance varieties R(V,K)\subset V^* attached to irreducible \g-modules V and submodules K\subset V\wedge V. In the…

Representation Theory · Mathematics 2016-11-17 Stefan Papadima , Alexander I. Suciu

A sorting network is a shortest path from 12...n to n...21 in the Cayley graph of S_n generated by nearest-neighbour swaps. We prove that for a uniform random sorting network, as n->infinity the space-time process of swaps converges to the…

Probability · Mathematics 2011-11-10 Omer Angel , Alexander E. Holroyd , Dan Romik , Balint Virag

We survey the theory of increasing and decreasing subsequences of permutations. Enumeration problems in this area are closely related to the RSK algorithm. The asymptotic behavior of the expected value of the length is(w) of the longest…

Combinatorics · Mathematics 2007-05-23 Richard P. Stanley

For permutations x and w, let mu(x,w) be the coefficient of highest possible degree in the Kazhdan-Lusztig polynomial P_{x,w}. It is well-known that the coefficients mu(x,w) arise as the edge labels of certain graphs encoding the…

Combinatorics · Mathematics 2007-05-23 Timothy J. McLarnan , Gregory S. Warrington