Stories about Groups and Sequences

Peter J. Cameron ()
Additional contact information
Peter J. Cameron: Queen Mary and Westfield College, School of Mathematical Sciences

A chapter in Designs and Finite Geometries, 1996, pp 109-133 from Springer

Abstract: 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.

Keywords: Enumeration; permutation group; sequence (search for similar items in EconPapers)
Date: 1996
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-1395-3_8

Ordering information: This item can be ordered from
http://www.springer.com/9781461313953

DOI: 10.1007/978-1-4613-1395-3_8

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().