Published May 2000
| public
Book Section - Chapter
Existence of Steiner systems that admit automorphisms with large cycles
- Creators
- Wilson, Richard M.
- Others:
- Arasu, K. T.
- Seress, Akos
Abstract
For every integer k ≥ 2, we construct infinite families of Steiner systems S(2, k, ν) that have (1) an automorphism that permutes the v points in a single-cycle of length ν, (2) an automorphism that fixes one point and permutes the remaining ν – 1 points in a single cycle, or (3) an automorphism that fixes one point and permutes the remaining points in two cycles, of lengths r = (ν - 1)/(k – 1) and ν – r – 1. The designs we construct with property (2) are also resolvable.
Additional Information
© 2000 by Walter de Gruyter GmbH.Additional details
- Eprint ID
- 88552
- Resolver ID
- CaltechAUTHORS:20180802-155215256
- Created
-
2018-08-02Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field
- Series Name
- Ohio State University Mathematical Research Institute Publications
- Series Volume or Issue Number
- 10