Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let T denote the time horizon, and let Rent_t be the rent at time t. Suppose the cumulative-rent bound of Theorem~ is ∑_t≤ TRent_t=tilde O(log T). Unconditional logarithmic rent conjecture. The bound continues to hold when (L2)--(L4) are…
Let h_α denote the binary conditional Rényi-entropy function and let * denote binary convolution. There exists a value 1<hatα<1.3863 such that h_α(h_α^-1(x)* h_α^-1(y)) is convex for 0<α<hatα and concave for α≥2. This conjecture is based…
Let p be the number of graphs, let π^* be the underlying permutation tuple, and let ov(hatπ,π^*) denote their overlap. In the Erdős–Rényi model, with parameters λ and s, assume λ s(1-(1-s)^p-1)>1. Feasibility conjecture. Partial alignment…
Let A and B be independent identically distributed samples from a distribution supported on a family of subsets of [n]. Write H(A) for the entropy of A, and D(A∪ Bmathbin|A) for the Kullback–Leibler divergence between the distributions of…
Let p satisfy 1/2≤ p≤ 1, and let q_00,q_01,q_10,q_11≥ 0 satisfy q_00+q_01+q_10+q_11=1. Bucketing-code exponent inequality. The following inequality should hold: 2p[q_00lnfrac2q_00p+q_01lnfrac2q_011-p+q_10lnfrac2q_101-p+q_11lnfrac2q_11p] ≥…
Given arbitrary nonempty families of finite-dimensional quantum channels N_0 and N_1, characterize the optimal asymptotic Stein exponent for discriminating the hypotheses N_0 versus N_1 under each admissible tester--jammer information…
Let X^n=(X_1,…,X_n) be the block of Boolean observations, let Π_n-k(X^n) denote the Boolean threshold function, and suppose the probability distribution satisfies p_1≤ p_2≤…≤ p_n. Optimal first transmission conjecture. In order to compute…
Let Ω^o=(μ,ν)∈(0,1)×(0,1)| ν<μ be the interior of Ω, and let J be the Jacobian defined in Eq.. Negativity conjecture. For every (μ,ν)∈Ω^o, det(J(μ,ν))<0. The claim is supported in the paper by a visualization showing the negative of the…
Let X be a normalized uniformly distributed random vector. For mutually unbiased bases, let m_1,m_2,…,m_k denote the relevant maximum second-moment quantities, and let u_1,u_2,…,u_k denote the corresponding quantities for the comparison…
Let W be a channel and let dec(W) denote its convex decompositions. For λ∈dec(W), write C_11(λ) for the corresponding capacity quantity, underlineIC_11(W) for the lower intrinsic capacity, and Γ_λ(1) and overlineΓ_W(1) for the associated…
Let A be the measurement matrix in the linear system Ax=b. Assume that the entries of A are independent and identically distributed according to an absolutely continuous distribution. Let x be a binary k-sparse solution, and let H denote…
Let η∈(0,1) be an erasure probability, and let BEC(η) denote the binary erasure channel with erasure probability η. Let C_perm denote noisy permutation channel capacity. Capacity conjecture. For any erasure probability η∈(0,1),…
An asymptotically scale-invariant centered MRQ is a family of centered multi-resolution quantizers Q_s_s>0 whose asymptotic distribution function is denoted by overlineF_Q_s_s. Let F_2^Unif[-1,0] denote the distribution function of 2^U for…
Let K be the number of receivers, let E=M_overlineφ,M_overlineK,M_overlineK-1,M_overlineK-1.K be the diamond message set, and let r_S denote the rank associated with a receiver-index set S=l_1l_2… l_N⊆ [1:K]: r_S=rank( H_l_1 ⋮ H_l_N ). The…
Let D^k, k ∈ 13,14,…,25, be a side-information digraph whose sub-digraphs D_i^k,P, i ∈ 1,2,3, have any type of interaction, either fully participated or partially participated, for any P. Let β_t(D^k,P) denote the broadcast rate for t-bit…
Let Q be a non-uniform distribution and U the uniform distribution on a support of cardinality 2^n. Let T be the matrix with two rows, Q and U, and 2^n columns. The quantities D_1/2(Q|U) and C_1/2(T) denote, respectively, Rényi's…
For a binomial experiment with sample size n, success probability p, empirical proportion B/n, and moment-generating-function parameter x∈[0,1), define the binary Kullback–Leibler divergence by…
Let V_ sf can (ρ) and V_ sf kron (ρ) denote the variances of the canonical and Kronecker channel capacities, respectively, and let C_sferg, sf can (ρ) and C_sferg, sf kron (ρ) denote their corresponding ergodic capacities. Here N is the…
Let n≥ 3, let α∈(0,1)∪(1,+∞), and let p∈[0,1/n]. Write boldmath v_n(p) for the probability vector under consideration and H_scriptsize boldmath v_n(p) for its Shannon entropy. Let χ_n(α) denote a possible inflection-point entropy.…
Given four random variables A,B,C,D with a probability distribution, define the Ingleton score by I(A;B|C)+I(A;B|D)+I(C;D)-I(A;B)/H(ABCD). Four-atom conjecture. The lowest possible Ingleton score is approximately -0.089373. It is attained…