Symmetric chains, Gelfand--Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme
From MaRDI portal
(Redirected from Publication:644673)
Abstract: The de Bruijn-Tengbergen-Kruyswijk (BTK) construction is a simple algorithm that produces an explicit symmetric chain decomposition of a product of chains. We linearize the BTK algorithm and show that it produces an explicit symmetric Jordan basis (SJB). In the special case of a Boolean algebra the resulting SJB is orthogonal with respect to the standard inner product and, moreover, we can write down an explicit formula for the ratio of the lengths of the successive vectors in these chains (i.e., the singular values). This yields a new, constructive proof of the explicit block diagonalization of the Terwilliger algebra of the binary Hamming scheme. We also give a representation theoretic characterization of this basis that explains its orthogonality, namely, that it is the canonically defined (upto scalars) symmetric Gelfand-Tsetlin basis.
Recommendations
- The Terwilliger algebra of a Hamming scheme \(H(d,q)\)
- Symmetric chain decomposition for cyclic quotients of Boolean algebras and relation to cyclic crystals
- Modular adjacency algebras of Hamming schemes
- \(s\)-sequences and symmetric algebras
- Hamiltonian cycles and symmetric chains in Boolean lattices.
- Symmetric Chain Decompositions of Linear Lattices
- On the existence of symmetric chain decompositions in a quotient of the Boolean lattice
- On the triality of the Hamming code vertex operator algebra
- The Terwilliger algebra of the incidence graph of the Hamming graph
- q-analogues of determinants and symmetric chain decompositions
Cites work
- scientific article; zbMATH DE number 3974960 (Why is no real title available?)
- scientific article; zbMATH DE number 3510705 (Why is no real title available?)
- scientific article; zbMATH DE number 3625993 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 1016362 (Why is no real title available?)
- scientific article; zbMATH DE number 3065933 (Why is no real title available?)
- A New Approach to the Representation Theory of the Symmetric Groups. II
- A sperner property preserved by product
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
- Product partial orders with the Sperner property
- Representations and characters of groups.
- Representations of $\mathfrak{sl}( 2,\mathbb{C} )$ on Posets and the Sperner Property
- Symmetry in semidefinite programs
- Symmetry, Representations, and Invariants
- The Terwilliger algebra of the hypercube
- The subconstituent algebra of an association scheme. I
Cited in
(10)- Inclusion matrices for rainbow subsets
- The Okounkov-Vershik approach to the representation theory of \(G\sim S_n\)
- Wreath product action on generalized Boolean algebras
- An orthogonal basis for functions over a slice of the Boolean hypercube
- The Goldman-Rota identity and the Grassmann scheme
- A fast Fourier transform for the Johnson graph
- Note on hook representations of the symmetric group
- Incidence matrices for matchings
- A structure theorem for almost low-degree functions on the slice
- Harmonicity and invariance on slices of the Boolean cube
This page was built for publication: Symmetric chains, Gelfand--Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q644673)
