The set of full cycles in a Young coset of the symmetric group (arising from polynomial identities of n × n-matrices) is given a graph theoretical description and its cardinality is computed. Primitive cosets are given yet another characterization.
|Number of pages||4|
|Journal||Journal of Combinatorial Theory - Series A|
|State||Published - Sep 1979|
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics