Numerical polynomials for arbitrary characters

DOI10.1016/0097-3165(71)90018-5MaRDI QIDQ2546576zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• Color patterns that are invariant under a given permutation of the colors
• scientific article; zbMATH DE number 3212917 (Why is no real title available?)
• scientific article; zbMATH DE number 3231901 (Why is no real title available?)
• scientific article; zbMATH DE number 3307642 (Why is no real title available?)
• scientific article; zbMATH DE number 3050844 (Why is no real title available?)
• Normal subsets of finite groups
• On Redfield's Group Reduction Functions
• The polynomial of a permutation representation

Cited in

(10)

• 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
• Characteristic polynomials of a permutation representation
• Hypergraphs, characteristic polynomials and permutation characters
• On the pseudocharacteristic polynomial of K. Bogart and J. Gordon †
• Applications of multlinear algebra
• A note on generalized characters

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2546576)