Numerical polynomials for arbitrary characters

DOI10.1016/0097-3165(71)90018-5zbMATH Open0218.20008OpenAlexW1996169769MaRDI QIDQ2546576FDOQ2546576

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Color patterns that are invariant under a given permutation of the colors
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Redfield's Group Reduction Functions
• Normal subsets of finite groups
• The polynomial of a permutation representation

Cited In (10)

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

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)