collaborators

7 papers

math.CO2026

No--in-line problem for

Anubhab Ghosal, Ritesh Goenka, Alexandr Grebennikov +3

What is the maximum number of points one can place in an grid such that every Euclidean line contains at most points? For , this is the notorious no-three-i…

math.CO2026

Congruent copies of finite patterns in planar point sets

Shubhrajit Bhattacharya, Ritesh Goenka

Given a finite nonempty planar point set , what is the maximum number of congruent copies of contained in a set of points in the Euclidean plane? Building on OpenAI's re…

math.CO2026

Point sets avoiding near-integer distances

Ritesh Goenka, Kenneth Moore

Let , , and . Denote by the maximum number of points in a subset of the closed Euclidean ball of radius in

math.PR2026

Source localisation in simple random walks

Ritesh Goenka, Peter Keevash, Tomasz Przybyłowski

We consider the problem of locating the source (starting vertex) of a simple random walk, given a snapshot of the set of edges (or vertices) visited in the first steps. Conside…

math.PR2025

Cutoff for generalised Bernoulli-Laplace urn models

Ritesh Goenka, Jonathan Hermon, Dominik Schmid

We introduce a multi-colour multi-urn generalisation of the Bernoulli-Laplace urn model, consisting of urns, colours, and balls, with balls of each colour and $m…

math.CO2025

On subsets of lattice cubes avoiding affine and spherical degeneracies

Anubhab Ghosal, Ritesh Goenka, Peter Keevash

For integers and , we establish new lower bounds on the maximum number of points in such that no lie in a -dimensional affine (or linear) su…