EUVIMEDEUVIMED entdecken
Crossref

The perfect matching association scheme

Murali K. Srinivasan

Algebraic Combinatorics · 2020

DOI: 10.5802/alco.104 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Algebraic Combinatorics, 2020. Verfasst von Murali K. Srinivasan. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 28 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We revisit the Bose–Mesner algebra of the perfect matching association scheme. Our main results are 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. Universal formulas, as content evaluations of symmetric functions, for the eigenvalues of fixed orbitals. 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.

Zitieren

APA

Srinivasan, M. K. (2020). The perfect matching association scheme. Algebraic Combinatorics. https://doi.org/10.5802/alco.104

Vancouver

Srinivasan MK. The perfect matching association scheme. Algebraic Combinatorics. 2020. doi:10.5802/alco.104

BibTeX
@article{Srinivasan2020,
  author = {Srinivasan, Murali K.},
  title = {The perfect matching association scheme},
  journal = {Algebraic Combinatorics},
  year = {2020},
  doi = {10.5802/alco.104}
}
Kostenlos starten →