Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Consider a two-way 2×2×2 relay network with two multiple-antenna relays having N_1 and N_2 antennas, respectively, and four single-antenna transceivers. Let DoF_C denote the total degrees of freedom when the relays use caching. General DoF…
Let (X,Y) be a spin synchronization model on a graph G, let u ∈ V(G), and let W ⊂ V(G). Let I denote either the Chi-squared mutual information I_2 or the Kullback–Leibler mutual information I_KL. Mutual-information subadditivity…
Let a broadcast relay channel with common relay have input alphabets represented by X,X_1,X_2 and output alphabets Y_1,Z_1,Y_2,Z_2. In the degraded case, the channel satisfies the Markov chains X mathbin-mkern-6mu∘mkern-6mu- (X_1,Z_1)…
Let X and Y be independent random variables with ultra-log-concave (ULC) probability mass functions on Z_+. Let T_α X denote thinning of X with parameter α, let cal E(t)=H(Poisson(t)), and define V(X)=cal E^-1(H(X)). Thinned entropy power…
Let k>r≥ 1 be integers. Define the entropy polynomial h_k,r(x):=∑_j=0^k-1x^rj∑_v=0^jfrac(-1)^j-vv+1binomrv+kkbinomkj-v. Let α_k satisfy α_k=(1+α_k)^1-k, and define p_k,r(x):=α_k/rk(1-x^r)^k h_k,k(x)-r(1-x^k)^k h_k,r(x). The entropy…
Let V_n,k,P denote the empirical relative entropy statistic for a multinomial distribution with sample size n, alphabet size k, and distribution P. For θ≥ 0, write θ=ε. Concentration conjecture. There are positive constants c_1 and c_2…
Let (G_1,G_2)~ ρ-SBM(K,vecn,b,Λ), with K and Λ fixed in n, and let σ be uniformly distributed on Π(n). Relative information-loss conjecture. If ρ=o(√log n/n), then fracI(G_1;G_2)-I(G_1;σ(G_2))I(G_1;G_2)=Θ(1). This conjectures that below…
Let (X,Y) be jointly Gaussian with X,Y~N(0,1) and correlation coefficient ρ∈(0,1). The exact common information of (X,Y) is conjectured to satisfy C_exact(X;Y)=1/2log1+ρ/1-ρ+ρ/1+ρ, where C_exact(X;Y) denotes the minimum common-randomness…
Let L and s be the parameters of the sliding secure symmetric multilevel diversity coding problem, let X_α denote the source associated with level α, and let H(X_α) be its entropy. For L<2s, the sum-rate bound is said to be inactive when…
Let X~Unif(H^n) and let Y be obtained by passing each bit of X through a binary symmetric channel with correlation parameter ρ. Let f:H^n↦H be Boolean, and define the noise operator by (T_ρ f)(y)=E[f(X)|Y=y]. The Hellinger conjecture.…
Let n be fixed. For a partition of the symmetric group S_n into m parts, let F(n,m) denote the maximum attainable sum of intensities, and define f(m)=F(n,m). Concavity conjecture. For any fixed n, the function f(m)=F(n,m) is concave. The…
Let underlineX be the input random vector and let underlineX_ M_i denote the model random vector obtained after i cascade-tree stages. Write D(f_underlineX(underlinex) || f_underlineX_ M_i(underlinex)) for the Kullback–Leibler divergence…
Let α,λ∈R_+, let f_α(a,b,λ) be the objective function defined by the distributed detection model, and let a_α^* and b_α^* be maximizing vectors. Suppose that the second training sequence Y_2^N is pre-processed by a single channel V∈V_I.…
Let X_1,…,X_N be observations from a centered stationary Gaussian process with spectral density f belonging to a Sobolev-type class F_s, and let the observations be released through an α-locally differentially private mechanism, possibly…
Let X be a random variable with values in N_0, let λ be the Poisson parameter, and let C_k^λ denote the Poisson–Charlier polynomial of order k∈N. Write D(XVertPo(λ)) for the divergence from the Poisson distribution with parameter λ.…
Consider the (0,R_L,R_M)-setup, with rates R_L and R_M, blocklength parameter n, and channel parameters M, L, and α, where L≤ M/2. The rate inequalities include MR_L+2(M-L)R_M≤ M(M-L)(max(1,α)+max(1-α,0))n. Outer-bound conjecture. For the…
Let n and p be the parameters of the binomial and hypergeometric distributions considered in Theorem , and suppose that the theorem is currently stated under the condition that np is an integer. **Extension conjecture.** Theorem should…
Let T_a,b,d be the trapezoid model in the simplex described above, with parameters a, b, and d, and let D(T_a,b,d) denote its maximum divergence. Trapezoid-model divergence conjecture. The divergence from the trapezoid model T_a,b,d is at…
Let bfΣ_1 and bfΣ_2 denote the channel covariance matrices, let ρ be the signal-to-noise ratio, and let α^⋆(ρ) and β^⋆(ρ) maximize E[R_1]+E[R_2] subject to the candidate beamforming vectors bf w_1, sf cand(ρ) and bf w_2, sf cand(ρ). Write…
For a broadcast channel, define T_α(X):=max_p(u,v| x)α I(U;Y)+I(V;Z)-I(U;V), α≥1. For a product channel define T_α(X_1,X_2) analogously, and let C[f(X)] be the upper concave envelope of f at p(x). Put barλ=1-λ. Generalized factorization…