ISSN:
1573-7586
Keywords:
Enumeration
;
permutation group
;
sequence
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1018080825002
Permalink