ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be a positive integer and let mm be the input size. Define

cn(m)=∣{(x1,…,xn)∈⟦1;m⟧n∣f(x1,…,xn)=x1}∣,c_n(m)=\left|\left\{(x_1,\dots,x_n)\in\llbracket 1;m\rrbracket^n\mid f(x_1,\dots,x_n)=x_1\right\}\right|,

where ff is the auction-output function. Asymptotic form conjecture for cnc_n. There exists a positive rational number an∈Qa_n\in\mathbb{Q} such that

cn(m)=an⋅mn+O(mn−1).c_n(m)=a_n\cdot m^n+\mathcal{O}(m^{n-1}).

This conjecture gives a leading-term description of the number of input tuples for which the auction output equals the targeted input. Empirical interpolation for several values of nn supports the conjecture, with the observed leading coefficients close to 1/n1/n, but the general assertion remains open.

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.