Minimum overlap problem

In number theory and set theory, the minimum overlap problem is a problem proposed by Hungarian mathematician Paul Erdős in 1955.{{cite book |last1=Guy |first1= Richard K. |author1-link=Richard K. Guy |title=Unsolved Problems in Number Theory |url= |issue=3rd edition|year=2004 |editor1-last= Bencsáth |editor1-first=Katalin A. |editor2-last=Halmos |editor2-first= Paul R. |publisher=Springer Science+Business Media Inc.|location=New York |isbn=0-387-20860-7 |chapter=C17 |pages=199–200}}{{cite web |url=http://www.people.fas.harvard.edu/~sfinch/csolve/ovr.pdf |title=Erdös' minimum overlap problem |accessdate=15 December 2013 |last=Finch |first=Steven |date=2 July 2004 |url-status=dead |archiveurl=https://web.archive.org/web/20150405060955/http://www.people.fas.harvard.edu/~sfinch/csolve/ovr.pdf |archivedate=5 April 2015 }}

Formal statement of the problem

Let {{math|A {{=}} {a_i}}} and {{math|B {{=}} {b_j}}} be two complementary subsets, a splitting of the set of natural numbers {{math|{1, 2, …, 2n}}}, such that both have the same cardinality, namely {{math|n}}. Denote by {{math|M_k}} the number of solutions of the equation {{math|a_i − b_j {{=}} k}}, where {{math|k}} is an integer varying between {{math|−2n and 2n}}. {{math|M (n)}} is defined as:

: $M(n) := \min_{A,B} \max_k M_k. \,\!$

The problem is to estimate {{math|M (n)}} when {{math|n}} is sufficiently large.

History

This problem can be found amongst the problems proposed by Paul Erdős in combinatorial number theory, known by English speakers as the Minimum overlap problem. It was first formulated in the 1955 article Some remarks on number theoryP. Erdős: Some remarks on number theory (in Hebrew), Riveon Lematematika 9 (1955), 45-48 MR17,460d. (in Hebrew) in Riveon Lematematica, and has become one of the classical problems described by Richard K. Guy in his book Unsolved problems in number theory.

Partial results

Since it was first formulated, there has been continuous progress made in the calculation of lower bounds and upper bounds of {{math|M (n)}}, with the following results:

= Lower =

class="wikitable" ! Limit inferior ! Author(s) ! Year
$M(n) > n/4$	P. Erdős	1955
$M(n) > (1 - 2^{-1/2} )\, n$	P. Erdős, Scherk	1955
$M(n) > (4 - 6^{1/2})\, n/5$	S. Swierczkowski	1958
$M(n) > (4 - 15^{1/2})^{1/2}\, (n - 1)$	L. Moser	1966
$M(n) > (4 - 15^{1/2})^{1/2}\, n$	J. K. Haugland	1996
$M(n) > 0.379005 { \, } n$	E. P. White	2022

= Upper =

class="wikitable" ! Limit superior ! Author(s) ! Year
$M(n) < (1+o(1)) n/2$	P. Erdős	1955
$M(n) < (1+o(1)) 2n/5$	T. S. Motzkin, K. E. Ralston and J. L. Selfridge,	1956
$M(n) < (1+o(1)) 0.382002... n$	J. K. Haugland	1996
$M(n) < (1+o(1)) 0.380926... n$	J. K. Haugland	2016

J. K. Haugland showed that the limit of {{math|M (n) / n}} exists and that it is less than 0.385694. For his research, he was awarded a prize in a young scientists competition in 1993.{{cite web |url=http://www.neutreeko.net/mop/index.htm |title= The minimum overlap problem |accessdate=20 September 2016 |last=Haugland |first= Jan Kristian}} In 1996, he improved the upper bound to 0.38201 using a result of Peter Swinnerton-Dyer.{{cite journal

| last=Haugland

| first=Jan Kristian

| year=1996

| title=Advances in the Minimum Overlap Problem

| journal=Journal of Number Theory

| volume=58

| issue=1

| location= Ohio (USA)

| pages= 71–78

| issn= 0022-314X

| doi=10.1006/jnth.1996.0064

| doi-access=free

}} This has now been further improved to 0.38093.{{cite arXiv|title=The minimum overlap problem revisited|last=Haugland|first=Jan Kristian|year=2016|class=math.GM|eprint=1609.08000}} In 2022, the lower bound was shown to be at least 0.379005 by E. P. White.{{cite arXiv|title=Erdős' minimum overlap problem|last=White|first=Ethan Patrick|year=2022|class=math.CO|eprint=2201.05704}}

= {{anchor|The first known values of ''M''(''n'')}} The first known values of {{math|''M''(''n'')}} =

The values of {{math|M (n)}} for the first 15 positive integers are the following:

class="wikitable"

style="text-align: right;"

| style="background: ; text-align: center;" | $n\,\!$

| 1

...

style="text-align: right;"

| style="background: ; text-align: center;" | $M(n)\,\!$

| 1

...

It is just the Law of Small Numbers that it is $\textstyle \lfloor 5(n+3)/13 \rfloor$

References

Category:Additive number theory

Category:Unsolved problems in number theory