×

zbMATH — the first resource for mathematics

Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs. (English) Zbl 1055.05009
Summary: We consider a \(q\)-analog of \(t\)-\((v,k,\lambda)\)-designs. It is canonic since it arises by replacing sets by vector spaces over GF\((q)\), and their orders by dimensions. These generalizations were introduced by S. Thomas [Geom. Dedicata 63, No. 3, 247–253 (1996; Zbl 0863.51011)], they are called \(t\)-\((v,k,\lambda;q)\)-designs. A few of such \(q\)-analogs are known today, they were constructed using sophisticated geometric arguments and case-by-case methods. It is our aim now to present a general method that allows systematically to construct such designs, and to give complete catalogs (for small parameters, of course) using an implemented software package.
In order to attack the (highly complex) construction, we prepare them for an enormous data reduction by embedding their definition into the theory of group actions on posets, so that we can derive and use a generalization of the Kramer-Mesner matrix for their definition, together with an improved version of the LLL-algorithm. By doing so we generalize the methods developed in a research project on \(t\)-\((v,k,\lambda)\)-designs on sets, obtaining this way new results on the existence of \(t\)-\((v, k,\lambda;q)\)-designs on spaces for further quintuples \((t,v,k,\lambda;q)\) of parameters. We present several 2-\((6,3,\lambda;2)\)-designs, 2-\((7,3,\lambda;2)\)-designs and, as far as we know, the very first 3-designs over GF\((q)\).

MSC:
05B05 Combinatorial aspects of block designs
Software:
DISCRETA; DISCRETAQ
PDF BibTeX XML Cite
Full Text: DOI
References:
[2] A. Betten, A. Kerber, A. Kohnert, R. Laue and A. Wassermann, The discovery of simple 7-designs with automorphism group P?L(2,32),Applied Algebra, Algebraic Algorithms and Error-correcting Codes (Paris, 1995), 131-145, Lecture Notes in Computer Sci., Vol. 948, Springer, Berlin (1995). · Zbl 0879.05008
[4] A. Betten, E. Haberberger, R. Laue and A. Wassermann,DISCRETA ? A Program System for the Construction of t-Designs, Lehrstuhl II für Mathematik, Universität Bayreuth, http://www.mathe2.uni-bayreuth.de/\(\sim\)discreta, 1999.
[5] M. Braun,Die Konstruktion von q-Analoga Kombinatorischer Designs.Diplomarbeit, Universität Bayreuth (2001).
[12] R. Laue, Constructing objects up to isomorphism, simple 9-designs with small parameters, Algebraic Combinatorics and Applications, Springer, Berlin Heidelberg New York pp. 232-260 (2001), NOTE = presented at ALCOMA, Sept. (1999). · Zbl 0982.05018
[13] M. Miyakawa, The Existence of new 2-(7,3,3;2) Designs, Master?s Thesis, Hirosaki Universität (1993).
[14] B. Schmalz,Computerunterstützte Konstruktion von Doppelnebenklassenrepr\(\backslash\)?asentanten mit Anwendung auf das Isomorphieproblem der Graphentheorie, Diplomarbeit, Universitát Bayreuth, (1989).
[15] B. Schmalz, t-Designs zu vorgebener automorphismengruppe,Bayreuther Mathe. Schriften, HeftVol. 41 (1992).
[21] S. Weinrich, Konstruktionsalgorithmen für diskrete Strukturen und ihre Implementierung, Diplomarbeit, Universität Bayreuth (1993).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.