ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a positive integer nn, consider all ways of splitting {1,2,…,2n}\{1,2,\dots,2n\} into two complementary sets A={a1,…,an}A=\{a_1,\dots,a_n\} and B={b1,…,bn}B=\{b_1,\dots,b_n\}, i.e. A∩B=∅A\cap B=\varnothing, A∪B={1,2,…,2n}A\cup B=\{1,2,\dots,2n\}, and ∣A∣=∣B∣=n|A|=|B|=n. For such a splitting and an integer kk with −2n≤k≤2n-2n\le k\le 2n, let

Mk(A,B):=#{(i,j)∈{1,…,n}2: ai−bj=k}M_k(A,B):=\#\{(i,j)\in\{1,\dots,n\}^2:\ a_i-b_j=k\}

be the number of representations of kk as a difference of an element of AA and an element of BB, and put

M(n):=min⁡A,B max⁡−2n≤k≤2nMk(A,B),M(n):=\min_{A,B}\ \max_{-2n\le k\le 2n} M_k(A,B),

the minimum taken over all such splittings of {1,2,…,2n}\{1,2,\dots,2n\}.

Determine the asymptotic size of M(n)M(n) as n→∞n\to\infty: exhibit a constant cc and prove that M(n)=cn+o(n)M(n)=cn+o(n), i.e. determine

lim inf⁡n→∞M(n)nandlim sup⁡n→∞M(n)n,\liminf_{n\to\infty}\frac{M(n)}{n}\qquad\text{and}\qquad \limsup_{n\to\infty}\frac{M(n)}{n},

and show that these two quantities coincide.

Record

Added
Links

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.