Using the list of 2607 so far constructed (96,20,4) difference sets as a source, we checked the related symmetric designs upon isomorphism and analyzed their full automorphism groups. New (96,20,4,4) and (96,19,2,4) regular partial difference sets are constructed, together with the corresponding strongly regular graphs
This paper considers the problem of determining which of the 56092 groups of order 256 contain (256;...
There exist exactly 1122 pairwise non-isomorphic 2-(56,12,3) designs being the residual designs of t...
A complete enumeration of relative difference sets (RDS) with parameters (16, 4, 16, 4) in a group o...
AbstractThe correspondence between a (96,20,4) symmetric design having regular automorphism group an...
In this paper we address an appealing and so far not completed combinatorial problem of difference s...
Abstract. New (96, 20, 4)-symmetric design has been constructed, unique under the assumption of an a...
In this article we generalize a theorem of Benson (J Algebra 15:443–454, 1970) for generalized quadr...
AbstractExistence status of (96, 20, 4) difference sets in Z4 × Z4 × Z2 × Z3 has been open so far. I...
In this paper we either prove the non-existence or give explicit construction of all (v, k, λ) symme...
We present a recursive construction for difference sets which unifies the Hadamard, McFarland, and S...
A regular graph $\Gamma$ with $v$ vertices and valency $k$ is said to be a $(v,k,\lambda, \mu)$-stro...
A (v, k, λ) difference set is a k-element subset D of a group G of order v for which the multiset {d...
AbstractWe present a recursive construction for difference sets which unifies the Hadamard, McFarlan...
AbstractThe automorphism groups of the symmetric 2-(64, 28, 12) designs with the symmetric differenc...
A (v, k, λ) difference set is a k-element subset D of a group G of order v for which the multiset {d...
This paper considers the problem of determining which of the 56092 groups of order 256 contain (256;...
There exist exactly 1122 pairwise non-isomorphic 2-(56,12,3) designs being the residual designs of t...
A complete enumeration of relative difference sets (RDS) with parameters (16, 4, 16, 4) in a group o...
AbstractThe correspondence between a (96,20,4) symmetric design having regular automorphism group an...
In this paper we address an appealing and so far not completed combinatorial problem of difference s...
Abstract. New (96, 20, 4)-symmetric design has been constructed, unique under the assumption of an a...
In this article we generalize a theorem of Benson (J Algebra 15:443–454, 1970) for generalized quadr...
AbstractExistence status of (96, 20, 4) difference sets in Z4 × Z4 × Z2 × Z3 has been open so far. I...
In this paper we either prove the non-existence or give explicit construction of all (v, k, λ) symme...
We present a recursive construction for difference sets which unifies the Hadamard, McFarland, and S...
A regular graph $\Gamma$ with $v$ vertices and valency $k$ is said to be a $(v,k,\lambda, \mu)$-stro...
A (v, k, λ) difference set is a k-element subset D of a group G of order v for which the multiset {d...
AbstractWe present a recursive construction for difference sets which unifies the Hadamard, McFarlan...
AbstractThe automorphism groups of the symmetric 2-(64, 28, 12) designs with the symmetric differenc...
A (v, k, λ) difference set is a k-element subset D of a group G of order v for which the multiset {d...
This paper considers the problem of determining which of the 56092 groups of order 256 contain (256;...
There exist exactly 1122 pairwise non-isomorphic 2-(56,12,3) designs being the residual designs of t...
A complete enumeration of relative difference sets (RDS) with parameters (16, 4, 16, 4) in a group o...