ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let

SPP⁡(n)={(∣A+A∣,∣AA∣):A⊆N, ∣A∣=n},\operatorname{SPP}(n)=\{(|A+A|,|AA|):A\subseteq\mathbb N,\ |A|=n\},

where

A+A={a+b:a,b∈A},AA={ab:a,b∈A}.A+A=\{a+b:a,b\in A\},\qquad AA=\{ab:a,b\in A\}.

Small-representative conjecture. If (i,j)∈SPP⁡(n)(i,j)\in\operatorname{SPP}(n), then there is a set A⊆NA\subseteq\mathbb N with

∣A∣=n,∣A+A∣=i,∣AA∣=j,|A|=n,\qquad |A+A|=i,\qquad |AA|=j,

and

max⁡A≤2⌊(3n−4)/2⌋.\max A\le 2^{\left\lfloor(3n-4)/2\right\rfloor}.

This conjecture bounds the largest element needed to realize any sum-product pair of cardinality nn. The source motivates the bound from its computational dataset and gives no proof or disproof.

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.