On a combinatorial problem concerning subpolytopes of stack polytopes
✍ Scribed by Magelone Kömhoff
- Publisher
- Springer
- Year
- 1980
- Tongue
- English
- Weight
- 154 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0046-5755
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Let us denote by G(m, n) the family of all simple 3-poiytopes having ,just two types of faces, m-gons and n-gons. J. Z&s [3] proved that G(5; k) contains non-Hamiltonian members for all k, k 3 11, and asked among others the folfowing question: Do there exist non-Hamiltonian members in any of the fam
We show that a counter problem, originating from group theory, and due to R. Solomon, is NP-hard ## I. Introduction This paper concerns a problem which was raised by Cameron [1], and which originated with R. Solomon. It originates from a problem involving the lengths of chains of subgroups in cla
Let T and S be two number theoretical transformations on the n-dimensional unit cube B, and write TtS if there exist positive integers m and n such that T m =S n . F. Schweiger showed in [1969, J. Number Theory 1, 390 397] that TtS implies that every T-normal number x is S-normal. Furthermore, he co