Indexed metadata

On the Livingstone-Wagner Theorem

V. B. Mnukhin, I. J. Siemons

Source record

Source: Crossref

Published: Apr 6, 2004

DOI: 10.37236/1782

Open original source ↗

Source abstract

Let GG be a permutation group on the set Ω\Omega and let S{\cal S} be a collection of subsets of Ω,\Omega, all of size m\geq m for some integer mm. For sms\leq m let ns(G,S)n_{s}(G,\,{\cal S}) be the number of GG-orbits on the subsets of Ω\Omega which have a representative yxy\subseteq x with y=s|y|=s and yxy\subseteq x for some xSx\in {\cal S}. We prove that if s<ts < t with s+tms+t\leq m then ns(G,S)nt(G,S)n_{s}(G,\,{\cal S})\leq n_{t}(G,\,{\cal S}). A special case of this theorem is the Livingstone-Wagner Theorem when S={Ω}{\cal 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.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

On the Livingstone-Wagner Theorem — Mathematical Frontier Network