127 research outputs found
On affine designs and Hadamard designs with line spreads
Rahilly [10] described a construction that relates any Hadamard design H on 4 m −1 points with a line spread to an affine design having the same parameters as the classical design of points and hyperplanes in AG(m, 4). Here it is proved that the affine design is the classical design of points and hyperplanes in AG(m, 4) if, and only if, H is the classical design of points and hyperplanes in P G(2m−1, 2) and the line spread is of a special type. Computational results about line spreads in P G(5, 2) are given. One of the affine designs obtained has the same 2-rank as the design of points and planes in AG(3, 4), and provides a counter-example to a conjecture o
Hadamard 2-(63,31,15) designs invariant under the dihedral group of order 10
AbstractAll Hadamard 2-(63,31,15) designs invariant under the dihedral group of order 10 are constructed and classified up to isomorphism together with related Hadamard matrices of order 64. Affine 2-(64,16,5) designs can be obtained from Hadamard 2-(63,31,15) designs having line spreads by Rahilly’s construction [A. Rahilly, On the line structure of designs, Discrete Math. 92 (1991) 291–303]. The parameter set 2-(64,16,5) is one of two known sets when there exists several nonisomorphic designs with the same parameters and p-rank as the design obtained from the points and subspaces of a given dimension in affine geometry AG(n,pm) (p a prime). It is established that an affine 2-(64,16,5) design of 2-rank 16 that is associated with a Hadamard 2-(63,31,15) design invariant under the dihedral group of order 10 is either isomorphic to the classical design of the points and hyperplanes in AG(3,4), or is one of the two exceptional designs found by Harada, Lam and Tonchev [M. Harada, C. Lam, V.D. Tonchev, Symmetric (4, 4)-nets and generalized Hadamard matrices over groups of order 4, Designs Codes Cryptogr. 34 (2005) 71–87]
Implementing Brouwer's database of strongly regular graphs
Andries Brouwer maintains a public database of existence results for strongly
regular graphs on vertices. We implemented most of the infinite
families of graphs listed there in the open-source software Sagemath, as well
as provided constructions of the "sporadic" cases, to obtain a graph for each
set of parameters with known examples. Besides providing a convenient way to
verify these existence results from the actual graphs, it also extends the
database to higher values of .Comment: 18 pages, LaTe
MUBs inequivalence and affine planes
There are fairly large families of unitarily inequivalent complete sets of
N+1 mutually unbiased bases (MUBs) in C^N for various prime powers N. The
number of such sets is not bounded above by any polynomial as a function of N.
While it is standard that there is a superficial similarity between complete
sets of MUBs and finite affine planes, there is an intimate relationship
between these large families and affine planes. This note briefly summarizes
"old" results that do not appear to be well-known concerning known families of
complete sets of MUBs and their associated planes.Comment: This is the version of this paper appearing in J. Mathematical
Physics 53, 032204 (2012) except for format changes due to the journal's
style policie
Symplectic spreads, planar functions and mutually unbiased bases
In this paper we give explicit descriptions of complete sets of mutually
unbiased bases (MUBs) and orthogonal decompositions of special Lie algebras
obtained from commutative and symplectic semifields, and
from some other non-semifield symplectic spreads. Relations between various
constructions are also studied. We show that the automorphism group of a
complete set of MUBs is isomorphic to the automorphism group of the
corresponding orthogonal decomposition of the Lie algebra .
In the case of symplectic spreads this automorphism group is determined by the
automorphism group of the spread. By using the new notion of pseudo-planar
functions over fields of characteristic two we give new explicit constructions
of complete sets of MUBs.Comment: 20 page
Semifields, relative difference sets, and bent functions
Recently, the interest in semifields has increased due to the discovery of
several new families and progress in the classification problem. Commutative
semifields play an important role since they are equivalent to certain planar
functions (in the case of odd characteristic) and to modified planar functions
in even characteristic. Similarly, commutative semifields are equivalent to
relative difference sets. The goal of this survey is to describe the connection
between these concepts. Moreover, we shall discuss power mappings that are
planar and consider component functions of planar mappings, which may be also
viewed as projections of relative difference sets. It turns out that the
component functions in the even characteristic case are related to negabent
functions as well as to -valued bent functions.Comment: Survey paper for the RICAM workshop "Emerging applications of finite
fields", 09-13 December 2013, Linz, Austria. This article will appear in the
proceedings volume for this workshop, published as part of the "Radon Series
on Computational and Applied Mathematics" by DeGruyte
- …