Abstract

Let $G$ be a permutation group on the set $\Omega$ and let ${\cal 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,\,{\cal 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 {\cal S}$. We prove that if $s < t$ with $s+t\leq m$ then $n_{s}(G,\,{\cal S})\leq n_{t}(G,\,{\cal S})$. A special case of this theorem is the Livingstone-Wagner Theorem when ${\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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.