Numerical polynomials for arbitrary characters

DOI10.1016/0097-3165(71)90018-5zbMath0218.20008OpenAlexW1996169769MaRDI QIDQ2546576

Arunas Rudvalis, Ernst Snapper

Publication date: 1971

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(71)90018-5

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Symmetric groups (20B30)

Related Items (10)

Applications of multlinear algebra ⋮ Pattern inventories associated with symmetry classes of tensors ⋮ Manifestations of Polya's counting theorem ⋮ The linear index of a group representation ⋮ Solving equations in groups: a survey of Frobenius' theorem ⋮ Characters of wreath products and some applications to representation theory and combinatorics ⋮ Hypergraphs, characteristic polynomials and permutation characters ⋮ A note on generalized characters ⋮ Characteristic polynomials of a permutation representation ⋮ On the pseudocharacteristic polynomial of K. Bogart and J. Gordon †

Cites Work

• Normal subsets of finite groups
• Color patterns that are invariant under a given permutation of the colors
• The polynomial of a permutation representation
• On Redfield's Group Reduction Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Numerical polynomials for arbitrary characters