Skip to main content
SpringerLink
Log in

Stories about Groups and Sequences

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

The main theme of this article is that counting orbitsof an infinite permutation group on finite subsets or tuplesis very closely related to combinatorial enumeration; this pointof view ties together various disparate ``stories''. Among theseare reconstruction problems, the relation between connected andarbitrary graphs, the enumeration of N-free posets, and someof the combinatorics of Stirling numbers.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. A. Bailey, Designs: mappings between structured sets, pp. 22–51 in Surveys in Combinatorics, 1989 (ed. J. Siemons), Cambridge Univ. Press, Cambridge, 1989.

    Google Scholar 

  2. R. A. Bailey, Orthogonal partitions in designed experiments, Designs, Codes, Cryptography, to appear.

  3. E. A. Bender, P. J. Cameron, A. M. Odlyzko and B. L. Richmond, in preparation.

  4. M. Bernstein and N. J. A. Sloane, Some canonical sequences of integers, Linear Algebra Appl., to appear.

  5. R. Brauer, On the connection between the ordinary and the modular characters of groups of finite order, Ann. Math. 42(1941), 926–935.

    Google Scholar 

  6. T. Bridgeman, Lah's triangle — Stirling numbers of the third kind, preprint, July 1995.

  7. P. J. Cameron, Cohomological aspects of two-graphs, Math. Z. 157(1977), 101–119.

    Google Scholar 

  8. P. J. Cameron, Oligomorphic Permutation Groups, London Math. Soc. Lecture Notes 152, Cambridge University Press, Cambridge, 1990.

    Google Scholar 

  9. P. J. Cameron, Two-graphs and trees, Discrete Math. 127(1994), 63–74.

    Google Scholar 

  10. P. J. Cameron, Counting two-graphs related to trees, Electronic J. Combinatorics 2(1995), #R4.

    Google Scholar 

  11. P. J. Cameron, On the probability of connectedness, in preparation.

  12. P. J. Cameron, The algebra of an age, in preparation.

  13. P. J. Cameron, Stories from the Age of Reconstruction, in preparation.

  14. J. D. Dixon, personal communication (1985).

  15. M. J. Feigenbaum, Quantitative universality for a class of nonlinear transformations, J. Statist. Phys. 19, 25–52.

  16. R. Fraïssé, Sur certains relations qui généralisent l'ordre des nombres rationnels, C. R. Acad. Sci. Paris 237(1953), 540–542.

    Google Scholar 

  17. D. Glynn, Rings of geometries, I, J. Combinatorial Theory (A) 44(1987), 34–48; II, ibid. (A) 49 (1988), 26–66.

    Google Scholar 

  18. C. A. R. Hoare, Quicksort, Computer Journal 5(1962), 10–15.

    Google Scholar 

  19. A. Joyal, Une théorie combinatoire des séries formelles, Advances Math. 42(1981), 1–82.

    Google Scholar 

  20. I. Lah, Eine neueArt von Zahlen, ihre Eigenschaften und Anweldung in der mathematischen Statistik, Mitt. Math. Statistik 7(1955), 203–212.

    Google Scholar 

  21. V. A. Liskovec, Enumeration of Euler graphs, Vesc? Akad. Navuk BSSR Ser. F?z–Mat. Navuk (1970), 38–46.

  22. D. Livingstone and A. Wagner, Transitivity of finite permutation groups on unordered sets, Math. Z. 90(1965), 393–403.

    Google Scholar 

  23. 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.

    Google Scholar 

  24. 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.

    Google Scholar 

  25. V. B. Mnukhin, Reconstruction of orbits of a permutation group, Math. Notes 42(1987), 975–980.

    Google Scholar 

  26. T. Molien, Ñber die Invarianten der lineare Substitutionsgruppe, Sitzungsber. K¨onig. Preuss. Akad. Wiss. (1897), 1152–1156.

  27. J. A. Nelder, The analysis of randomized experiments with orthogonal block structure, Proceedings of the Royal Society, Series A, 283(1965), 147–178.

    Google Scholar 

  28. R. Otter, The number of trees, Ann. Math. (2) 49(1948), 583–599.

    Google Scholar 

  29. M. Pouzet, Application d'unepropriété combinatoiredes parties d'un ensemble aux groupes et aux relations, Math. Z. 150(1976), 117–134.

    Google Scholar 

  30. D. E. Radford, A natural ring basis for the shuffle algebra and an application to group schemes, J. Algebra 58(1979), 432–454.

    Google Scholar 

  31. A. Rényi, Some remarks on the theory of trees, Publ. Math. Inst. Hungar. Acad. Sci. 4(1959), 73–85.

    Google Scholar 

  32. C. Reutenauer, Free LieAlgebras, London Math. Soc. Monographs (New Series) 7, OxfordUniversity Press, 1993.

  33. R. W. Robinson, Enumeration of Eulergraphs, Proof Techniques in Graph Theory (Proc. Second Ann Arbor Graph Theory Conf., Ann Arbor 1968), 147–153, Academic Press, NewYork 1969.

    Google Scholar 

  34. J. J. Seidel, Strongly regular graphs of L 2-type and of triangular type, Proc. Kon, Nederl. Akad. Wetensch. (A) 70(1967), 188–196.

    Google Scholar 

  35. J. J. Seidel, A survey of two-graphs, pp. 481–511 in Proc. Int. Colloq. Teorie Combinatorie, Accad. Naz. Lincei, Roma, 1977.

    Google Scholar 

  36. 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).

  37. J. J. Seidel and D. E. Taylor, Two-graphs: A second survey, in Algebraic Methods in Graph Theory, Szeged, 1978.

  38. Idries Shah (ed.), World Tales, Harcourt Brace Jovanovich, New York, 1979.

    Google Scholar 

  39. N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, New York, 1973.

    Google Scholar 

  40. T. P. Speed and R. A. Bailey, Factorial dispersion models, Internat. Statist. Review 55(1987), 261–277.

    Google Scholar 

  41. S. Tsaranov, On a generalization of Coxeter groups, Algebra Groups Geom. 6(1989), 281–318.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematical Sciences, Queen Maryand Westfield College, Mile End Road, London, E1 4NS, U.K

    Peter J. Cameron

Authors
  1. Peter J. Cameron
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cameron, P.J. Stories about Groups and Sequences. Designs, Codes and Cryptography 8, 109–133 (1996). https://doi.org/10.1023/A:1018080825002

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018080825002

Search

Navigation