Symmetric chains, Gelfand--Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme

DOI10.1007/S10801-010-0272-2zbMATH Open1229.05298arXiv1001.0280OpenAlexW1989761515MaRDI QIDQ644673FDOQ644673

Authors: Murali K. Srinivasan 

Publication date: 7 November 2011

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1001.0280

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

zbMATH Keywords

Terwilliger algebrasymmetric groupsymmetric chain decompositionexplicit block diagonalizationGelfand-Tsetlin bases

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Cites Work

• Title not available (Why is that?)
• The subconstituent algebra of an association scheme. I
• Product partial orders with the Sperner property
• Symmetry, Representations, and Invariants
• Title not available (Why is that?)
• A New Approach to the Representation Theory of the Symmetric Groups. II
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• Title not available (Why is that?)
• Representations and characters of groups.
• The Terwilliger algebra of the hypercube
• New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
• Representations of $\mathfrak{sl}( 2,\mathbb{C} )$ on Posets and the Sperner Property
• Title not available (Why is that?)
• A sperner property preserved by product
• Title not available (Why is that?)
• Title not available (Why is that?)
• Symmetry in semidefinite programs

Cited In (10)

• A structure theorem for almost low-degree functions on the slice
• Harmonicity and invariance on slices of the Boolean cube
• The Goldman-Rota identity and the Grassmann scheme
• An orthogonal basis for functions over a slice of the Boolean hypercube
• Inclusion matrices for rainbow subsets
• A fast Fourier transform for the Johnson graph
• Incidence matrices for matchings
• The Okounkov-Vershik approach to the representation theory of \(G\sim S_n\)
• Wreath product action on generalized Boolean algebras
• Note on hook representations of the symmetric group

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)