Symmetric chains, Gelfand--Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme
From MaRDI portal
Publication:644673
DOI10.1007/s10801-010-0272-2zbMath1229.05298arXiv1001.0280OpenAlexW1989761515MaRDI QIDQ644673
Publication date: 7 November 2011
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1001.0280
Terwilliger algebrasymmetric groupsymmetric chain decompositionexplicit block diagonalizationGelfand-Tsetlin bases
Related Items (10)
An orthogonal basis for functions over a slice of the Boolean hypercube ⋮ A fast Fourier transform for the Johnson graph ⋮ The Okounkov-Vershik approach to the representation theory of \(G\sim S_n\) ⋮ The Goldman-Rota identity and the Grassmann scheme ⋮ Inclusion matrices for rainbow subsets ⋮ A structure theorem for almost low-degree functions on the slice ⋮ Wreath product action on generalized Boolean algebras ⋮ Note on hook representations of the symmetric group ⋮ Incidence matrices for matchings ⋮ Harmonicity and invariance on slices of the Boolean cube
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The subconstituent algebra of an association scheme. I
- The Terwilliger algebra of the hypercube
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
- Symmetry in semidefinite programs
- Product partial orders with the Sperner property
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- Symmetry, Representations, and Invariants
- A sperner property preserved by product
- Representations of $\mathfrak{sl}( 2,\mathbb{C} )$ on Posets and the Sperner Property
- A New Approach to the Representation Theory of the Symmetric Groups. II
This page was built for publication: Symmetric chains, Gelfand--Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme
