Stories about groups and sequences

Peter J. Cameron

doi:10.1007/BF00130572

Stories about groups and sequences

Peter J. Cameron^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	109-133
Number of pages	25
Journal	Designs, Codes, and Cryptography
Volume	8
Issue number	1-2
DOIs	https://doi.org/10.1007/BF00130572
Publication status	Published - 1 Jan 1996

Keywords

Enumeration
Permutation group
Sequence

Access to Document

10.1007/BF00130572

Cite this

@article{1d98a7cd16a04b1eb8a64891a47b7509,

title = "Stories about groups and sequences",

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",

author = "Cameron, {Peter J.}",

year = "1996",

month = jan,

day = "1",

doi = "10.1007/BF00130572",

language = "English",

volume = "8",

pages = "109--133",

journal = "Designs, Codes, and Cryptography",

issn = "0925-1022",

publisher = "Springer",

number = "1-2",

}

TY - JOUR

T1 - Stories about groups and sequences

AU - Cameron, Peter J.

PY - 1996/1/1

Y1 - 1996/1/1

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

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

KW - Enumeration

KW - Permutation group

KW - Sequence

UR - http://www.scopus.com/inward/record.url?scp=0037814277&partnerID=8YFLogxK

U2 - 10.1007/BF00130572

DO - 10.1007/BF00130572

M3 - Article

AN - SCOPUS:0037814277

SN - 0925-1022

VL - 8

SP - 109

EP - 133

JO - Designs, Codes, and Cryptography

JF - Designs, Codes, and Cryptography

IS - 1-2

ER -

Stories about groups and sequences

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this