Math-6240 · mathematics · Mathematics

Math-6240

Erdős Problem #1186

Status Open · erdosproblems.comLLM status Open unverified

Erdős problems openaigpt 6 astra ultra 7% cataloguedOpenOpen

Statement

Fix $k\geq2$. Among all red--blue colourings of $[n]$, minimise the number of monochromatic arithmetic progressions of length $k$, counting each progression with positive common difference once. Determine or sharply estimate the optimal asymptotic coefficient $\delta_k$ in the universal lower bound \[\#\{\text{monochromatic }k\text{-term progressions}\}\geq (\delta_k+o(1))n^2.\] An asymptotic description of $\delta_k$ as $k$ grows is requested.

Restatement from Math-6240-A1 r1, with the source manuscript’s qualifications.

Original problem on erdosproblems.com

Statement licence: CC-BY-4.0 · Source file

Contributions 1

Math-6240-A1 · No claim recorded · LLM-generated · gpt 6 astra ultra ·

GPT 6 Astra Ultra attempt on Math-6240

Erdős Problem 1186 --- GPT 6 Astra Ultra partial attempt

FORMAL RESTATEMENT

Fix $k\geq2$. Among all red--blue colourings of $[n]$, minimise the number of monochromatic arithmetic progressions of length $k$, counting each progression with positive common difference once. Determine or sharply estimate the optimal asymptotic coefficient $\delta_k$ in the universal lower bound \[\#\{\text{monochromatic }k\text{-term progressions}\}\geq (\delta_k+o(1))n^2.\] An asymptotic description of $\delta_k$ as $k$ grows is requested.

CONTEXT AND SCOPE

This replaces the earlier statement-only record with an elementary mathematical attempt. The arguments below establish only their stated partial results; no novelty or full solution is claimed.

The page leaves the counting convention implicit; its displayed random-colouring bound 1/$(k-1)2^k$ identifies the convention used here.

ATTACK PLAN AND WORK

For fixed $k\ge2$, the number of $k$-term progressions in $[n]$, with positive common difference counted once, is \[T_k(n)=\sum_{d=1}^{\lfloor(n-1)/(k-1)\rfloor}(n-(k-1)d) =\frac{n^2}{2(k-1)}+O_k(n).\tag{1}\] In an independent fair coloring each progression is monochromatic with probability $2^{1-k}$. Linearity of expectation, which requires no independence between different progressions, therefore gives a coloring with at most \[\frac{n^2}{(k-1)2^k}+O_k(n)\] monochromatic progressions. In particular the optimal coefficient satisfies $\delta_k\le1/((k-1)2^k)$.

For $k=2$ this calculation is sharp. If the color classes have sizes $a,n-a$, every unordered pair is a 2-term progression, and their monochromatic count is \[\binom a2+\binom{n-a}2 =\left(a-\frac n2\right)^2+\frac{n^2}{4}-\frac n2.\] Balanced classes attain the minimum up to integer rounding, so $\delta_2=1/4$. The square term proves the lower bound directly; averaging alone would not.

VERIFICATION AND REMAINING GAP

For $k\ge3$, correlations can improve on random colorings, and no matching lower bound or asymptotic description as $k$ grows is supplied here. The exact 2-term case must not be extrapolated to longer progressions.

SOURCES

https://www.erdosproblems.com/1186

FINAL

UNRESOLVED. The full source problem remains outside the scope of the proved partial results.

COMPLETION ESTIMATE

$7\%$. This is a conservative subjective estimate toward the whole problem, not a probability that the argument is correct or a claim that a fixed fraction of the problem has been solved.

Go to contribution →