Ritesh Goenka

activity

20192026

most citedContact Tracing Enhances the Efficiency of COVID-19 Group Testing

21 citations · 25 across the 13 of their papers we have counts for

collaborators

Showing 2026Show all

5 papers · 1 filter

math.CO2026

The extensible no-four-on-a-circle problem

Anubhab Ghosal, Ritesh Goenka

We show that there exists a set $S \subset Z^{2}$ containing no four points on a circle or a line such that $∣ S \cap [n]^{2} ∣ = Ω (n)$ as $n \to \infty$ . Since any no-f…

math.CO2026

No- $(k + 1)$ -in-line problem for $k ⩾ 3$

Anubhab Ghosal, Ritesh Goenka, Alexandr Grebennikov +3

What is the maximum number of points one can place in an $n \times n$ grid such that every Euclidean line contains at most $k$ points? For $k = 2$ , 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 $S$ , what is the maximum number of congruent copies of $S$ contained in a set of $n$ points in the Euclidean plane? Building on OpenAI's re…

math.CO2026

Point sets avoiding near-integer distances

Ritesh Goenka, Kenneth Moore

Let $d \in N$ , $δ \in (0, 1/2)$ , and $X > 0$ . Denote by $N_{d} (X, δ)$ the maximum number of points in a subset of the closed Euclidean ball of radius $X$ in $R^{d}$ su…

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 $n$ steps. Conside…

The extensible no-four-on-a-circle problem

No-(k+1)-in-line problem for k⩾3

Congruent copies of finite patterns in planar point sets

Point sets avoiding near-integer distances

Source localisation in simple random walks

No- $(k + 1)$ -in-line problem for $k ⩾ 3$