Related papers: Extension of a Method of Gilmer
We discuss the Lieb-Thirring inequality for periodic systems, which has the same optimal constant as the original inequality for finite systems. This allows us to formulate a new conjecture about the value of its best constant. To…
The Union Closed Sets Conjecture states that in every finite, nontrivial set family closed under taking unions there is an element contained in at least half of all the sets of the family. We investigate two new directions with respect to…
A conjecture of Freiman gives an exact formula for the largest volume of a finite set $A$ of integers with given cardinality $k = |A|$ and doubling $T = |2A|$. The formula is known to hold when $T \le 3k-4$, for some small range over $3k-4$…
Mixture distributions arise in many parametric and non-parametric settings -- for example, in Gaussian mixture models and in non-parametric estimation. It is often necessary to compute the entropy of a mixture, but, in most cases, this…
We show that the biggest possible average set size in the complement $2^{\{1,2,\ldots, n\}} \setminus A$ of a union-closed family $A \subset 2^{\{1,2, \ldots, n\}}$ is $\tfrac{n+1}{2}$. With the same proof we get a sharp upper bound for the…
We consider a static self-gravitating charged perfect fluid system in the Einstein-Maxwell theory. Assume Maxwell's equation and the Einstein constraint equation are satisfied, and the temperature of the fluid obeys Tolman's law. Then we…
In this paper we consider a generalization of the well-known budgeted maximum coverage problem. We are given a ground set of elements and a set of bins. The goal is to find a subset of elements along with an associated set of bins, such…
We prove an asymptotically tight bound (asymptotic with respect to the number of polynomials for fixed degrees and number of variables) on the number of semi-algebraically connected components of the realizations of all realizable sign…
The phenomenon of entropy concentration provides strong support for the maximum entropy method, MaxEnt, for inferring a probability vector from information in the form of constraints. Here we extend this phenomenon, in a discrete setting,…
In 1974, Erd\H{o}s and Kleitman conjectured that if a family $\mathcal{F}\subseteq 2^{[n]}$ contains no matching of size \(s\) and is maximal with respect to this property, then $ |\mathcal{F}|\ge \left(1-2^{-(s-1)}\right)\cdot 2^{n}. $ For…
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…
Let $(R, m)$ be a $d$-dimensional Cohen-Macaulay local ring. In this note we prove, in a very elementary way, an upper bound of the first normalized Hilbert coefficient of a $m$-primary ideal $I\subset R$ that improves all known upper…
One of the most famous conjectures in combinatorial optimization is the four-thirds conjecture, which states that the integrality gap of the subtour LP relaxation of the TSP is equal to $\frac43$. For 40 years, the best known upper bound…
The maximum entropy principle is a powerful tool for solving underdetermined inverse problems. This paper considers the problem of discretizing a continuous distribution, which arises in various applied fields. We obtain the approximating…
Shearer's inequality bounds the sum of joint entropies of random variables in terms of the total joint entropy. We give another lower bound for the same sum in terms of the individual entropies when the variables are functions of…
The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…
The third-order Jeffery-Hamel ODE governing the flow of an incompressible fluid in a two-dimensional wedge is briefly derived, and a C^1 finite element formulation of the equation is developed. This formulation has several advantages,…
The notions of fair measure and fair entropy were introduced by Misiurewicz and Rodrigues recently, and discussed in detail for piecewise monotone interval maps. In particular, they showed that the fair entropy $h(a)$ of the tent map $f_a$,…
Extending results of Linial (1984) and Aigner (1985), we prove a uniform lower bound on the balance constant of a poset $P$ of width $2$. This constant is defined as $\delta(P) = \max_{(x, y)\in P^2}\min\{\mathbb{P}(x\prec y),…
Let S $\subseteq$ N be a numerical semigroup with multiplicity m = min(S \ {0}), conductor c = max(N \ S) + 1 and minimally generated by e elements. Let L be the set of elements of S which are smaller than c. Wilf conjectured in 1978 that…