Anurag Bishnoi

most citedOn generalized hexagons of order

(3, t)

and

(4, t)

containing a subhexagon

2 citations · 2 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2023

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

math.CO2023

Covering grids with multiplicity

Anurag Bishnoi, Simona Boyadzhiyska, Shagnik Das +1

Given a finite grid in $R^{2}$ , how many lines are needed to cover all but one point at least $k$ times? Problems of this nature have been studied for decades, with a genera…

math.CO2016

The $L_{3} (4)$ near octagon

Anurag Bishnoi, Bart De Bruyn

In recent work we constructed two new near octagons, one related to the finite simple group $G_{2} (4)$ and another one as a sub-near-octagon of the former. In the present pa…

math.CO2016★ 2 cited

On generalized hexagons of order $(3, t)$ and $(4, t)$ containing a subhexagon

Anurag Bishnoi, Bart De Bruyn

We prove that there are no semi-finite generalized hexagons with $q + 1$ points on each line containing the known generalized hexagons of order $q$ as full subgeometries when $q$ i…

Strong blocking sets and minimal codes from expander graphs

Covering grids with multiplicity

The L3​(4) near octagon

On generalized hexagons of order (3,t) and (4,t) containing a subhexagon

The $L_{3} (4)$ near octagon

On generalized hexagons of order $(3, t)$ and $(4, t)$ containing a subhexagon