The structure of maximum subsets of  with no solutions to .

Baltz, Andreas; Hegarty, Peter; Knape, Jonas; Larsson, Urban; Schoen, Tomasz

Displaying similar documents to “The structure of maximum subsets of ${1, \dots, n}$ with no solutions to $a + b = k c$ .”

Maximum subsets of $(0, 1]$ with no solutions to $x + y = k z$ .

Chung, Fan R.K., Goldwasser, John L. (1996)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Generalized sum-free subsets.

Caro, Yair (1990)

International Journal of Mathematics and Mathematical Sciences

Similarity:

A note on $K_{k, k}$ -cross free families.

Suk, Andrew (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On subsequence sums of a zero-sum free sequence. II.

Gao, Weidong, Li, Yuanlin, Peng, Jiangtao, Sun, Fang (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

The nucleus of the free alternative algebra.

Hentzel, I.R., Peresi, L.A. (2006)

Experimental Mathematics

Similarity:

On finite pattern-free sets of integers

Karl Dilcher, Lutz G. Lucht (2006)

Acta Arithmetica

Similarity:

Square-free and overlap-free words

A. J. Kfoury (1988)

Banach Center Publications

Similarity:

Fixed-point free maps of Euclidean spaces

R. Z. Buzyakova, A. Chigogidze (2011)

Fundamenta Mathematicae

Similarity:

Our main result states that every fixed-point free continuous self-map of ℝⁿ is colorable. This result can be reformulated as follows: A continuous map f: ℝⁿ → ℝⁿ is fixed-point free iff f̃: βℝⁿ → βℝⁿ is fixed-point free. We also obtain a generalization of this fact and present some examples