Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let R_n be the squared Reed–Muller code matrix and U^n=R_nX^n. Consider an index i that is the last row in a degree layer of R_n, excluding the last layer; then i+1 is the first row in the next layer. Layer-crossing conjecture. H(U_i|…
Let U_k,F_k_k=0^h be the martingale sequence introduced in the subsection, and let Z_2^(m) denote the corresponding refined exponential base and Z_B the Bhattacharyya parameter. Quadratic-convergence conjecture. lim_m → ∞ Z_2^(m) = Z_B and…
Let X^n be uniformly distributed over 0,1 ^n, let Y^n be obtained by passing X^n through a memoryless binary erasure channel with erasure probability ε, and let γ_s(ε) denote the optimal guessing efficiency for moment order s. A Greedy…
Let ρ) be the root of a tree, let u denote the broadcast labeling on its vertices, and consider message-passing algorithms whose messages take values in an alphabet Σ with |Σ|=L, where L>0 is fixed. Reconstruction is the problem of…
Let c_1>0. For a random variable X valued in F_2^m, let X' be an independent copy of X, and let H denote Shannon entropy. For a subspace G≤F_2^m, let U_G be the uniform random variable on G, independent of X. Entropic Marton-type…
Let k be the coalition size, let C_k,2 denote the fingerprinting capacity for two-class symbols, and let p^* and p^∞ be the optimal and interleaving-based attack distributions, respectively. Let p_W^* and p_W^∞ denote the corresponding…
Let a practical multi-user OFDM system have K users and N subcarriers, with the number of subcarriers less than 2,002, and let d_max denote its maximum efficiency. Maximum-efficiency conjecture. The maximum efficiency is d_max=1.4998,…
Consider the three-user semi-symmetric complex Gaussian interference channel Y_1=X_1+g_1X_2+g_2X_3+Z_1, Y_2=X_2+g_1X_3+g_2X_1+Z_2, Y_3=X_3+g_1X_1+g_2X_2+Z_3, where P_k=P for k=1,2,3, and write φ(g_1) and φ(g_2) for the phases of g_1 and…
Let X and X' be independent and identically distributed, discrete, real-valued random variables with finite entropy H(X)<∞. Entropic Solymosi inequality. One has 2H(X+X')+H(XX')≥ (4-o(1))H(X), where o(1) tends to 0 as H(X)→∞. This is the…
Let f be the probability mass function of a Bernoulli sum, and let H_R,q(f) and H_T,q(f) denote its q-Rényi and q-Tsallis entropies, respectively. The parameters satisfy 0≤ q≤∞. Generalized Shepp-Olkin conjecture. There are critical values…
Let X and Y be random variables with distributions P_X and P_Y, and let P_X^n and P_Y^n denote their n-fold product distributions. Let C(P_X,P_Y) be the set of couplings of P_X and P_Y, and let G(P_X,P_Y) denote the maximal guessing…
Let q(y,z| x) be a broadcast channel. Define T(X):=max_p(u,v| x) I(U;Y)+I(V;Z)-I(U;V) and let C[f(X)] denote the upper concave envelope of f at p(x). For a product of two broadcast channels, write T(X_1,X_2) for the analogous quantity with…
Consider the nonlinear input-output system with B input-output training pairs (X_B,Y_B) and its equivalent system, with input vectors x_B+1 and barx and corresponding observations y_B+1 and bary. For each transmitter m, let hatx_B+1,m and…
Let the system be the AWGN channel with noisy feedback described in the paper, with blocklength N, feedback-noise variance σ^2, signal-to-noise parameter γ, power parameter ρ, strictly lower-triangular encoding matrix F, and combining…
Let G be a finite simple undirected graph on n vertices, and let L(G) denote the probability that the uniform sequential attachment process outputs a graph isomorphic to G. The conjecture states that, for every n and every graph G on n…
A Neural Channel is an overparameterized neural network that can approximately preserve its original behavior while storing information that can be received through an efficient reception procedure. A spare subnetwork is a subnetwork…
Let G and H be graphs. For graphs G and H, write [?] for the relative fractional packing number of G with respect to H, and let Expand(H) be the family of graphs obtained from H by repeatedly removing vertices, adding edges, or replacing a…
For the Gaussian problem, let H_i denote the hypothesis with a 15-dimensional observation model, and for the Poisson problem let H_i denote the corresponding 15-dimensional Poisson hypothesis, with a fixed total sensing time T distributed…
Let C be a finite-dimensional convex compact set. A local regret function is a regret function defined locally on C, and a transitive symmetry group is a group of symmetries acting transitively on C. Jordan-algebra representation…
Let k be the coalition size, let L be the number of parallel TV channels, and let C_rm fp^rm binary(k,L) denote the binary fingerprinting capacity in this setting. Assume tildeL=1. Multiple-channel capacity conjecture. The capacity…