Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let X^n=(X_1,5e5c,5e5c,X_n) have independent coordinates distributed as Bernoulli(p), with 0<p<tfrac12, and let distortion be normalized Hamming distortion. Define R_lin,p(D) as the infimum of the asymptotic rates limsup_n→∞m_n/n over…
Let X be a source alphabet with |X|=2, consisting of symbols x_1 and x_2, with probabilities p(x_1) and p(x_2). Let β_T, β_0, R_min^*, R_[x_1,x_2], and F denote the quantities defined in the paper, and let Δ be the set of four codes…
Let k be the alphabet size of the channel input, and let l_s be the alphabet size of the code for User 2 in a permutation encoding approach. For an input-symmetric degraded broadcast channel, let G_T_YX,T_ZX denote the relevant family of…
Let υ,υ_2,υ_3,… be the weighted-average ITV family defined in the source, and let the row-column-type transformations be the transformations on the transition parameters described there. The row-column dependence conjecture. Theorem holds…
Let Δ^1 denote the one-dimensional probability simplex, and let O_f be the Dueck zero-error capacity region of the binary adder channel with complete feedback. For (c_1,c_2)∈Δ^1, define R(O_f;c_1,c_2):=supc_1R_1+c_2R_2:(R_1,R_2)∈O_f. For…
Fix alpha>0. Let X_1,X_2,W,W_2 be mutually independent, with W~ N(0,1), W_2~ N(0,1-α^2), and X_1,X_2 arbitrary random variables satisfying Var(X_1)=P_1, Var(X_2)=P_2. Define Y_1=X_1+W, Y_0=α Y_1+W_2, Y_2=Y_0+X_2. Auxiliary-variable…
Let X be a finite alphabet with |X|>2. For an information-distillation function ID_M(|X|,β), where M is the number of quantization levels and β is the mutual-information scale, the conjecture concerns maintaining a fraction η(|X|) of that…
Fix a positive integer r≥ 3. For each n>r, let C_n,r be the circular r-uniform hypergraph on n vertices whose edges are all paths of size r in a cycle, and let X_C_n,r count the vertices with non-zero in-degree after independent uniform…
Let G be a finite, simple, undirected, connected graph of order n. A mouse moves along the graph, and a cat probes vertices, receiving relative-distance information that determines the possible mouse positions. The cat can localize the…
Let X be a random variable such that tlongmapsto I(X,t) is infinitely differentiable. Completely monotone conjecture. The function tlongmapsto I(X,t) is completely monotonous, that is (-1)^n∂_t^n I(X,t)≥ 0 for every t>0 and non-negative…
Let N(n,3,t) denote the sequence reconstruction number for length-n sequences over a binary deletion channel with three deletions and trace length parameter t, and let D(n,t) denote the associated quantity used in the paper. Proposed…
Let B_1,…,B_n be independent Bernoulli random variables with parameters p_1,…,p_n∈[0,1], let S=∑_i=1^n B_i, and write P_k(p)=P_p(S=k). Determine the orders q>0 for which, for every n, the Rényi entropy H_q^R(S)=1/1-qlog (∑_k P_k(p)^q) and…
Let p∈[0,1] be the bias parameter, let c be the collusion size, and let Pr[Y=1| P=p] denote the output-one probability under the worst collusion attack. For the Tardos pdf f(p)=frac√p(1-p)π, define q^conv(p)=frac2arcsin(√p)π. Tardos…
The paper considers a binary symmetric channel with crossover probability p<1/2, message size M=2^k, and error tolerance 0<ε<1/2. Let C denote the channel capacity, let C_1 denote the relevant confirmation-phase constant, and let τ_ε be…
Let P_Z|X be a strictly positive discrete memoryless channel (DMC), let hatP_X_1^n and hatP_Y_1^n denote the empirical distributions of the input and output sequences, and let P_X^n denote the set of probability distributions on X^n. Write…
Let (R_1,R_2) be a rate pair in the capacity region of a two-user Gaussian interference channel with arbitrary positive cross-link gains a_12 and a_21 and power constraints P_1 and P_2. Define the single-user additive white Gaussian noise…
Let p(y(i),s(i+1)| x(i),s(i)) be a state-dependent channel with finite input and output alphabets satisfying | X|=| Y|<∞. For a channel with memory, let C_0 denote its zero-error capacity, let C_0^m denote the zero-error capacity of the…
Let Z_F be constructed from the non-trivial zeta zeros, and consider orderings of those zeros, including the standard ordering by increasing imaginary part. Canonical Ordering conjecture. The standard ordering by increasing imaginary part…
For every integer n≥ 1, energy E>0, and noise standard deviation σ>0, let x_0,…,x_n∈R^n satisfy lVert x_irVert^2=E for all i, and let the signals have equal prior probabilities and be transmitted over an additive white Gaussian noise…
Let U denote unexpectedness in Simplicity Theory, with causal or generative complexity describing the world and description complexity describing the observer. Let generative entropy refer to the entropy associated with the world’s causal…