English

Sidon-Ramsey and $B_{h}$-Ramsey numbers

Combinatorics 2023-08-07 v2

Abstract

For a given positive integer kk, the Sidon-Ramsey number \SR(k)\SR(k) is defined as the minimum value of nn such that, in every partition of the set [1,n][1, n] into kk parts, there exists a part that contains two distinct pairs of numbers with the same sum. In other words, there is a part that is not a Sidon set. In this paper, we investigate the asymptotic behavior of this parameter and two generalizations of it. The first generalization involves replacing pairs of numbers with hh-tuples, such that in every partition of [1,n][1, n] into kk parts, there exists a part that contains two distinct hh-tuples with the same sum. Alternatively, there is a part that is not a BhB_h set. The second generalization considers the scenario where the interval [1,n][1, n] is substituted with a non-necessarily symmetric dd-dimensional box of the form i=1d[1,ni]\prod_{i=1}^d[1,n_i]. For the general case of h3h\geq 3 and non-symmetric boxes, before applying our method to obtain the Ramsey-type result, we needed to establish an upper bound for the corresponding density parameter.

Keywords

Cite

@article{arxiv.2111.08076,
  title  = {Sidon-Ramsey and $B_{h}$-Ramsey numbers},
  author = {Manuel A. Espinosa-García and Amanda Montejano and Edgardo Roldán-Pensado and J. David Suárez},
  journal= {arXiv preprint arXiv:2111.08076},
  year   = {2023}
}

Comments

11 pages

R2 v1 2026-06-24T07:39:36.350Z