Abstract
The main theme of this article is that counting orbits of an infinite permutation group on finite subsets or tuples is very closely related to combinatorial enumeration; this point of view ties together various disparate “stories”. Among these are reconstruction problems, the relation between connected and arbitrary graphs, the enumeration of N-free posets, and some of the combinatorics of Stirling numbers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Bailey, Designs: mappings between structured sets, pp. 22–51 in Surveys in Combinatorics, 1989 (ed. J. Siemons), Cambridge Univ. Press, Cambridge, 1989.
A. Bailey, Orthogonal partitions in designed experiments, Designs, Codes, Cryptography, to appear.
E. A. Bender, P. J. Cameron, A. M. Odlyzko and B. L. Richmond, in preparation.
M. Bernstein and N. J. A. Sloane, Some canonical sequences of integers, Linear Algebra Appl., to appear.
R. Brauer, On the connection between the ordinary and the modular characters of groups of finite order, Ann. Math. 42 (1941), 926–935.
T. Bridgeman, Lah’s triangle — Stirling numbers of the third kind, preprint, July 1995.
P. J. Cameron, Cohomological aspects of two-graphs, Math. Z. 157 (1977), 101–119.
P. J. Cameron, Oligomorphic Permutation Groups, London Math. Soc. Lecture Notes 152, Cambridge University Press, Cambridge, 1990.
P. J. Cameron, Two-graphs and trees, Discrete Math. 127 (1994), 63–74.
P. J. Cameron, Counting two-graphs related to trees, Electronic J. Combinatorics 2(1995), #R4.
P. J. Cameron, On the probability of connectedness, in preparation.
P. J. Cameron, The algebra of an age, in preparation.
P. J. Cameron, Stories from the Age of Reconstruction, in preparation.
J. D. Dixon, personal communication (1985).
M. J. Feigenbaum, Quantitative universality for a class of nonlinear transformations, J. Statist. Phys. 19, 25–52.
R. Fraïssé, Sur certains relations qui généralisent l’ordre des nombres rationnels, C. R. Acad. Sci. Paris 237 (1953), 540–542.
D. Glynn, Rings of geometries, I, J. Combinatorial Theory (A) 44 (1987), 34–48;
D. Glynn, Rings of geometries, II, J. Combinatorial Theory (A) 49 (1988), 26–66.
C. A. R. Hoare, Quicksort, Computer Journal 5 (1962), 10–15.
A. Joyal, Une théorie combinatoire des séries formelles, Advances Math. 42 (1981), 1–82.
I. Lah, Eine neue Art von Zahlen, ihre Eigenschaften und Anweldung in der mathematischen Statistik, Min. Math. Statistik 7 (1955), 203–212.
V. A. Liskovec, Enumeration of Euler graphs, Vescī Akad. Navuk BSSR Ser. Fīz-Mat. Navuk (1970), 38–46.
D. Livingstone and A. Wagner, Transitivity of finite permutation groups on unordered sets, Math. Z. 90 (1965), 393–403.
H. D. Macpherson, The action of an infinite permutation group on the unordered subsets of a set, Proc. London Math. Soc. (3) 51 (1983), 471–486.
C. L. Mallows and N. J. A. Sloane, Two-graphs, switching classes, and Euler graphs are equal in number, SIAM J. Appl. Math. 28 (1975), 876–880.
V. B. Mnukhin, Reconstruction of orbits of a permutation group, Math. Notes 42 (1987), 975–980.
T. Molien, Über die Invarianten der lineare Substitutionsgruppe, Sitzungsber. König. Preuss. Akad. Wiss. (1897), 1152–1156.
J. A. Neider, The analysis of randomized experiments with orthogonal block structure, Proceedings of the Royal Society, Series A, 283 (1965), 147–178.
R. Otter, The number of trees, Ann. Math. (2) 49 (1948), 583–599.
M. Pouzet, Application d’une propriété combinatoire des parties d’un ensemble aux groupes et aux relations, Math.Z. 150 (1976), 117–134.
D. E. Radford, A natural ring basis for the shuffle algebra and an application to group schemes, J. Algebra 58 (1979), 432–454.
A. Rényi, Some remarks on the theory of trees, Publ. Math. Inst. Hungar. Acad. Sci. 4 (1959), 73–85.
C. Reutenauer, Free Lie Algebras, London Math. Soc. Monographs (New Series) 7, Oxford University Press, 1993.
R. W. Robinson, Enumeration of Euler graphs, Proof Techniques in Graph Theory (Proc. Second Ann Arbor Graph Theory Conf., Ann Arbor 1968), 147–153, Academic Press, New York 1969.
J. J. Seidel, Strongly regular graphs of L2-type and of triangular type, Proc. Kon, Nederl. Akad. Wetensch. (A) 70 (1967), 188–196.
J. J. Seidel, A survey of two-graphs, pp. 481–511 in Proc. Int. Colloq. Teorie Combinatorie, Accad. Naz. Lincei, Roma, 1977.
J. J. Seidel, More about two-graphs, in Combinatorics, Graphs and Complexity (Proc. 4th Czech Symp., Prachatice 1990), 297–308, Ann. Discrete Math. 51 (1992).
J. J. Seidel and D. E. Taylor, Two-graphs: A second survey, in Algebraic Methods in Graph Theory, Szeged, 1978.
Idries Shah (ed.), World Tales, Harcourt Brace Jovanovich, New York, 1979.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, New York, 1973.
T. P. Speed and R. A. Bailey, Factorial dispersion models, Internat. Statist. Review 55 (1987), 261–277.
S. Tsaranov, On a generalization of Coxeter groups, Algebra Groups Geom. 6 (1989), 281–318.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Additional information
Dedicated to Hanfried Lenz on the occasion of his 80th birthday
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers, Boston
About this chapter
Cite this chapter
Cameron, P.J. (1996). Stories about Groups and Sequences. In: Jungnickel, D. (eds) Designs and Finite Geometries. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1395-3_8
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1395-3_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8604-2
Online ISBN: 978-1-4613-1395-3
eBook Packages: Springer Book Archive