ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let AA be a finite subset of the positive integers, and let nn be a positive integer. For each positive integer kk, write k∙A={ka:a∈A}k\boldsymbol{\bullet} A=\{ka:a\in A\}, and let Δ\Delta denote symmetric difference of sets. Extended 1-2-3 Conjecture. One has

∣AΔ(2∙A)Δ⋯Δ(n∙A)∣⩾n.\left|A\Delta (2\boldsymbol{\bullet} A)\Delta\cdots\Delta (n\boldsymbol{\bullet} A)\right|\geqslant n.

Pilz proved the inequality for n≤6n\leq 6, and Huang, Ke and Pilz later formulated it as the Extended 1-2-3 Conjecture. The source paper states that it resolves the conjecture for all sufficiently large nn, so the assertion is not open in that range; the supplied text does not specify the exact threshold or whether all remaining cases have been settled.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.