It is shown that under certain conditions the regularization of a pair of regular incidence polytopes is not itself an incidence polytope. Thus there exist regular incidence quasipolytopes which are not incidence polytopes.
Constructing infinite families of regular incidence (quasi-)polytopes
β Scribed by Adam Stephanides
- Publisher
- Springer
- Year
- 1994
- Tongue
- English
- Weight
- 502 KB
- Volume
- 53
- Category
- Article
- ISSN
- 0046-5755
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We define incidence quasi-polytopes and give a procedure for constructing regular incidence quasi-polytopes. We use this procedure to construct a finite map of type {e, 6} for all even ~ and 6, and infinitely many such maps when ~ or 6 is divisible by 4 and both are greater than or equal to 4.
A graph is 1-regular if its automorphism group acts regularly on the set of its arcs. Miller [J. Comb. Theory, B, 10 (1971), 163-182] constructed an infinite family of cubic 1-regular graphs of order 2 p, where p β₯ 13 is a prime congruent to 1 modulo 3. MaruΕ‘iΔ and Xu [J. Graph Theory, 25 (1997), 13
## Abstract A Menon design of order __h__^2^ is a symmetric (4__h__^2^,2__h__^2^β__h__,__h__^2^β__h__)βdesign. Quasiβresidual and quasiβderived designs of a Menon design have parameters 2β(2__h__^2^β+β__h__,__h__^2^,__h__^2^β__h__) and 2β(2__h__^2^β__h__,__h__^2^β__h__,__h__^2^β__h__β1), respective