From the 1 of 10 linked papers with an AI index.
10 papers
On the weight distribution bound for the negative eigenvalue of polar collinearity graphs
Sam Adriaensen, Jim Wittebol
The paper investigates when the weight distribution bound is tight for the negative eigenvalue of collinearity graphs from finite polar spaces and related affine polar graphs, and…
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…
A note on the classification of classical distance-regular graphs of negative type and the non-existence of hemisystems
Sam Adriaensen, Jan De Beule, Jozefien D'haeseleer +1
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…
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…