By this article we conclude the construction of all primitive (v,k,k) symmetric designs with v<2500, up to a few unsolved cases. Complementary to the designs with prime power number of points published previously, here we give 55 primitive symmetric designs with v = p m , p prime and m positive inte
Primitive symmetric designs with prime power number of points
✍ Scribed by Snježana Braić; Anka Golemac; Joško Mandić; Tanja Vučičić
- Publisher
- John Wiley and Sons
- Year
- 2009
- Tongue
- English
- Weight
- 142 KB
- Volume
- 18
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
In this paper we either prove the non‐existence or give explicit construction of primitive symmetric (v, k, λ) designs with v=p^m^<2500, p prime and m>1. The method of design construction is based on an automorphism group action; non‐existence results additionally include the theory of difference sets, multiplier theorems in particular. The research involves programming and wide‐range computations. We make use of software package GAP and the library of primitive groups which it contains. © 2009 Wiley Periodicals, Inc. J Combin Designs 18: 141–154, 2010
📜 SIMILAR VOLUMES
## Abstract The following results for proper quasi‐symmetric designs with non‐zero intersection numbers __x__,__y__ and λ > 1 are proved. Let __D__ be a quasi‐symmetric design with __z__ = __y__ − __x__ and __v__ ≥ 2__k__. If __x__ ≥ 1 + __z__ + __z__^3^ then λ < __x__ + 1 + __z__ + __z__^3^. Let
Let V be a representation of a finite group G over a field of characteristic p. If p does not divide the group order, then Molien's formula gives the Hilbert series of the invariant ring. In this paper we find a replacement of Molien's formula which works in the case that G is divisible by p but not