Character polynomials and the Möbius function
Article
Received:
- 53 Downloads
- 1 Citations
Preview
Unable to display preview. Download preview PDF.
References
- [1]M.Aigner, Combinatorial theory. Berlin-Heidelberg-New York 1979.Google Scholar
- [2]P. T. Bateman andR. M. Stemmler, Waring's problem for algebraic number fields and primes of the form\(\frac{{p^r - 1}}{{p^d - 1}}\). Illinois J. Math.6, 142–156 (1962).Google Scholar
- [3]P. J. Cameron, Finite permutation groups and finite simple groups. Bull. London Math. Soc.13, 1–22 (1981).Google Scholar
- [4]H. Hawkes, I. M. Isaacs andM. Özaydin, On the Möbius function of a finite group. Rocky Mountain J. Math.19, 1003–1034 (1989).Google Scholar
- [5]P. M.Neumann, Permutationsgruppen von Primzahlgrad und verwandte Themen. Giessen 1977.Google Scholar
- [6]P. Orlik andL. Solomon, Coxeter arrangements. Proc. Sympos. Pure Math.40, 269–291 (1983).Google Scholar
- [7]H. Pahlings, On the Möbius function of a finite group. Arch. Math.60, 7–14 (1993).Google Scholar
- [8]G.Pfeiffer, The subgroups ofM 24 or how to compute the table of marks of a finite group. To appear.Google Scholar
- [9]H. Pahlings andW. Plesken, Group actions on Cartesian powers with applications to representation theory. J. Reine Angew. Math.380, 178–195 (1987).Google Scholar
- [10]G.-C. Rota andD. A. Smith, Enumeration under group action. Ann. Scuola Norm. Sup. Pisa Cl. Sci. (4)4, 637–646 (1977).Google Scholar
- [11]M. Schönert et al., GAP 3.1-Groups, Algorithms, and Programming. RWTH Aachen 1992.Google Scholar
- [12]R. P.Stanley, Enumerative Combinatorics, Volume I. Monterey 1986.Google Scholar
- [13]A. Turull, Polynomials associated to characters. Proc. Amer. Math. Soc.103, 463–467 (1988).Google Scholar
Copyright information
© Birkhäuser Verlag 1995