Searcharxiv⌕ Search

arXiv subjects

Sam Adriaensen

Publications and source records attributed to Sam Adriaensen.

At least 19 recordsLinked to original sources

On configurations that are nearly generalised polygons

Payne (1972) introduced nearly generalised $n$-gons as $(s+1)$-regular bipartite graphs of girth $2n$ with small excess over the Moore bound. Biggs and Ito (1980) proved nonexistence of such graphs if $s > 1$ and $n > 3$, leaving open the existence of regular antipodal planes. We revisit this problem from several equivalent viewpoints. First we show that a regular antipodal plane of order $s$ is equivalent to a balanced weighing matrix whose support is the incidence matrix of a biplane with parameters \[ 2-\left(\frac{s^2+s+2}{2},\,s+1,\,2\right). \] This gives short determinant and local-arithmetic obstructions to existence. We then formulate the question of signing a biplane as an affine linear system over $\mathbb F_2$, and use this formulation to prove that no regular antipodal plane of order $s$ exists with $4\le s\le 14$. Finally, we give further equivalent formulations in terms of sharply deranged families of permutations and mutually orthogonal array-bic squares. These translations provide new computational and structural approaches to Payne's conjecture that regular antipodal planes exist only for $s=2,3$.

math.CO↗

On the weight distribution bound for the negative eigenvalue of polar collinearity graphs

The weight distribution bound gives a lower bound on the weight of eigenvectors for eigenvalues of distance-regular graphs. In this note, we study when the weight distribution bound is tight for the negative eigenvalue of collinearity graphs of finite embedded polar spaces, and elliptic and hyperbolic affine polar graphs. We give a complete classification of eigenvectors meeting the weight distribution bound.

math.CO↗

On equidistributed directions in finite affine planes

We investigate a recently introduced generalisation of determined directions in affine planes. A direction $(d)$ in an affine plane is a point of the line at infinity in the projective completion, and hence corresponds to a parallel class. A (multi)set $S$ of points is equidistributed from direction $(d)$ if all lines from that parallel class intersect $S$ in the same number of points. In this paper, we give a construction of point (multi)sets that are inequidistributed from exactly 3 directions in any finite translation plane, and prove that all such (multi)sets arise from this construction, generalising a result of Kiss and Somlai in Desarguesian planes of prime order. We also use ideas from algebraic graph theory to prove results on directions associated with a pair of point sets $S$ and $T$. If for every direction $(d)$ either $S$ or $T$ is equidistributed from $(d)$, we prove that $|S \cap T| = |S||T|/q^2$, where $q$ is the order of the affine plane. In the appendix, we give a combinatorial alternative approach to proving this equality, which can be of independent interest. We also introduce the notion of directions cross-determined by a pair of sets $S$ and $T$, and prove that $|S| |T| \leq q^2$ if $(S,T)$ cross-determines at most half of the directions, where equality forces $S = T$.

math.CO↗

Erdős-Ko-Rado properties of Steiner 2-designs

In this paper, we prove an Erdős-Ko-Rado characterisation of maximum intersecting families of blocks in Steiner $2$-designs arising from Desarguesian maximal arcs. This answers a recent question of Goryainov and Konstantinova, and implies that, among the known Steiner $2$-designs, only finitely many admit a maximum intersecting family that is neither canonical nor associated with a subdesign. We also perform a computational study of $2$-$(120,8,1)$ designs and find strong counterexamples to a problem of Godsil and Meagher. Finally, we give a parametric generalisation of $2$-$(66,6,1)$ designs with tight dual arcs as non-canonical maximum intersecting families.

math.CO↗

A note on the classification of classical distance-regular graphs of negative type and the non-existence of hemisystems

DISCLAIMER: Due to an error in the literature, we cannot be sure that the conclusions drawn in this paper are correct. The goal of this note is to connect some interesting results in the literature on algebraic graph theory and finite geometry. In 1999, Weng gave an almost complete classification of classical distance-regular graphs of negative type with diameter at least 4. He proved that these graphs are either dual polar graphs of Hermitian polar spaces, Hermitian forms graphs, or fall into a last category. It was recently proved by Yian et al. that the latter category does not exist when the diameter equals 3, which by Weng's results proves that they do not exist for bigger diameter. Using a result of Vanhove, this proves that certain hemisystems in Hermitian polar spaces cannot exist.

math.CO↗

Hat guessing with proper colorings

We initiate the study of the hat guessing number of a graph where the adversary is only allowed to provide a proper coloring of the graph. This is the largest number $q$ for which there is a guessing strategy on each vertex that only depends on its neighborhood, such that for every proper coloring of the graph with $q$ colors at least one vertex guesses its color correctly. In this variation, we prove that the hat guessing number of the complete graphs on $n$ vertices is $2n - 1$, which is roughly twice the classical hat guessing number of the complete graph. Our winning strategy is related to finding perfect matchings between the middle layers of the boolean poset of dimension $2n - 1$. We prove that the hat guessing number of all trees on $n \geq 3$ vertices is equal to $4$. We derive general upper bounds in terms of the number of vertices, chromatic number, and maximum degree, and obtain improved bounds for book graphs. Using our results and an ILP formulation of the problem, we determine the exact hat guessing number for all graphs on at most $4$ vertices, give bounds on graphs on $5$ vertices, and suggest some open problems.

math.CO↗

A sporadic strongly regular graph with parameters $(120,56,28,24)$ from a primitive action of the symmetric group on $7$ elements

There are up to isomorphism exactly three strongly regular graphs with parameters $(120,56,28,24)$ whose automorphism group acts primitively on the vertices. Two of these graphs belong to classical families: one is the non-orthogonality graph on anisotropic points of the hyperbolic quadric $\mathcal Q^+(7,2)$, and the other one belongs to the Johnson scheme. The third one is not well understood. In this paper, we give a description of this graph in terms of ovoids and spreads of $\mathcal Q^+(7,2)$, or equivalently in terms of overlarge sets of Steiner systems with parameters $(3,4,8)$.

math.CO↗

Skirting the $n$-tuples

Let $n\ge 2$ and $q\ge 2$ be given. The set $X = \mathbb Z_q^n$ is a metric space of diameter $n$ under the Hamming metric $d(\cdot,\cdot)$. We seek a smallest set $S\subseteq X$ that ``skirts'' every $q$-ary $n$-tuple in the sense that every $x\in X$ is at distance $n$ from at least one element of $S$. Thus we aim to compute the total domination number $f(n,q)$ of the graph $G(n,q)$ with vertex set $X$ and edge set $\{ xy \, \| \, d(x,y)=n\}$. We provide constructions and bounds for this number, establishing $f(n,q) = C_q^{(1+o(1))n}$ for some constants $2=C_2>C_3 \geq \cdots$ which we are only able to estimate at the present time.

math.CO↗

Even Sets and Dual Projective Geometric Codes: A Tale of Cylinders

In this paper, we prove that the smallest even sets in ${\rm PG}(n,q)$, i.e. sets that intersect every line in an even number of points, are cylinders with a hyperoval as base. This fits into a more general study of dual projective geometric codes. Let $q$ be a prime power, and define $\mathcal C_k(n,q)^\perp$ as the kernel of the $k$-space vs. point incidence matrix of ${\rm PG}(n,q)$, seen as a matrix over the prime order subfield of $\mathbb F_q$. Determining the minimum weight of this linear code is still an open problem in general, but has been reduced to the case $k=1$. There is a known construction that constructs small weight codewords of $\mathcal C_1(n,q)^\perp$ from minimum weight codewords of $\mathcal C_1(2,q)^\perp$. We call such codewords cylinder codewords. We pose the conjecture that all minimum weight codewords of $\mathcal C_1(n,q)^\perp$ are cylinder codewords. This conjecture is known to be true if $q$ is prime. We take three steps towards proving that the conjecture is true in general: (1) We prove that the conjecture is true if $q$ is even. This is equivalent to our classification of the smallest even sets. (2) We prove that the minimum weight of $\mathcal C_1(n,q)^\perp$ is $q^{n-2}$ times the minimum weight of $\mathcal C_1(2,q)^\perp$, which matches the weight of cylinder codewords. Thus, we completely reduce the problem of determining the minimum weight of $\mathcal C_1(n,q)^\perp$ to the case $n=2$. (3) We prove that if the conjecture is true for $n=3$, it is true in general.

math.CO↗

Intersection problems for linear codes and polynomials over finite fields

This paper proves a stability result for a variation of the Erdős-Ko-Rado theorem in the context of polynomials over finite fields. Let $\mathcal F$ be a family of polynomials of degree at most $k \geq 3$ in $\mathbb F_q[X]$. Call $\mathcal F$ intersecting if for any two polynomials $f, g$ in $\mathcal F$, there exists a point $x \in \mathbb F_q$ for which $f(x) = g(x)$. An intersecting family is called a star if it consists of all polynomials $f$ with ${\rm deg } f \leq k$ such that $f(x) = y$ for some fixed points $x, y \in \mathbb F_q$. In this paper we prove that if $\mathcal F$ is an intersecting family with $|\mathcal F| \geq \frac 1{\sqrt 2} q^k + \mathcal O(q^{k-1})$, then $\mathcal F$ is contained in a star. In fact, we prove that this is still true if we also evaluate the polynomials "at infinity", which is equivalent to studying the problem for homogeneous bivariate polynomials. The proof technique extends to a general framework for intersection problems of linear codes $C$. One has to investigate the geometry of the projective system $\mathcal S$ associated to $C$. If the hyperplanes that don't intersect $\mathcal S$ are well spread out with respect to the points not on $\mathcal S$, then one obtains stability results, showing that any intersecting family of reasonably large size is contained in a star.

math.CO↗

A note on short minimal codes from subgeometries

In a 2022, Bartoli, Cossidente, Marino, and Pavese proved that in the projective space ${\rm PG}(3,q^3)$, one can find three $\mathbb F_q$-subgeometries such that the union of their point sets is a strong blocking set. This proves the existence of linear minimal codes with parameters $[3(q^2+1)(q+1),4]_{q^3}$ for every prime power $q$. We give a short proof of this result for odd values of $q > 9$, using the theory of small blocking sets in projective planes.

math.CO↗

Multisets with few special directions and small weight codewords in Desarguesian planes

In this paper, we tie together two well studied topics related to finite Desarguesian affine and projective planes. The first topic concerns directions determined by a set, or even a multiset, of points in an affine plane. The second topic concerns the linear code generated by the incidence matrix of a projective plane. We show how a multiset determining only $k$ special directions, in a modular sense, gives rise to a codeword whose support can be covered by $k$ concurrent lines. The reverse operation of going from a codeword to a multiset of points is trickier, but we describe a possible strategy and show some fruitful applications. Given a multiset of affine points, we use a bound on the degree of its so-called projection function to yield lower bounds on the number of special directions, both in an ordinary and in a modular sense. In the codes related to projective planes of prime order $p$, there exists an odd codeword, whose support is covered by 3 concurrent lines, but which is not a linear combination of these 3 lines. We generalise this codeword to codewords whose support is contained in an arbitrary number of concurrent lines. In case $p$ is large enough, this allows us to extend the classification of codewords from weight at most $4p-22$ to weight at most $5p-36$.

math.CO↗

Points below a parabola in affine planes of prime order

The elements of a finite field of prime order canonically correspond to the integers in an interval. This induces an ordering on the elements of the field. Using this ordering, Kiss and Somlai recently proved interesting properties of the set of points below the diagonal line. In this paper, we investigate the set of points lying below a parabola. We prove that in some sense, this set of points looks the same from all but two directions, despite having only one non-trivial automorphism. In addition, we study the sizes of these sets, and their intersection numbers with respect to lines.

math.CO↗

The minimum weight of the code of intersecting lines in ${\rm PG}(3,q)$

We characterise the minimum weight codewords of the $p$-ary linear code of intersecting lines in ${\rm PG}(3,q)$, $q=p^h$, $q\geq19$, $p$ prime, $h\geq 1$. If $q$ is even, the minimum weight equals $q^3+q^2+q+1$. If $q$ is odd, the minimum weight equals $q^3+2q^2+q+1$. For $q$ even, we also characterise the codewords of second smallest weight.

math.CO↗

Association schemes and orthogonality graphs on anisotropic points of polar spaces

In this paper, we study association schemes on the anisotropic points of classical polar spaces. Our main result concerns non-degenerate elliptic and hyperbolic quadrics in PG$(n,q)$ with $q$ odd. We define relations on the anisotropic points of such a quadric that depend on the type of line spanned by the points and whether or not they are of the same "quadratic type". This yields an imprimitive $5$-class association scheme. We calculate the matrices of eigenvalues and dual eigenvalues of this scheme. We also use this result, together with similar results from the literature concerning other classical polar spaces, to exactly calculate the spectrum of orthogonality graphs on the anisotropic points of non-degenerate quadrics in odd characteristic and of non-degenerate Hermitian varieties. As a byproduct, we obtain a $3$-class association scheme on the anisotropic points of non-degenerate Hermitian varieties, where the relation containing two points depends on the type of line spanned by these points, and whether or not they are orthogonal.

math.CO↗

On $m$-ovoids of $Q^+(7,q)$ with $q$ odd

In this paper, we provide a construction of $(q+1)$-ovoids of the hyperbolic quadric $Q^+(7,q)$, $q$ an odd prime power, by glueing $(q+1)/2$-ovoids of the elliptic quadric $Q^-(5,q)$. This is possible by controlling some intersection properties of (putative) $m$-ovoids of elliptic quadrics. It yields eventually $(q+1)$-ovoids of $Q^+(7,q)$ not coming from a $1$-system. Secondly, we also construct $m$-ovoids for $m \in \{ 2,4,6,8,10\}$ in $Q^+(7,3)$. Therefore we first investigate how to construct spreads of $\pg(3,q)$ that have as many secants to an elliptic quadric as possible.

math.CO↗

Blocking subspaces with points and hyperplanes

In this paper, we characterise the smallest sets $B$ consisting of points and hyperplanes in $\text{PG}(n,q)$, such that each $k$-space is incident with at least one element of $B$. If $k > \frac {n-1} 2$, then the smallest construction consists only of points. Dually, if $k < \frac{n-1}2$, the smallest example consists only of hyperplanes. However, if $k = \frac{n-1}2$, then there exist sets containing both points and hyperplanes, which are smaller than any blocking set containing only points or only hyperplanes.

math.CO↗

On the minimum size of linear sets

Recently, a lower bound was established on the size of linear sets in projective spaces, that intersect a hyperplane in a canonical subgeometry. There are several constructions showing that this bound is tight. In this paper, we generalize this bound to linear sets meeting some subspace $π$ in a canonical subgeometry. We obtain a tight lower bound on the size of any $\mathbb F_q$-linear set spanning $\text{PG}(d,q^n)$ in case that $n \leq q$ and $n$ is prime. We also give constructions of linear sets attaining equality in the former bound, both in the case that $π$ is a hyperplane, and in the case that $π$ is a lower dimensional subspace.

math.CO↗