The Enumeration Methods of Redfield

The object of this expository paper is the rehabilitation of J. Howard Redfield. The authors discuss, partly in their own notation and partly in Redfield's, the one paper \textit{J. H. Redfield} wrote, namely, ``The theory of group-reduced distributions, ibid. 49, 433--455 (1927; JFM 53.0106.03). Redfield was concerned with counting equivalence classes (under the action of a group) of combinatorial configurations, a circle of ideas and results generally referred to among combinatorial mathematicians as Pólya's Counting Theory, a full discussion of which can be found in Chapter 5 of ``Applied Combinatorial Mathematics, E. F. Beckenbach (ed.), New York etc.: John Wiley and Sons (1964; Zbl 0141.00103) [cf. \textit{N. G. de Bruijn}, Appl. Comb. Math., 144--185 (1964; Zbl 0144.00601)]. \{Editorial remark: The interested reader should also consult \textit{J. I. Hall} et al. [Redfield's lost paper in a modern context. J. Graph Theory 8, 225--240 (1984; Zbl 0538.05004)].\}

Recommendations

Cited in

(14)

This page was built for publication: The Enumeration Methods of Redfield

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