On the Livingstone-Wagner theorem. (Q1883640)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the Livingstone-Wagner theorem. |
scientific article |
Statements
On the Livingstone-Wagner theorem. (English)
0 references
13 October 2004
0 references
Summary: Let \(G\) be a permutation group on the set \(\Omega\) and let \(\mathcal S\) be a collection of subsets of \(\Omega\), all of size \(\geq m\) for some integer \(m\). For \(s\leq m\) let \(n_s(G,\mathcal S)\) be the number of \(G\)-orbits on the subsets of \(\Omega\) which have a representative \(y\subseteq x\) with \(|y|=s\) and \(y\subseteq x\) for some \(x\in\mathcal S\). We prove that if \(s<t\) with \(s+t\leq m\) then \(n_s(G,{\mathcal S})\leq n_t(G,\mathcal S)\). A special case of this theorem is the Livingstone-Wagner Theorem when \({\mathcal S}=\{\Omega\}\). We show how the result can be applied to estimate orbit numbers for simplicial complexes, sequences, graphs and amalgamation classes. It is also shown how this theorem can be extended to orbit theorems on more general partially ordered sets.
0 references
permutation groups
0 references
numbers of orbits
0 references
Livingstone-Wagner theorem
0 references
partially ordered sets
0 references