Brahadeesh Sankarnarayanan

collaborators

4 papers

math.CO2026

Low-rank matrices, tournaments, and symmetric designs

Niranjan Balachandran, Brahadeesh Sankarnarayanan

Let $a = (a_{i})_{i \geq 1}$ be a sequence in a field $F$ , and $f : F \times F \to F$ be a function such that $f(a_{i},a_{i}) \neq…

math.CO2026

$5$ -list-coloring toroidal $6$ -regular triangulations in linear time

Niranjan Balachandran, Brahadeesh Sankarnarayanan

We give an explicit procedure for $5$ -list-coloring a large class of toroidal $6$ -regular triangulations in linear time. We also show that these graphs are not $3$ -choosable.

math.CO2025

An ensemble of high rank matrices arising from tournaments

Niranjan Balachandran, Srimanta Bhattacharya, Brahadeesh Sankarnarayanan

Suppose $F$ is a field and let $a := (a_{1}, a_{2}, \dots)$ be a sequence of non-zero elements in $F$ . For $a_{n} := (a_{1}, \dots, a_{n})$ , we consider…

math.CO2025

Bounded fractional intersecting families are linear in size

Niranjan Balachandran, Shagnik Das, Brahadeesh Sankarnarayanan

Using the sunflower method, we show that if $I^¸ \in (0, 1) \cap Q$ and $F$ is a $O (n^{1/3})$ -bounded $I^¸$ -intersecting family over $[n]$ , then $\lvert \mathcal{F}…

Low-rank matrices, tournaments, and symmetric designs

5-list-coloring toroidal 6-regular triangulations in linear time

An ensemble of high rank matrices arising from tournaments

Bounded fractional intersecting families are linear in size

$5$ -list-coloring toroidal $6$ -regular triangulations in linear time