Related papers: On the Courtade-Kumar conjecture for certain class…
We study two conjectures posed in the analysis of Boolean functions $f : \{-1, 1\}^n \to \{-1, 1\}$, in both of which, the Majority function plays a central role: the "Majority is Least Stable" (Benjamini et al., 1999) and the…
Determining the ultimate classical information carrying capacity of electromagnetic waves requires quantum-mechanical analysis to properly account for the bosonic nature of these waves. Recent work has established capacity theorems for…
In Coles-Piani's recent remarkable version of the entropic uncertainty principle, the entropic sum is controlled by the first and second maximum overlaps between the two projective measurements. We generalize the entropic uncertainty…
We develop an effective version of Kronecker's Theorem on the splitting of polynomials, based on asymptotic arguments proposed by the Chudnovsky brothers, coming from Hermite-Pad\'e approximation. In conjunction with Honda's proof of the…
We study the computation complexity of Boolean functions in the quantum black box model. In this model our task is to compute a function $f:\{0,1\}\to\{0,1\}$ on an input $x\in\{0,1\}^n$ that can be accessed by querying the black box.…
Motivated by applications of biometric identification and content identification systems, we consider the problem of random coding for channels, where each codeword undergoes lossy compression (vector quantization), and where the decoder…
A distributed binary hypothesis testing (HT) problem involving two parties, one referred to as the observer and the other as the detector is studied. The observer observes a discrete memoryless source (DMS) and communicates its observations…
We give a proof of the openness conjecture of Demailly and Koll\'ar for positively curved singular metrics on ample line bundles over projective varieties. As a corollary it follows that the openness conjecture for plurisubharmonic…
Let $ m, n $ be integers such that $ \frac{n}{2} > m \geq 1 $ and let $ (M, g) $ be a closed $ n-$dimensional Riemannian manifold. We prove there exists some $ B \in \mathbb{R} $ depending only on $ (M, g) $, $ m $, and $ n $ such that for…
We establish an invertibility criterion for free polynomials and free functions evaluated on some tuples of matrices. We show that if the derivative is nonsingular on some domain closed with respect to direct sums and similarity, the…
In this paper, we will give suitable conditions on differential polynomials $Q(f)$ such that they take every finite non-zero value infinitely often, where $f$ is a meromorphic function in complex plane. These results are related to Problem…
In this note, we develop a bounded-error quantum algorithm that makes $\tilde O(n^{1/4}\varepsilon^{-1/2})$ queries to a Boolean function $f$, accepts a monotone function, and rejects a function that is $\varepsilon$-far from being…
We develop further the consequences of the irreducible-Boolean classification established in Ref. [9]; which have the advantage of allowing strong statistical calculations in disordered Boolean function models, such as the…
In this paper we suggest two statistical hypothesis tests for the regression function of binary classification based on conditional kernel mean embeddings. The regression function is a fundamental object in classification as it determines…
Sensitivity conjecture is a longstanding and fundamental open problem in the area of complexity measures of Boolean functions and decision tree complexity. The conjecture postulates that the maximum sensitivity of a Boolean function is…
What is the value of a single bit to a guesser? We study this problem in a setup where Alice wishes to guess an i.i.d. random vector, and can procure one bit of information from Bob, who observes this vector through a memoryless channel. We…
In "Self-adjoint Operators as Functions I: Lattices, Galois Connections, and the Spectral Order" [arXiv:1208.4724], it was shown that self-adjoint operators affiliated with a von Neumann algebra N can equivalently be described as certain…
We show that Reed-Muller codes achieve capacity under maximum a posteriori bit decoding for transmission over the binary erasure channel for all rates $0 < R < 1$. The proof is generic and applies to other codes with sufficient amount of…
In this paper we consider a discrete-time dynamical system on the real line by random iteration of two functions. These functions are assumed to satisfy appropriate monotonicity conditions; optionally, a symmetry condition may be imposed.…
The Komlos conjecture in discrepancy theory states that for some constant K and for any m by n matrix A whose columns lie in the unit ball there exists a +/- 1 vector x such that the infinity norm of Ax is bounded above by K. This…