Conjecture on the asymptotic injectivity of the difference-multiset map

About 1 year old · traced to

Let A⊆{0,1,2,…,n}A \subseteq \{0,1,2,\dots,n\} with 0∈A0 \in A. Define ϕ\phi on all such sets by sending AA to the multiset with ∣A∣2|A|^{2} elements given by

A−A={x−y:x,y∈A}.A-A=\{ x-y:x,y\in A \}.

Difference-multiset injectivity conjecture. As n→∞n \to \infty, the image of ϕ\phi contains 2n−1+o(2n)2^{n-1}+o(2^{n}) distinct elements. For a set AA with maximum element a′a', the reflected set A′={a′−a:a∈A}A'=\{a'-a:a\in A\} has the same difference multiset, so the conjecture asserts that, asymptotically, a difference multiset almost always determines the pair AA and A′A'. Establishing this conjecture would imply that almost all relevant 0,1-polynomials have an irreducible non-reciprocal part. The paper presents it as an open problem associated with a lemma, and does not provide a resolution.

References

Primary source

Michael Filaseta and Alexandros Kalogirou, “On the irreducibility of the non-cyclotomic part of most 0,1-polynomials with few terms”, arXiv:2508.12242 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.