English
Related papers

Related papers: Evacuation of rectangular standard Young tableaux …

200 papers

Webs are certain planar diagrams embedded in disks. They index and describe bases of tensor products of representations of $\mathfrak{sl}_2$ and $\mathfrak{sl}_3$. There are explicit bijections between webs and certain rectangular tableaux.…

Combinatorics · Mathematics 2024-03-04 Rebecca Patrias , Oliver Pechenik

Combinatorial spiders are a model for the invariant space of the tensor product of representations. The basic objects, webs, are certain directed planar graphs with boundary; algebraic operations on representations correspond to…

Combinatorics · Mathematics 2010-05-27 Julianna Tymoczko

We elaborate upon a bijection discovered by Cools, Draisma, Payne, and Robeva between the set of rectangular standard Young tableaux and the set of equivalence classes of chip configurations on certain metric graphs under the relation of…

Combinatorics · Mathematics 2020-08-04 Rohit Agrawal , Gregg Musiker , Vladimir Sotirov , Fan Wei

Webs are graphical objects that give a tangible, combinatorial way to compute and classify tensor invariants. Recently, [Gaetz, Pechenik, Pfannerer, Striker, Swanson 2023+] found a rotation-invariant web basis for $\mathrm{SL}_4$, as well…

Combinatorics · Mathematics 2025-11-27 Ashleigh Adams , Jessica Striker

Webs are a kind of planar, directed, edge-labeled graph that encode invariant vectors for quantum representations of $\mathfrak{sl}_n$. The theory of webs developed organically for $\mathfrak{sl}_2$, where they are also known as noncrossing…

Representation Theory · Mathematics 2025-10-16 Heather M. Russell , Julianna Tymoczko

We prove a new CLT for the difference of linear eigenvalue statistics of a Wigner random matrix $H$ and its minor $\hat H$ and find that the fluctuation is much smaller than the fluctuations of the individual linear statistics, as a…

Probability · Mathematics 2018-07-11 László Erdős , Dominik Schröder

Webs are planar graphs with boundary that describe morphisms in a diagrammatic representation category for $\mathfrak{sl}_k$. They are studied extensively by knot theorists because braiding maps provide a categorical way to express link…

Combinatorics · Mathematics 2020-06-18 Heather M. Russell , Julianna Tymoczko

Rectangular standard Young tableaux with 2 or 3 rows are in bijection with $U_q(\mathfrak{sl}_2)$-webs and $U_q(\mathfrak{sl}_3)$-webs respectively. When $W$ is a web with a reflection symmetry, the corresponding tableau $T_W$ has a…

Combinatorics · Mathematics 2022-07-08 Kevin Purbhoo , Shelley Wu

The sl_3 spider is a diagrammatic category used to study the representation theory of the quantum group U_q(sl_3). The morphisms in this category are generated by a basis of non-elliptic webs. Khovanov- Kuperberg observed that non-elliptic…

Combinatorics · Mathematics 2014-05-14 Heather M. Russell

Our main contribution here is the discovery of a new family of standard Young tableaux $ {\cal T}^k_n$ which are in bijection with the family ${\cal D}_{m,n}$ of Rational Dyck paths for $m=k\times n\pm 1$ (the so called "Fuss" case). Using…

Combinatorics · Mathematics 2018-07-20 Adriano M. Garsia , Guoce Xin

We establish the existence of an involution on tabloids that is analogous to Schutzenberger's evacuation map on standard Young tableaux. We find that the number of its fixed points is given by evaluating a certain Green's polynomial at $q =…

Combinatorics · Mathematics 2022-06-17 M. Chmutov , G. Frieden , D. Kim , J. B. Lewis , E. Yudovina

A fundamental identity in the representation theory of the partition algebra is $n^k = \sum_{\lambda} f^\lambda m_k^\lambda$ for $n \geq 2k$, where $\lambda$ ranges over integer partitions of $n$, $f^\lambda$ is the number of standard Young…

Combinatorics · Mathematics 2024-05-14 Zhanar Berikkyzy , Pamela E. Harris , Anna Pun , Catherine Yan , Chenchen Zhao

We define an inversion statistic on standard Young tableaux. We prove that this statistic has the same distribution over SYT(\lambda) as the major index statistic by exhibiting a bijection on SYT(\lambda) in the spirit of the Foata map on…

Combinatorics · Mathematics 2007-05-23 Jim Haglund , Laura Stevens

Given a semisimple Lie algebra $\mathfrak{g}$, we can represent invariants of tensor products of fundamental representations of the quantum enveloping algebra $U_q(\mathfrak{g})$ using particular directed graphs called webs. In particular…

Quantum Algebra · Mathematics 2018-10-01 Colin Hagemeyer

We apply the Poynting theorem to the scattering of monochromatic electromagnetic planes waves with normal incidence to the interface of two different media. We write this energy conservation theorem to introduce a natural definition of the…

Classical Physics · Physics 2008-10-30 V. Dominguez-Rocha , C. Zagoya , M. Martinez-Mares

This work develops a flexible and mathematically sound framework for the design and analysis of graph scattering networks with variable branching ratios and generic functional calculus filters. Spectrally-agnostic stability guarantees for…

Machine Learning · Computer Science 2023-01-30 Christian Koke , Gitta Kutyniok

We define $2n$-multiwebs on planar graphs and discuss their relation with $\mathrm{Sp}(2n)$-webs. On a planar graph with a symplectic local system we define a matrix whose Pfaffian is the sum of traces of $2n$-multiwebs. As application we…

Mathematical Physics · Physics 2024-11-06 Richard Kenyon , Haihan Wu

Richardson tableaux are a remarkable subfamily of standard Young tableaux introduced by Karp and Precup in order to index the irreducible components of Springer fibers equal to Richardson varieties. We show that the set of insertion…

Combinatorics · Mathematics 2025-11-20 Peter L. Guo

A tuple (s1,t1,s2,t2) of vertices in a simple undirected graph is 2-linked when there are two vertex-disjoint paths respectively from s1 to t1 and s2 to t2. A graph is 2-linked when all such tuples are 2-linked. We give a new and simple…

Data Structures and Algorithms · Computer Science 2025-08-15 Samuel Humeau , Damien Pous

This work is concerned with some properties of the Young-Fibonacci insertion algorithm and its relation with Fomin's growth diagrams. It also investigates a relation between the combinatorics of Young-Fibonacci tableaux and the study of…

Combinatorics · Mathematics 2007-05-23 Janvier Nzeutchap
‹ Prev 1 2 3 10 Next ›