R. Pinchasi

activity

20072025

most citedOn Pseudo-disk Hypergraphs

7 citations · 19 across the 21 of their papers we have counts for

collaborators

Showing 2012Show all

3 papers · 1 filter

math.NT2012

Solving $a \pm b = 2 c$ in the elements of finite sets

Vsevolod F. Lev, Rom Pinchasi

We show that if $A$ and $B$ are finite sets of real numbers, then the number of triples $(a, b, c) \in A \times B \times (A \cup B)$ with $a + b = 2 c$ is at most $(0.15 + o (1)) (∣ A ∣ + ∣ B ∣)^{2}$ as…

cs.CG2012★ 2 cited

The number of distinct distances from a vertex of a convex polygon

Gabriel Nivasch, János Pach, Rom Pinchasi +1

Erdős conjectured in 1946 that every n-point set P in convex position in the plane contains a point that determines at least floor(n/2) distinct distances to the other points of P.…

cs.CG2012

A note on coloring line arrangements

Eyal Ackerman, Rom Pinchasi

We show that the lines of every arrangement of $n$ lines in the plane can be colored with $O (n / lo g n)$ colors such that no face of the arrangement is monochromatic. This i…

Solving a±b=2c in the elements of finite sets

The number of distinct distances from a vertex of a convex polygon

A note on coloring line arrangements

Solving $a \pm b = 2 c$ in the elements of finite sets