The perfect matching association scheme
From MaRDI portal
Publication:2187940
Abstract: We revisit the Bose-Mesner algebra of the perfect matching association scheme. Our main results are: 1. An inductive algorithm, based on solving linear equations, to compute the eigenvalues of the orbital basis elements given the central characters of the symmetric groups. 2. Universal formulas, as content evaluations of symmetric functions, for the eigenvalues of fixed orbitals. 3. An inductive construction of an eigenvector (the so called first Gelfand-Tsetlin vector) in each eigenspace leading to a different inductive algorithm (not using central characters) for the eigenvalues of the orbital basis elements.
Recommendations
Cites work
- A New Approach to the Representation Theory of the Symmetric Groups. II
- A new construction of Young's seminormal representation of the symmetric groups
- An algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings
- Content evaluation and class symmetric functions
- Corrigendum to: ``Generators of the Hecke algebra of \((S_{2n},B_{n})\).
- Eigenvalues of the matching derangement graph
- Erdős-Ko-Rado for perfect matchings
- Erdős-Ko-Rado theorems. Algebraic approaches
- Generators of the Hecke algebra of \((S_{2n},B_n)\).
- scientific article; zbMATH DE number 1601795 (Why is no real title available?)
- scientific article; zbMATH DE number 431552 (Why is no real title available?)
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 3710398 (Why is no real title available?)
- scientific article; zbMATH DE number 3771876 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 645265 (Why is no real title available?)
- scientific article; zbMATH DE number 739282 (Why is no real title available?)
- Lie groups
- Random walks on trees and matchings
- Representation theory of the symmetric groups. The Okounkov-Vershik approach, character formulas, and partition algebras.
- Representation theory. A combinatorial viewpoint.
- Structure coefficients of the Hecke algebra of \((\mathcal{S}_{2n},\mathcal{B}_n)\)
- Symmetric polynomials and the center of the symmetric group ring
- The Center of ℤ[ S n+1 ] is the Set of Symmetric Polynomials in n Commuting Transposition-Sums
- The idempotents of the symmetric group and Nakayama's conjecture
Cited in
(9)- Subsets of association schemes corresponding to eigenvectors of the Bose-Mesner algebra
- The Erdős-Ko-Rado theorem for 2-intersecting families of perfect matchings
- The Goldman-Rota identity and the Grassmann scheme
- On the flip graphs on perfect matchings of complete graphs and signed reversal graphs
- An extension of the Erdős-Ko-Rado theorem to set-wise 2-intersecting families of perfect matchings
- Robustness of Erdős-Ko-Rado theorems on permutations and perfect matchings
- On connections between association schemes and analyses of polyhedral and positive semidefinite lift-and-project relaxations
- On the second largest eigenvalue of certain graphs in the perfect matching association scheme
- Jack derangements
This page was built for publication: The perfect matching association scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2187940)
