Abstract
In this paper, we study 2-(v, k, 1) designs with automorphisms of prime orderp, having the maximum possible number of fixed points. We prove an upper bound on the number of fixed points, and we study the structure of designs in which this bound is met with equality (such a design is called ap-MFP(v, k)). Several characterizations and asymptotic existence results forp-MFP(v, k) are obtained. For (p, k)=(3,3), (5,5), (2,3) and (3,4), necessary and sufficient conditions onv are obtained for the existence of ap-MFP(v, k). Further, for 3≤k≤5 and for any primep≡1 modk(k−1), we establish necessary and sufficient conditions onv for the existence of ap-MFP(v, k).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A.R. Camina, A survey of the automorphism groups of block designs, J. Combin. Designs2 (1994) 79–100.
A.R. Camina and S. Mischke, Line-transitive automorphism groups of linear spaces, Electronic J. Combin.3 (1996) #R3.
K. Chen and L. Zhu, Existence of (q, k, 1) difference families withq a prime power andk=4,5, preprint.
C.J. Colbourn and J.H. Dinitz, The CRC Handbook of Combinatorial Designs, CRC Press, Inc., 1996.
D.H. Davies, Automorphisms of designs, PhD Thesis, University of East Anglia, 1987.
J. Doyen, Two variations on a theme of de Bruijn and Erdös, presented at the Seventh Auburn Combinatorics Conference, March 1996.
A. Hartman and D.G. Hoffman, Steiner triple systems with an involution, Europ. J. Combin.8 (1987) 371–378.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kreher, D.L., Stinson, D.R. & Zhu, L. On the maximum number of fixed points in automorphisms of prime order of 2-(v,k,1) designs. Annals of Combinatorics 1, 227–243 (1997). https://doi.org/10.1007/BF02558477
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02558477