English
Related papers

Related papers: Better bounds for the union-closed sets conjecture…

200 papers

We present a new lower bound on the differential entropy rate of stationary processes whose sequences of probability density functions fulfill certain regularity conditions. This bound is obtained by showing that the gap between the…

Information Theory · Computer Science 2017-08-30 Meik Dörpinghaus

We improve the well-known Szemer\'edi-Trotter incidence bound for proper 3--dimensional point sets (defined appropriately)

Combinatorics · Mathematics 2011-09-06 György Elekes

We study universal uncertainty relations and present a method called joint probability distribution diagram to improve the majorization bounds constructed independently in [Phys. Rev. Lett. 111, 230401 (2013)] and [J. Phys. A. 46, 272002…

Quantum Physics · Physics 2016-10-31 Tao Li , Yunlong Xiao , Teng Ma , Shao-Ming Fei , Naihuan Jing , Xianqing Li-Jost , Zhi-Xi Wang

The concept of spectral relative entropy rate is introduced for jointly stationary Gaussian processes. Using classical information-theoretic results, we establish a remarkable connection between time and spectral domain relative entropy…

Optimization and Control · Mathematics 2011-09-30 Augusto Ferrante , Chiara Masiero , Michele Pavon

Every Boolean function can be uniquely represented as a multilinear polynomial. The entropy and the total influence are two ways to measure the concentration of its Fourier coefficients, namely the monomial coefficients in this…

Computational Complexity · Computer Science 2017-11-03 Rani Hod

This is an expository paper aiming to introduce Zilber's Exponential Closedness conjecture to a general audience. Exponential Closedness predicts when (systems of) equations involving addition, multiplication, and exponentiation have…

Complex Variables · Mathematics 2024-10-21 Vahagn Aslanyan , Francesco Gallinaro

We conjecture a new entropic uncertainty principle governing the entropy of complementary observations made on a system given side information in the form of quantum states, generalizing the entropic uncertainty relation of Maassen and…

Quantum Physics · Physics 2009-07-10 Joseph M. Renes , Jean-Christian Boileau

In another related work, U-statistics were used for non-asymptotic "average-case" analysis of random compressed sensing matrices. In this companion paper the same analytical tool is adopted differently - here we perform non-asymptotic…

Information Theory · Computer Science 2015-06-11 Fabian Lim , Vladimir Stojanovic

We consider the insulated conductivity problem with two unit balls as insulating inclusions, a distance of order $\varepsilon$ apart. The solution $u$ represents the electric potential. In dimensions $n \ge 3$ it is an open problem to find…

Analysis of PDEs · Mathematics 2024-12-16 Ben Weinkove

Predictive inference requires balancing statistical accuracy against informational complexity, yet the choice of complexity measure is usually imposed rather than derived. We treat econometric objects as predictive rules, mappings from…

Statistics Theory · Mathematics 2026-02-16 Nicholas G. Polson , Daniel Zantedeschi

The Shannon entropy is a widely used summary statistic, for example, network traffic measurement, anomaly detection, neural computations, spike trains, etc. This study focuses on estimating Shannon entropy of data streams. It is known that…

Data Structures and Algorithms · Computer Science 2009-10-09 Ping Li

We provide experimental validation of tight entropic uncertainty relations for the Shannon entropies of observables with mutually unbiased eigenstates in high dimensions. In particular, we address the cases of dimensions $d = 3$, $4$ and…

We use entropy numbers in combination with the polynomial method to derive a new general lower bound for the n-th minimal error in the quantum setting of information-based complexity. As an application, we improve some lower bounds on…

Quantum Physics · Physics 2007-05-23 Stefan Heinrich

In this paper we improve the best known constant for the discrepancy formulated in the Komlos Conjecture. The result is based on the improvement of the subgaussian bound for the random vector constructed in the Gram-Schmidt Random Walk…

Probability · Mathematics 2024-04-09 Witold Bednorz , Piotr Godlewski

We improve the upper bound for the maximum possible number of stable matchings among $n$ jobs and $n$ applicants from $131072^n+O(1)$ to $3.55^n+O(1)$. To establish this bound, we state a novel formulation of a certain entropy bound that is…

Combinatorics · Mathematics 2021-06-07 Cory Palmer , Dömötör Pálvölgyi

We develop an approximation method for the differential entropy $h(\mathbf{X})$ of a $q$-component Gaussian mixture in $\mathbb{R}^n$. We provide two examples of approximations using our method denoted by…

Information Theory · Computer Science 2025-05-07 Basheer Joudeh , Boris Škorić

An entropy-bounded Discontinuous Galerkin (EBDG) scheme is proposed in which the solution is regularized by constraining the entropy. The resulting scheme is able to stabilize the solution in the vicinity of discontinuities and retains the…

Numerical Analysis · Mathematics 2015-05-20 Yu Lv , Matthias Ihme

We propose a formal expansion of the transfer entropy to put in evidence irreducible sets of variables which provide information for the future state of each assigned target. Multiplets characterized by a large contribution to the expansion…

Quantitative Methods · Quantitative Biology 2015-06-04 S. Stramaglia , Guo-Rong Wu , M. Pellicoro , D. Marinazzo

[Note: Currently the proof is incomplete as we are using the lemma 3.2 which is not true in general]. We offer a complete resolution of a conjecture by Lions-Perthame-Tadmor mentioned in their celebrated work (1994, [34]). We prove the…

Analysis of PDEs · Mathematics 2019-01-03 Shyam Sundar Ghoshal , Animesh Jana

We give a new insight into the upper bounding of the 3-SAT threshold by the first moment method. The best criteria developed so far to select the solutions to be counted discriminate among neighboring solutions on the basis of uniform…

Discrete Mathematics · Computer Science 2010-04-19 Thomas Hugel , Yacine Boufkhad
‹ Prev 1 3 4 5 6 7 10 Next ›