activity
20192026
most citedSmall Weight Code Words of Projective Geometric Codes

7 citations · 30 across the 25 of their papers we have counts for

collaborators

26 papers

math.CO2026

On equidistributed directions in finite affine planes

Sam Adriaensen, Bence Csajbók, Zsuzsa Weiner

We investigate a recently introduced generalisation of determined directions in affine planes. A direction in an affine plane is a point of the line at infinity in the projec…

math.CO2026

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

Sam Adriaensen, Sergey Goryainov, Elena V. Konstantinova +1

In this paper, we prove an Erdős-Ko-Rado characterisation of maximum intersecting families of blocks in Steiner -designs arising from Desarguesian maximal arcs. This answers a r…

math.CO2026

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…

math.CO2026

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…

math.CO2026

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…

math.CO2026

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…

math.CO2026

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…

math.CO2025

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…

math.CO2025

A note on short minimal codes from subgeometries

Sam Adriaensen, Peter Sziklai, Zsuzsa Weiner

In a 2022, Bartoli, Cossidente, Marino, and Pavese proved that in the projective space , one can find three -subgeometries such that the union of thei…

math.CO2025

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…

math.CO2024

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

Sam Adriaensen, Tamás Szőnyi, Zsuzsa Weiner

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…

math.CO2024★ 1 cited

Points below a parabola in affine planes of prime order

Sam Adriaensen, Zsuzsa Weiner

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, Kis…

math.CO2024

The minimum weight of the code of intersecting lines in

Sam Adriaensen, Robin Simoens, Leo Storme

We characterise the minimum weight codewords of the -ary linear code of intersecting lines in , , , prime, . If is even, the mini…

math.CO2024★ 1 cited

Association schemes and orthogonality graphs on anisotropic points of polar spaces

Sam Adriaensen, Maarten De Boeck

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…

math.CO2023★ 2 cited

Small weight codewords of projective geometric codes II

Sam Adriaensen, Lins Denaux

The -ary linear code is defined as the row space of the incidence matrix of -spaces and points of . It is known that if is squar…

math.CO2023

On -ovoids of with odd

Sam Adriaensen, Jan De Beule, Giovanni Giuseppe Grimaldi +1

In this paper, we provide a construction of -ovoids of the hyperbolic quadric , an odd prime power, by glueing -ovoids of the elliptic quadric $Q^-(5,…

math.CO2023★ 5 cited

A note on small weight codewords of projective geometric codes and on the smallest sets of even type

Sam Adriaensen

In this paper, we study the codes arising from the incidence of points and -spaces in over the field , with , prim…

math.CO2023★ 2 cited

On the minimum size of linear sets

Sam Adriaensen, Paolo Santonastaso

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 sho…

math.CO2022★ 1 cited

Incidence-free sets and edge domination in incidence graphs

Sam Spiro, Sam Adriaensen, Sam Mattheus

A set of edges of a graph is an edge dominating set if every edge of intersects at least one edge of , and the edge domination number is the smallest size o…

math.CO2022★ 3 cited

Cones from maximum -scattered linear sets and a stability result

Sam Adriaensen, Jonathan Mannaert, Paolo Santonastaso +1

This paper mainly focuses on cones whose basis is a maximum -scattered linear set. We start by investigating the intersection sizes of such cones with the hyperplanes. Then we a…

cs.IT2022★ 4 cited

On additive MDS codes with linear projections

Sam Adriaensen, Simeon Ball

We support some evidence that a long additive MDS code over a finite field must be equivalent to a linear code. More precisely, let be an -linear $(n,q^{hk},n-k+1)…

math.CO2022

Blocking subspaces with points and hyperplanes

Sam Adriaensen, Maarten De Boeck, Lins Denaux

In this paper, we characterise the smallest sets consisting of points and hyperplanes in , such that each -space is incident with at least one element of …

math.CO2022★ 1 cited

Stability of Erdős-Ko-Rado Theorems in Circle Geometries

Sam Adriaensen

Circle geometries are incidence structures that capture the geometry of circles on spheres, cones and hyperboloids in 3-dimensional space. In a previous paper, the author character…

math.CO2021★ 3 cited

Erdős-Ko-Rado theorems for ovoidal circle geometries and polynomials over finite fields

Sam Adriaensen

In this paper we investigate Erdős-Ko-Rado theorems in ovoidal circle geometries. We prove that in Möbius planes of even order greater than 2, and ovoidal Laguerre planes of odd or…