Related papers: On line arrangements with applications to 3-nets
Let $\mathrm{PG}(3, q)$ denote the three-dimensional projective space over the finite field with $q$ elements. A line-spread of $\mathrm{PG}(3, q)$ is a collection $\mathcal{S}$ of mutually skew lines such that every point of…
A set of vectors of equal norm in $\mathbb{C}^d$ represents equiangular lines if the magnitudes of the inner product of every pair of distinct vectors in the set are equal. The maximum size of such a set is $d^2$, and it is conjectured that…
We study the set of lines that meet a fixed line and are tangent to two spheres and classify the configurations consisting of a single line and three spheres for which there are infinitely many lines tangent to the three spheres that also…
" How well connected is the network? " This is one of the most fundamental questions one would ask when facing the challenge of designing a communication network. Three major notions of connectivity have been considered in the literature,…
We consider when the projective special linear group over a finite field defines a $3$-design with a cyclic starter block. We will show that the equivalences of the existence of such $3$-$(q+1,5,3)$ and $3$-$(q+1,10,18)$ designs for a prime…
We show an inequality involving the third largest or second smallest dual eigenvalues of $Q$-polynomial association schemes of class at least three. Also we characterize dual-tight $Q$-polynomial association schemes of class three. Our…
Three $q$-versions of Lommel polynomials are studied. Included are explicit representations, recurrences, continued fractions, and connections to associated Askey--Wilson polynomials. Combinatorial results are emphasized, including a…
This paper begins by extending the notion of a combinatorial configuration of points and lines to a combinatorial configuration of points and planes that we refer to as configurations of order $2$. We then proceed to investigate a further…
We consider several families of combinatorial polytopes associated with the following NP-complete problems: maximum cut, Boolean quadratic programming, quadratic linear ordering, quadratic assignment, set partition, set packing, stable set,…
This note contains two new observations on the linkage properties of quaternion algebras over fields of characteristic 2: first, that a 3-linked field need not be 4-linked (a case which was left open in previous papers) and that three…
We study the change of the minimal degree of a logarithmic derivation of a hyperplane arrangement under the addition or the deletion of a hyperplane, and give a number of applications. First, we prove the existence of Tjurina maximal line…
The review of modern study of algebraic, geometric and differential properties of quaternionic (Q) numbers with their applications. Traditional and "tensor" formulation of Q-units with their possible representations are discussed and groups…
In this work, we propose an optimization approach for constructing various classes of circulant combinatorial designs that can be defined in terms of autocorrelations. The problem is formulated as a so-called feasibility problem having…
Social networks are the fabric of society and the subject of frequent visual analysis. Closed triads represent triangular relationships between three people in a social network and are significant for understanding inherent interconnections…
In this paper, we revisit the theory of perfect unary forms over real quadratic fields. Specifically, we deduce an infinite family of real quadratic fields $\mathbb{Q}(\sqrt{d})$ when $d=2$ or $3$ mod $4$, such that there are three classes…
Having in mind their potential quantum physical applications, we classify all geometric hyperplanes of the near hexagon that is a direct product of a line of size three and the generalized quadrangle of order two. There are eight different…
We revisit the coordinatisation method for projective planes. First, we discuss how the behaviour of the additive and multiplicative loops can be described in terms of its action on the "vertical" line, and how this means one can…
Kelly's theorem states that a set of $n$ points affinely spanning $\mathbb{C}^3$ must determine at least one ordinary complex line (a line passing through exactly two of the points). Our main theorem shows that such sets determine at least…
We estimate from below the number of lines meeting each of given 4 disjoint smooth closed curves in a given cyclic order in the real projective 3-space and in a given linear order in the Euclidean 3-space. Similarly, we estimate the number…
A triangle presentation is a combinatorial datum that encodes the action of a group on a $2$-dimensional triangle complex with prescribed links, which is simply transitive on the vertices. We provide the first infinite family of triangle…