R. Pinchasi

activity

20072025

most citedOn Pseudo-disk Hypergraphs

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

collaborators

Showing math.NTShow all

2 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…

math.NT2008

Additive Bases in Abelian Groups

Vsevolod F. Lev, Mikhail E. Muzychuk, Rom Pinchasi

Let $G$ be a finite, non-trivial abelian group of exponent $m$ , and suppose that $B_{1}, ..., B_{k}$ are generating subsets of $G$ . We prove that if $k > 2 m ln lo g_{2} ∣ G ∣$ , then the mul…

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

Additive Bases in Abelian Groups

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