English
Related papers

Related papers: On the Courtade-Kumar conjecture for certain class…

200 papers

We suggest an upper bound on binomial coefficients that holds over the entire parameter range and whose form repeats the form of the de Moivre-Laplace approximation of the symmetric binomial distribution. Using the bound, we estimate the…

Combinatorics · Mathematics 2022-05-17 Sergey Agievich

Tight lower and upper bounds on the ratio of relative entropies of two probability distributions with respect to a common third one are established, where the three distributions are collinear in the standard $(n-1)$-simplex. These bounds…

Information Theory · Computer Science 2018-05-31 Shengtian Yang , Jun Chen

Let $\mathcal{M}$ be a semifinite von Neumann algebra and let $E$ be a symmetric function space on $(0,\infty)$. Denote by $E(\mathcal{M})$ the non-commutative symmetric space of measurable operators affiliated with $\mathcal{M}$ and…

Operator Algebras · Mathematics 2024-12-09 Aleksey Ber , Fedor Sukochev , Dmitriy Zanin , Hongyin Zhao

This paper proposes methods for likelihood-based inference in multivariate linear regressions when the correlation matrix of the responses is separable; that is, it has a Kronecker product structure, but the variances are unrestricted. The…

Computation · Statistics 2026-04-16 Karl Oskar Ekvall

We present an $\tilde{O}(n^{2/3}/\epsilon^2)$-query algorithm that tests whether an unknown Boolean function $f\colon\{0,1\}^n\rightarrow \{0,1\}$ is unate (i.e., every variable is either non-decreasing or non-increasing) or $\epsilon$-far…

Data Structures and Algorithms · Computer Science 2019-04-11 Xi Chen , Erik Waingarten

We give a new proof of the boundedness of bilinear Schur multipliers of second order divided difference functions, as obtained earlier by Potapov, Skripka and Sukochev in their proof of Koplienko's conjecture on the existence of higher…

Classical Analysis and ODEs · Mathematics 2025-01-29 Martijn Caspers , Jesse Reimann

The main result of this paper is an instance of the conjecture made by Gouvea and Mazur (Math. Res. Lett., 1995) which asserts that for certain values of r the space of r-overconvergent p-adic modular forms of tame level N and weight k…

Number Theory · Mathematics 2008-01-21 David Loeffler

We provide a sharp monotonicity theorem about the distribution of subharmonic functions on manifolds, which can be regarded as a new, measure theoretic form of the uncertainty principle. As an illustration of the scope of this result, we…

Classical Analysis and ODEs · Mathematics 2025-11-11 Aleksei Kulikov , Fabio Nicola , Joaquim Ortega-Cerdà , Paolo Tilli

We consider a binary sequence generated by thresholding a hidden continuous sequence. The hidden variables are assumed to have a compound symmetry covariance structure with a single parameter characterizing the common correlation. We study…

Statistics Theory · Mathematics 2019-09-04 Haolei Weng , Yang Feng

Beckner's inequality is a family of inequalities that interpolates the two fundamental functional inequalities, the logarithmic Sobolev and Poincar\'e's inequalities. It is parametrized by exponent $p\in (1,2]$ and it implies the…

Probability · Mathematics 2026-04-22 Yuu Hariya

This manuscript includes some classical results we select apart from the new results we've found on the Analysis of Boolean Functions and Fourier-Entropy-Influence conjecture. We try to ensure the self-completeness of this work so that…

Combinatorics · Mathematics 2023-11-21 Xiao Han

Sarkar and Kumar recently conjectured [J. Phys. A: Math. Theor. $\textbf{52}$, 295203 (2019)] that for a bipartite system of Hilbert dimension $mn$, the mean values of quantum purity and von Neumann entropy of a subsystem of dimension…

Mathematical Physics · Physics 2020-05-27 Lu Wei

The convex conjugate (i.e., the Legendre transform) of Type II error probability (volume) as a function of Type I error probability (volume) is determined for the hypothesis testing problem with randomized detectors. The derivation relies…

Information Theory · Computer Science 2026-01-15 Barış Nakiboğlu

We describe certain extremalities for Gallager's $E_0$ function evaluated under the uniform input distribution for binary input discrete memoryless channels. The results characterize the extremality of the $E_0(\rho)$ curves of the binary…

Information Theory · Computer Science 2013-12-17 Mine Alsan

By using an explicit Bellman function, we prove a bilinear embedding theorem for the Laplacian associated with a weighted Riemannian manifold $(M,\mu_\phi)$ having the Bakry-Emery curvature bounded from below. The embedding, acting on the…

Functional Analysis · Mathematics 2013-06-18 Andrea Carbonaro , Oliver Dragičević

The reliability function of memoryless channels with noiseless feedback and variable-length coding has been found to be a linear function of the average rate in the classic work of Burnashev. In this work we consider unifilar channels with…

Information Theory · Computer Science 2017-07-13 Achilleas Anastasopoulos , Jui Wu

Very recently, E. H. Lieb and J. P. Solovej stated a conjecture about the constant of embedding between two Bergman spaces of the upper-half plane. A question in relation with a Werhl-type entropy inequality for the affine $AX+B$ group.…

Complex Variables · Mathematics 2020-11-10 David Békollè , Jocelyn Gonessa , Benoît F. Sehba

When information is to be transmitted over an unknown, possibly unreliable channel, an erasure option at the decoder is desirable. Using constant-composition random codes, we propose a generalization of Csiszar and Korner's Maximum Mutual…

Information Theory · Computer Science 2016-11-17 Pierre Moulin

We prove that there is no algorithm to decide whether a given integer vector is in the closure of the entropic cone $\overline{\Gamma_{n}^{*}}$. Equivalently, there is no decision procedure to determine whether a given integer-valued…

Combinatorics · Mathematics 2025-09-09 Geva Yashfe

This paper considers the problem of approximating a Boolean function $f$ using another Boolean function from a specified class. Two classes of approximating functions are considered: $k$-juntas, and linear Boolean functions. The $n$ input…

Information Theory · Computer Science 2019-07-09 Mohsen Heidari , S. Sandeep Pradhan , Ramji Venkataramanan