Javier Cilleruelo

most citedThe number of rational numbers determined by large sets of integers

11 citations · 12 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2016★ 1 cited

A greedy algorithm for $B_{h} [g]$ sequences

Javier Cilleruelo

For any positive integers $h \geq 2$ and $g \geq 1$ , we present a greedy algorithm that provides an infinite $B_{h} [g]$ sequence with $a_{n} \leq 2 g n^{h + (h - 1) / g} .$

math.NT2009★ 11 cited

The number of rational numbers determined by large sets of integers

Javier Cilleruelo, D. S. Ramana, Olivier Ramare

When $A$ and $B$ are subsets of the integers in $[1, X]$ and $[1, Y]$ respectively, with $∣ A ∣ \geq α X$ and $∣ B ∣ \geq β X$ , we show that the number of rational numbers expressible as $…

A greedy algorithm for Bh​[g] sequences

The number of rational numbers determined by large sets of integers

A greedy algorithm for $B_{h} [g]$ sequences