Even-freeness of cyclic 2-designs
From MaRDI portal
Publication:6236729
arXiv1210.7516MaRDI QIDQ6236729FDOQ6236729
Authors: Yuichiro Fujiwara 
Publication date: 28 October 2012
Abstract: A Steiner 2-design of block size k is an ordered pair (V, B) of finite sets such that B is a family of k-subsets of V in which each pair of elements of V appears exactly once. A Steiner 2-design is said to be r-even-free if for every positive integer i =< r it contains no set of i elements of B in which each element of V appears exactly even times. We study the even-freeness of a Steiner 2-design when the cyclic group acts regularly on V. We prove the existence of infinitely many nontrivial Steiner 2-designs of large block size which have the cyclic automorphisms and higher even-freeness than the trivial lower bound but are not the points and lines of projective geometry.
Combinatorial aspects of block designs (05B05) Combinatorial codes (94B25) Group actions on combinatorial structures (05E18)
This page was built for publication: Even-freeness of cyclic 2-designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6236729)
