Affine-invariant strictly cyclic Steiner quadruple systems

To determine the spectrum of Steiner quadruple systems (SQS) admitting a specific automorphism group is of great interest in design theory. We consider a strictly cyclic SQS which is invariant under the affine group, called an AsSQS. For the applications of designs of experiments, group testing, filing schemes, authentication codes, and optical orthogonal codes for CDMA communication, etc., a larger automorphism group containing the cyclic group may work efficiently for the procedures of generating and searching blocks in a design with less storage and time. In this paper, constructions and a necessary condition for the existence of an AsSQS are investigated. For a prime p≡1(mod4)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$p \equiv 1 \;({\hbox {mod}}\; 4)$$\end{document}, Direct Construction A establishes an AsSQS(2p), provided that a 1-factor of a graph exists, where the graph is defined by using a system of generators of the projective special linear group PSL(2, p). Direct Construction B gives an AsSQS(2p) which is 2-chromatic, provided that a rainbow 1-factor of a specific hypergraph exists. Accordingly, by proposing two recursive constructions of an AsSQSs(2pm)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(2p^m)$$\end{document} for a positive integer m, we prove that an AsSQS(2pm)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(2p^m)$$\end{document} exists, if the criteria developed for an AsSQS(2p) are satisfied. We verified the claim and found that an AsSQS(2pm)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(2p^m)$$\end{document} exists for every prime p≡1(mod4)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$p \equiv 1 \;({\hbox {mod}}\; 4)$$\end{document} with p<105\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$p < 10^5$$\end{document} and any positive integer m.