1 citations · 1 across the 6 of their papers we have counts for
9 papers
Explicit strong blocking sets and minimal codes from expander graphs using a new graph parameter
Anurag Bishnoi, Ioannis Kakatelis
A strong blocking set is a set of points in a finite projective space that intersects every hyperplane of the space in a spanning set of the hyperplane. These objects have been stu…
Circular sorting, strong complete mappings and wreath product constructions
Paul Bastide, Anurag Bishnoi, Carla Groenland +2
We continue the study of Adin, Alon and Roichman [arXiv:2502.14398, 2025] on the number of steps required to sort labelled points on a circle by transpositions. Imagine that th…
Explicit constructions of optimal blocking sets and minimal codes
Anurag Bishnoi, István Tomon
A strong -blocking set in a projective space is a set of points that intersects each codimension- subspace in a spanning set of the subspace. We present an explicit construct…
Strong blocking sets and minimal codes from expander graphs
Noga Alon, Anurag Bishnoi, Shagnik Das +1
A strong blocking set in a finite projective space is a set of points that intersects each hyperplane in a spanning set. We provide a new graph theoretic construction of such sets:…
Covering grids with multiplicity
Anurag Bishnoi, Simona Boyadzhiyska, Shagnik Das +1
Given a finite grid in , how many lines are needed to cover all but one point at least times? Problems of this nature have been studied for decades, with a genera…
Blocking sets, minimal codes and trifferent codes
Anurag Bishnoi, Jozefien D'haeseleer, Dion Gijswijt +1
We prove new upper bounds on the smallest size of affine blocking sets, that is, sets of points in a finite affine space that intersect every affine subspace of a fixed codimension…
Subspace coverings with multiplicities
Anurag Bishnoi, Simona Boyadzhiyska, Shagnik Das +1
We study the problem of determining the minimum number of affine subspaces of codimension that are required to cover all points of $\mathbb{F}_2^n\setminus \{\vec{0}…
Ryser's Conjecture for -intersecting hypergraphs
Anurag Bishnoi, Shagnik Das, Patrick Morris +1
A well-known conjecture, often attributed to Ryser, states that the cover number of an -partite -uniform hypergraph is at most times larger than its matching number.…
Non-intersecting Ryser hypergraphs
Anurag Bishnoi, Valentina Pepe
A famous conjecture of Ryser states that every -partite hypergraph has vertex cover number at most times the matching number. In recent years, hypergraphs meeting this c…