14 papers · 1 filter
On the weight distribution bound for the negative eigenvalue of polar collinearity graphs
Sam Adriaensen, Jim Wittebol
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 boun…
A sporadic strongly regular graph with parameters from a primitive action of the symmetric group on elements
Sam Adriaensen, Robert F. Bailey, Jan De Beule +1
There are up to isomorphism exactly three strongly regular graphs with parameters whose automorphism group acts primitively on the vertices. Two of these graphs be…
Hat guessing with proper colorings
Sam Adriaensen, Peter Bentley, Anurag Bishnoi +6
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 for which…
Skirting the -tuples
Sam Adriaensen, Ferdinand Ihringer, William J. Martin +1
Let and be given. The set is a metric space of diameter under the Hamming metric . We seek a smallest set t…
Even Sets and Dual Projective Geometric Codes: A Tale of Cylinders
Sam Adriaensen
In this paper, we prove that the smallest even sets in , i.e. sets that intersect every line in an even number of points, are cylinders with a hyperoval as base. Thi…
Intersection problems for linear codes and polynomials over finite fields
Sam Adriaensen
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 be a family of polynomials of d…