English
Related papers

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

200 papers

We show how to effectively solve 5-term $S$-unit equations when the set of primes $S$ has cardinality at most 3, and use this to provide an explicit answer to an old question of D.J. Newman on representations of integers as sums of…

Number Theory · Mathematics 2023-08-11 Prajeet Bajpai , Michael A. Bennett

Entropic uncertainty relations in a finite dimensional Hilbert space are investigated. Making use of the majorization technique we derive explicit lower bounds for the sum of R\'enyi entropies describing probability distributions associated…

Quantum Physics · Physics 2015-11-20 Zbigniew Puchała , Łukasz Rudnicki , Karol Życzkowski

Chang's lemma is a useful tool in additive combinatorics and the analysis of Boolean functions. Here we give an elementary proof using entropy. The constant we obtain is tight, and we give a slight improvement in the case where the…

Computational Complexity · Computer Science 2012-05-17 Russell Impagliazzo , Cristopher Moore , Alexander Russell

The method of maximum entropy has been very successful but there are cases where it has either failed or led to paradoxes that have cast doubt on its general legitimacy. My more optimistic assessment is that such failures and paradoxes…

Data Analysis, Statistics and Probability · Physics 2015-06-12 Ariel Caticha

We study properties of popular near-uniform (Dirichlet) priors for learning undersampled probability distributions on discrete nonmetric spaces and show that they lead to disastrous results. However, an Occam-style phase space argument…

Data Analysis, Statistics and Probability · Physics 2007-05-23 Ilya Nemenman , Fariel Shafee , William Bialek

This paper is concerned with the approximation of the compressible Euler equations supplemented with an arbitrary or tabulated equation of state. The proposed approximation technique is robust, formally second-order accurate in space,…

Numerical Analysis · Mathematics 2023-02-22 Bennett Clayton , Jean-Luc Guermond , Matthias Maier , Bojan Popov , Eric J. Tovar

The classical problem of maximizing the Shannon entropy of a sum of independent random variables supported on a finite alphabet is considered and settled in the ternary case. Namely, the following theorem is established: if…

Information Theory · Computer Science 2026-05-13 Mladen Kovačević

Uncertainty relations for more than two observables have found use in quantum information, though commonly known relations pertain to a pair of observables. We present novel uncertainty and certainty relations of state-independent form for…

Quantum Physics · Physics 2013-08-19 Alexey E. Rastegin

In this paper, we propose a novel development in the context of entropy stable finite-volume/finite-difference schemes. In the first part, we focus on the construction of high-order entropy conservative fluxes. Already in [LMR2002], the…

Numerical Analysis · Mathematics 2022-11-03 Simon-Christian Klein , Philipp Öffner

We improve the known upper bound for short exponential sums and increase the range on which a sharp upper bound is known.

Number Theory · Mathematics 2012-01-13 Anne-Maria Ernvall-Hytönen

This paper concerns the estimation of sums of functions of observable and unobservable variables. Lower bounds for the asymptotic variance and a convolution theorem are derived in general finite- and infinite-dimensional models. An explicit…

Statistics Theory · Mathematics 2007-06-13 Cun-Hui Zhang

A novel, non-trivial, probabilistic upper bound on the entropy of an unknown one-dimensional distribution, given the support of the distribution and a sample from that distribution, is presented. No knowledge beyond the support of the…

Information Theory · Computer Science 2007-07-13 Joseph DeStefano , Erik Learned-Miller

Let $\{a_1, . . . , a_n\}$ be a set of positive integers with $a_1 < \dots < a_n$ such that all $2^n$ subset sums are distinct. A famous conjecture by Erd\H{o}s states that $a_n>c\cdot 2^n$ for some constant $c$, while the best result known…

Combinatorics · Mathematics 2022-10-31 Simone Costa , Marco Dalai , Stefano Della Fiore

In this paper, we will use the entropy approach to derive a necessary and sufficient condition for the existence of an element that belongs to at least half of the sets in a finite family of sets.

Combinatorics · Mathematics 2024-12-30 Veronica Phan

In the classical best arm identification (Best-$1$-Arm) problem, we are given $n$ stochastic bandit arms, each associated with a reward distribution with an unknown mean. We would like to identify the arm with the largest mean with…

Machine Learning · Computer Science 2017-05-25 Lijie Chen , Jian Li , Mingda Qiao

Entropy serves as a central observable which indicates uncertainty in many chemical, thermodynamical, biological and ecological systems, and the principle of the maximum entropy (MaxEnt) is widely supported in natural science. Recently,…

Physics and Society · Physics 2015-06-03 Bin Xu , Hongen Zhang , Zhijian Wang , Jianbo Zhang

A novel approach for the stabilization of the Discontinuous Galerkin method based on the Dafermos entropy rate crition is presented. First, estimates for the maximal possible entropy dissipation rate of a weak solution are derived. Second,…

Numerical Analysis · Mathematics 2023-06-09 Simon-Christian Klein

When an expert operates a perilous dynamic system, ideal constraint information is tacitly contained in their demonstrated trajectories and controls. The likelihood of these demonstrations can be computed, given the system dynamics and task…

Systems and Control · Electrical Eng. & Systems 2021-02-26 David L. McPherson , Kaylene C. Stocking , S. Shankar Sastry

We present a new class of estimators of Shannon entropy for severely undersampled discrete distributions. It is based on a generalization of an estimator proposed by T. Schuermann, which itself is a generalization of an estimator proposed…

Information Theory · Computer Science 2021-11-30 Peter Grassberger

An open problem that is widely regarded as one of the most important in quantum query complexity is to resolve the quantum query complexity of the k-distinctness function on inputs of size N. While the case of k=2 (also called Element…

Quantum Physics · Physics 2023-03-15 Nikhil S. Mande , Justin Thaler , Shuchen Zhu