16 citations · 30 across the 22 of their papers we have counts for
27 papers
Caged subsequences in permutations
Niranjan Balachandran, Omkar Ramdas, Umesh Shankar
Given a sequence of reals, a subsequence is said to be "caged" if the largest and smallest among the member…
Bounded fractional intersecting families are linear in size
Niranjan Balachandran, Shagnik Das, Brahadeesh Sankarnarayanan
Using the sunflower method, we show that if and is a -bounded -intersecting family over , then $\lvert \mathcal{F} \r…
Low-rank matrices, tournaments, and symmetric designs
Niranjan Balachandran, Brahadeesh Sankarnarayanan
Let be a sequence in a field , and be a function such that $f(a_{i},a_{i}) \neq…
Cyclability, Connectivity and Circumference
Niranjan Balachandran, Anish Hebbar
In a graph , a subset of vertices is said to be cyclable if there is a cycle containing the vertices in some order. is said to be -cyclable if any subs…
On hierarchically closed fractional intersecting families
Niranjan Balachandran, Srimanta Bhattacharya, Krishn Vishwas Kher +2
For a set of positive proper fractions and a positive integer , a fractional -closed -intersecting family is a collection …
An ensemble of high rank matrices arising from tournaments
Niranjan Balachandran, Srimanta Bhattacharya, Brahadeesh Sankarnarayanan
Suppose is a field and let be a sequence of non-zero elements in . For , we consider…