English
Related papers

Related papers: On the Limiting Vacillating Tableaux for Integer S…

200 papers

Assume $\mathsf{M}_n$ is the $n$-dimensional permutation module for the symmetric group $\mathsf{S}_n$, and let $\mathsf{M}_n^{\otimes k}$ be its $k$-fold tensor power. The partition algebra $\mathsf{P}_k(n)$ maps surjectively onto the…

Representation Theory · Mathematics 2018-10-03 Georgia Benkart , Tom Halverson

We consider simple modules for a Hecke algebra with a parameter of quantum characteristic $e$. Equivalently, we consider simple modules $D^{\lambda}$, labelled by $e$-restricted partitions $\lambda$ of $n$, for a cyclotomic KLR algebra…

Representation Theory · Mathematics 2018-08-13 Melanie de Boeck , Anton Evseev , Sinead Lyle , Liron Speyer

Web graphs form a family of planar directed graphs with boundary that can be used to model quantum $\mathfrak{sl}_n$-invariant vectors. Standard Young tableaux on an $n \times k$ rectangle naturally index a basis for $\mathfrak{sl}_n$ web…

Combinatorics · Mathematics 2025-10-28 Lucas Adams Cowan , Ronja Eilfort , Kerry Seekamp , Julianna Tymoczko

Tableau sequences of bounded height have been central to the analysis of k-noncrossing set partitions and matchings. We show here that familes of sequences that end with a row shape are particularly compelling and lead to some interesting…

Combinatorics · Mathematics 2015-05-13 Sophie Burrill , Stephen Melczer , Marni Mishna

A partial $(n,k,t)_\lambda$-system is a pair $(X,\mathcal{B})$ where $X$ is an $n$-set of vertices and $\mathcal{B}$ is a collection of $k$-subsets of $X$ called blocks such that each $t$-set of vertices is a subset of at most $\lambda$…

Combinatorics · Mathematics 2023-11-23 Daniel Horsley , Padraig Ó Catháin

Given two vectors $u$ and $v$, their outer sum is given by the matrix $A$ with entries $A_{ij} = u_{i} + v_{j}$. If the entries of $u$ and $v$ are increasing and sufficiently generic, the total ordering of the entries of the matrix is a…

Combinatorics · Mathematics 2023-02-21 Igor Araujo , Alexander E. Black , Amanda Burcroff , Yibo Gao , Robert A. Krueger , Alex McDonough

While stabilizer tableaus have proven useful as a descriptive tool for additive quantum codes, they otherwise offer little guidance for concrete constructions or algorithm analysis. We introduce a representation of stabilizer codes as…

Quantum Physics · Physics 2025-11-10 Andrey Boris Khesin , Jonathan Z. Lu , Peter W. Shor

We consider the "limiting behavior" of *discriminants*, by which we mean informally the locus in some parameter space of some type of object where the objects have certain singularities. We focus on the space of partially labeled points on…

Algebraic Geometry · Mathematics 2015-11-03 Ravi Vakil , Melanie Matchett Wood

We are interested in the asymptotics of the number of standard Young tableaux $f^{\lambda/\mu}$ of a given skew shape $\lambda/\mu$. We mainly restrict ourselves to the case where both diagrams are balanced, but investigate all growth…

Combinatorics · Mathematics 2019-02-08 Jehanne Dousse , Valentin Féray

We provide simple necessary and sufficient conditions for the existence of a standard Young tableau of a given shape and major index $r$ mod $n$, for all $r$. Our result generalizes the $r=1$ case due essentially to (1974) and proves a…

Combinatorics · Mathematics 2017-09-21 Joshua P. Swanson

We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…

Rings and Algebras · Mathematics 2007-05-23 Constantin M. Petridi , P. B. Krikelis

Inspired by work of McKay, Morse, and Wilf, we give an exact count of the involutions in S_n which contain a given permutation \tau in S_k as a subsequence; this number depends on the patterns of the first j values of \tau for 1<=j<=k. We…

Combinatorics · Mathematics 2007-05-23 Aaron D. Jaggard

Let $1<d<e$ be two coprime integers and let $m_e$ denote the Mullineux map, which for $e$ prime describes tensor products of the irreducible modules of symmetric groups with the sign in characteristic $e$. We prove that if $\lambda$ is an…

Combinatorics · Mathematics 2025-04-08 Pavel Turek

Given a real number $\lambda > 1$, we say that $d|n$ is a $\lambda$-middle divisor of $n$ if $$ \sqrt{\frac{n}{\lambda}} < d \leq \sqrt{\lambda n}. $$ We will prove that there are integers having an arbitrarily large number of…

Number Theory · Mathematics 2023-05-03 José Manuel Rodríguez Caballero

For positive integers $1 \leq k \leq n$ let $M_n$ be the algebra of all $n \times n$ complex matrices and $M_n^{\le k}$ its subset consisting of all matrices of rank at most $k$. We first show that whenever $k>\frac{n}{2}$, any continuous…

Spectral Theory · Mathematics 2025-07-10 Alexandru Chirvasitu , Ilja Gogić , Mateo Tomašević

We consider the tiling of an $n$-board (a $1\times n$ array of square cells of unit width) with half-squares ($\frac12\times1$ tiles) and $(\frac12,\frac12)$-fence tiles. A $(\frac12,\frac12)$-fence tile is composed of two half-squares…

Combinatorics · Mathematics 2019-11-05 Kenneth Edwards , Michael A. Allen

Recently Tracy and Widom conjectured [math.CO/9904042] and Johansson proved [math.CO/9906120] that the expected shape \lambda of the semi-standard tableau produced by a random word in k letters is asymptotically the spectrum of a random…

Probability · Mathematics 2009-09-25 Greg Kuperberg

Immanants are polynomial functions of n by n matrices attached to irreducible characters of the symmetric group S_n, or equivalently to Young diagrams of size n. Immanants include determinants and permanents as extreme cases. Valiant proved…

Computational Complexity · Computer Science 2007-05-23 Jean-Luc Brylinski , Ranee Brylinski

It is well-known that for a quickly increasing sequence $(n_k)_{k \geq 1}$ the functions $(\cos 2 \pi n_k x)_{k \geq 1}$ show a behavior which is typical for sequences of independent random variables. If the growth condition on $(n_k)_{k…

Number Theory · Mathematics 2014-03-10 Christoph Aistleitner , Katusi Fukuyama

We present a bijection between vacillating tableaux and pairs consisting of a standard Young tableau and an orthogonal Littlewood-Richardson tableau for the special orthogonal group $\mathrm{SO}(2k+1)$. This bijection is motivated by the…

Combinatorics · Mathematics 2019-02-12 Judith Jagenteufel