It is shown that among all tight designs in FP^n, where F is R, C, or H (quaternions), other than RP^1, only 5-designs in CP^1 have irrational angle set. This is the only case of equal ranks of the first and the last irreducible idempotent in the corresponding Bose-Mesner algebra.
Given a finite subset of a sphere or projective space, known as a design, we can compute the strength and angle set of that design. When the strength and angle set meet certain bounds, the design is called tight. Hoggar sought to prove that, aside from certain known cases, the angle sets of tight projective designs must be rational. Lyubich found a counter-example and provided a repair for Hoggar's proof but excluded the exceptional octonion projective cases. This note extends Lyubich's repair of Hoggar's proof to the remaining projective cases and extends the proof to all spherical cases. It …
In addition to the vertices of the regular hexagon and icosahedron, there are precisely two strictly projective tight 5-designs: one constructed from the short vectors of the Leech lattice and the other corresponding to a generalized hexagon structure in the octonion projective plane. This paper describes a new connection between these two strictly projective tight 5-designs -- a common construction using octonions. Certain octonion involutionary matrices act on a three-dimensional octonion vector space to produce the first 5-design and these same matrices act on the octonion projective plane …
We study tight projective 2-designs in three different settings. In the complex setting, Zauner's conjecture predicts the existence of a tight projective 2-design in every dimension. Pandey, Paulsen, Prakash, and Rahaman recently proposed an approach to make quantitative progress on this conjecture in terms of the entanglement breaking rank of a certain quantum channel. We show that this quantity is equal to the size of the smallest weighted projective 2-design. Next, in the finite field setting, we introduce a notion of projective 2-designs, we characterize when such projective 2-designs are …
The two strictly projective tight 5-designs are the lines spanned by the short vectors of the Leech lattice and a set of points in the octonion projective plane that define a generalized hexagon of order (2,8). A previous paper introduced a common construction that can generate these two tight 5-designs. This paper describes the same construction in terms of octonion arithmetic. An octonion integer construction of the Leech lattice is described using properties of the octonion integers taken modulo 2. The Leech lattice automorphism group is constructed from octonion reflections. The common con…
It is shown that a simple graph which is embeddable in the real projective plane is minimally 3-rigid if and only if it is (3,6)-tight. Moreover the topologically uncontractible embedded graphs of this type are constructible from one of 8 embedded graphs by a sequence of vertex splitting moves. In particular the characterisation of minimal 3-rigidity holds for a triangulated Mobius strip.
In this article, we study symmetric $(v, k, λ)$ designs admitting a flag-transitive and point-primitive automorphism group $G$ whose socle is $PSU_{4}(q)$. We prove that there exist eight non-isomorphic such designs for which $λ\in\{3,6,18\}$ and $G$ is either $PSU_{4}(2)$, or $PSU_{4}(2):2$.
I give an elementary proof that a quasi-symmetric design without repeated blocks on $v$ points has at most $v\choose2$ blocks, with equality if and only if it is a tight $4$-design.
We complete the classification of tight $4$-designs in Hamming association schemes $H(n,q)$, i.e., that of tight orthogonal arrays of strength $4$, which had been open since a result by Noda (1979). To do so, we construct an association scheme attached to a tight $4$-design in $H(n,q)$ and analyze its triple intersection numbers to conclude the non-existence in all open cases.
In this paper we consider binary linear codes spanned by incidence matrices of Steiner 2-designs associated with maximal arcs in projective planes of even order, and their dual codes. Upper and lower bounds on the 2-rank of the incidence matrices are derived. A lower bound on the minimum distance of the dual codes is proved, and it is shown that the bound is achieved if and only if the related maximal arc contains a hyperoval of the plane. The binary linear codes of length 52 spanned by the incidence matrices of 2-$(52,4,1)$ designs associated with previously known and some newly found maximal…
In this article, we study symmetric $(v, k, λ)$ designs admitting a flag-transitive and point-primitive automorphism group $G$ whose socle is a projective special unitary group of dimension at most five. We, in particular, determine all such possible parameters $(v, k, λ)$ and show that there exist eight non-isomorphic of such designs for which $λ\in\{3,6,12, 16, 18\}$ and $G$ is $PSU_{3}(3)$, $PSU_{3}(3):2$, $PSU_{4}(2)$ or $PSU_{4}(2):2$.
Let PG$(\mathbb{F}_q^v)$ be the $(v-1)$-dimensional projective space over $\mathbb{F}_q$ and let $Γ$ be a simple graph of order ${q^k-1\over q-1}$ for some $k$. A 2$-(v,Γ,λ)$ design over $\mathbb{F}_q$ is a collection $\cal B$ of graphs (\textit{blocks}) isomorphic to $Γ$ with the following properties: the vertex set of every block is a subspace of PG$(\mathbb{F}_q^v)$; every two distinct points of PG$(\mathbb{F}_q^v)$ are adjacent in exactly $λ$ blocks. This new definition covers, in particular, the well known concept of a 2$-(v,k,λ)$ design over $\mathbb{F}_q$ corresponding to the case that …
We give an inequality on the packing of vectors/lines in quaternionic Hilbert space $\Hd$, which generalises those of Sidelnikov and Welch for unit vectors in $\Rd$ and $\Cd$. This has a parameter $t$, and depends only on the vectors up to projective unitary equivalence. The sequences of vectors in ${\mathbb{F}}^d={\mathbb{R}}^d,{\mathbb{C}}^d,{\mathbb{H}}^d$ that give equality, which we call spherical $(t,t)$-designs, are seen to satisfy a cubature rule on the unit sphere in ${\mathbb{F}}^d$ for a suitable polynomial space $\Hom_{\Fd}(t,t)$. Using this, we show that the projective spherical $…
Codes and designs in multivariate $Q$-polynomial association schemes
Key Laboratory of Intelligent Computing Signal Processing, Ministry of Education, School of Mathematical Sciences, Anhui University(安徽大学数学科学学院);State Key Laboratory of Integrated Service Networks, Xidian University(西安电子科技大学);School of Mathematical Sciences, Anhui University(安徽大学数学科学学院);I2M (Aix Marseille Univ, CNRS)(艾克斯马赛大学)
An equiangular tight frame (ETF) is a type of optimal packing of lines in a real or complex Hilbert space. In the complex case, the existence of an ETF of a given size remains an open problem in many cases. In this paper, we observe that many of the known constructions of ETFs are of one of two types. We further provide a new method for combining a given ETF of one of these two types with an appropriate group divisible design (GDD) in order to produce a larger ETF of the same type. By applying this method to known families of ETFs and GDDs, we obtain several new infinite families of ETFs. The …