122 research outputs found

    Distance-regular Cayley graphs with small valency

    Full text link
    We consider the problem of which distance-regular graphs with small valency are Cayley graphs. We determine the distance-regular Cayley graphs with valency at most 44, the Cayley graphs among the distance-regular graphs with known putative intersection arrays for valency 55, and the Cayley graphs among all distance-regular graphs with girth 33 and valency 66 or 77. We obtain that the incidence graphs of Desarguesian affine planes minus a parallel class of lines are Cayley graphs. We show that the incidence graphs of the known generalized hexagons are not Cayley graphs, and neither are some other distance-regular graphs that come from small generalized quadrangles or hexagons. Among some ``exceptional'' distance-regular graphs with small valency, we find that the Armanios-Wells graph and the Klein graph are Cayley graphs.Comment: 19 pages, 4 table

    Integral point sets over finite fields

    Get PDF
    We consider point sets in the affine plane Fq2\mathbb{F}_q^2 where each Euclidean distance of two points is an element of Fq\mathbb{F}_q. These sets are called integral point sets and were originally defined in mm-dimensional Euclidean spaces Em\mathbb{E}^m. We determine their maximal cardinality I(Fq,2)\mathcal{I}(\mathbb{F}_q,2). For arbitrary commutative rings R\mathcal{R} instead of Fq\mathbb{F}_q or for further restrictions as no three points on a line or no four points on a circle we give partial results. Additionally we study the geometric structure of the examples with maximum cardinality.Comment: 22 pages, 4 figure

    MUBs inequivalence and affine planes

    Full text link
    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

    All totally symmetric colored graphs

    Full text link
    In this paper we describe all edge-colored graphs that are fully symmetric with respect to colors and transitive on every set of edges of the same color. They correspond to fully symmetric homogeneous factorizations of complete graphs. Our description completes the work done in our previous paper, where we have shown, in particular, that there are no such graphs with more than 5 colors. Using some recent results, with a help of computer, we settle all the cases that was left open in the previous paper.Comment: 13 page

    Maximal integral point sets in affine planes over finite fields

    Get PDF
    Motivated by integral point sets in the Euclidean plane, we consider integral point sets in affine planes over finite fields. An integral point set is a set of points in the affine plane Fq2\mathbb{F}_q^2 over a finite field Fq\mathbb{F}_q, where the formally defined squared Euclidean distance of every pair of points is a square in Fq\mathbb{F}_q. It turns out that integral point sets over Fq\mathbb{F}_q can also be characterized as affine point sets determining certain prescribed directions, which gives a relation to the work of Blokhuis. Furthermore, in one important sub-case integral point sets can be restated as cliques in Paley graphs of square order. In this article we give new results on the automorphisms of integral point sets and classify maximal integral point sets over Fq\mathbb{F}_q for q≤47q\le 47. Furthermore, we give two series of maximal integral point sets and prove their maximality.Comment: 18 pages, 3 figures, 2 table

    Semifields, relative difference sets, and bent functions

    Full text link
    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 Z4\mathbb{Z}_4-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

    Harmonic equiangular tight frames comprised of regular simplices

    Get PDF
    An equiangular tight frame (ETF) is a sequence of unit-norm vectors in a Euclidean space whose coherence achieves equality in the Welch bound, and thus yields an optimal packing in a projective space. A regular simplex is a simple type of ETF in which the number of vectors is one more than the dimension of the underlying space. More sophisticated examples include harmonic ETFs which equate to difference sets in finite abelian groups. Recently, it was shown that some harmonic ETFs are comprised of regular simplices. In this paper, we continue the investigation into these special harmonic ETFs. We begin by characterizing when the subspaces that are spanned by the ETF's regular simplices form an equi-isoclinic tight fusion frame (EITFF), which is a type of optimal packing in a Grassmannian space. We shall see that every difference set that produces an EITFF in this way also yields a complex circulant conference matrix. Next, we consider a subclass of these difference sets that can be factored in terms of a smaller difference set and a relative difference set. It turns out that these relative difference sets lend themselves to a second, related and yet distinct, construction of complex circulant conference matrices. Finally, we provide explicit infinite families of ETFs to which this theory applies
    • …
    corecore