Maximum subsets of \((0,1]\) with no solutions to \(x+y = kz\)
The electronic journal of combinatorics, Tome 3 (1996) no. 1
If $k$ is a positive real number, we say that a set $S$ of real numbers is $k$-sum-free if there do not exist $x,y,z$ in $S$ such that $x + y = kz$. For $k$ greater than or equal to 4 we find the essentially unique measurable $k$-sum-free subset of $(0,1]$ of maximum size.
@article{10_37236_1225,
author = {Fan R. K. Chung and John L. Goldwasser},
title = {Maximum subsets of \((0,1]\) with no solutions to \(x+y = kz\)},
journal = {The electronic journal of combinatorics},
year = {1996},
volume = {3},
number = {1},
doi = {10.37236/1225},
zbl = {0851.05013},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1225/}
}
Fan R. K. Chung; John L. Goldwasser. Maximum subsets of \((0,1]\) with no solutions to \(x+y = kz\). The electronic journal of combinatorics, Tome 3 (1996) no. 1. doi: 10.37236/1225
Cité par Sources :