ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let WnW_n be the row-weight random variables, assume that the sequence (Wn)(W_n) is uniformly bounded, and suppose

P[Wn≥3]=1\mathbb{P}[W_n\geq 3]=1

for every nn. Let TnT_n denote the rank deficiency and let α ⁣‾ ρ\underline{\alpha\mkern-4mu}\mkern4mu_\rho be the upper threshold defined in the paper. Sharp threshold conjecture. The normalized rank deficiency converges in probability to this threshold:

Tnn→Pα ⁣‾ ρ\frac{T_n}{n}\xrightarrow{\mathbb{P}}\underline{\alpha\mkern-4mu}\mkern4mu_\rho

as n→∞n\to\infty. The preceding theorem proves matching lower and upper bounds up to the currently available threshold estimates, and the conjecture asserts that the upper bound is sharp; the asymptotics of Tn/nT_n/n remain open in this setting.

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.