4 papers
The Asymptotic Number of Anticodes in Hamming Spaces
Anna-Lena Horlemann, Ananthakrishnan Ravi
In the Hamming space , a -anticode is a subset in which every pair of points has Hamming distance at most , or equivalently, a set of diameter at most . Le…
The chromatic number of finite projective spaces
Anurag Bishnoi, Wouter Cames van Batenburg, Ananthakrishnan Ravi
The chromatic number of the finite projective space , denoted , is the minimum number of colors needed to color its points so that no line is monochroma…
Triangle-free subsets of the -distance graph of the hypercube
Padmini Mukkamala, Ananthakrishnan Ravi
Given the -distance graph on the hypercube $\F_2^n$, where two vertices are adjacent if their Hamming distance is exactly , we study the maximum size of a triangle-f…
New bounds and constructions for large partial -ovoids and related structures
John Bamberg, Anurag Bishnoi, Ferdinand Ihringer +1
We use -rank bounds on partial ovoids and the classical bounds on Ramsey numbers to obtain upper bounds on the size of partial -ovoids in finite classical polar spaces. These…