Related papers: A tight lower bound on the minimal dispersion

We introduce a new class of lower bounds on the log partition function of a Markov random field which makes use of a reversed Jensen's inequality. In particular, our method approximates the intractable distribution using a linear…

This paper gives a framework to produce the lower bound of eigenvalues defined in a Hilbert space by the eigenvalues defined in another Hilbert space. The method is based on using the max-min principle for the eigenvalue problems.

We obtain new upper and lower bounds on the number of unit perimeter triangles spanned by points in the plane. We also establish improved bounds in the special case where the point set is a section of the integer grid.

We derive and implement a new way to find lower bounds on the smallest limiting trace-to-degree ratio of totally positive algebraic integers and improve the previously best known bound to 1.80203. Our method adds new constraints to Smyth's…

We introduce the notion of minimal inversion sequences for a pattern $\rho$, which form the smallest set of inversion sequences whose avoidance is equivalent to the avoidance of $\rho$ for inversion sequences. We give a characterization of…

In this paper we consider the inference rules of System P in the framework of coherent imprecise probabilistic assessments. Exploiting our algorithms, we propagate the lower and upper probability bounds associated with the conditional…

We establish sufficient conditions for finite convergence of the alternating projections method for two non-intersecting and potentially nonconvex sets. Our results are based on a generalization of the concept of intrinsic transversality,…

We consider on-line density estimation with a parameterized density from the exponential family. The on-line algorithm receives one example at a time and maintains a parameter that is essentially an average of the past examples. After…

In this paper we obtain new lower bounds for the upper box dimension of $\alpha\beta$ sets. As a corollary of our main result, we show that if $\alpha$ is not a Liouville number and $\beta$ is a Liouville number, then the upper box…

This paper proposes an easy-to-compute upper bound for the overlap index between two probability distributions without requiring any knowledge of the distribution models. The computation of our bound is time-efficient and memory-efficient…

This work presents an upper-bound to value that the Kullback-Leibler (KL) divergence can reach for a class of probability distributions called quantum distributions (QD). The aim is to find a distribution $U$ which maximizes the KL…

The paper deals with studying a connection of the Littlewood--Offord problem with estimating the concentration functions of some symmetric infinitely divisible distributions.

A simple method is shown to provide optimal variational bounds on $f$-divergences with possible constraints on relative information extremums. Known results are refined or proved to be optimal as particular cases.

For a finite group we introduce a particular central extension, the unitary cover, having minimal exponent among those satisfying the projective lifting property. We obtain new bounds for the exponent of the Schur multiplier relating to…

In the field of state-of-the-art object detection, the task of object localization is typically accomplished through a dedicated subnet that emphasizes bounding box regression. This subnet traditionally predicts the object's position by…

According to Benford's Law, many data sets have a bias towards lower leading digits (about $30\%$ are $1$'s). The applications of Benford's Law vary: from detecting tax, voter and image fraud to determining the possibility of match-fixing…

Upper bounds for the $L_p$-discrepancies of point distributions in compact metric measure spaces for $0<p\le\infty$ have been established in the paper [6] by Brandolini, Chen, Colzani, Gigante and Travaglini. In the present paper we show…

Let G be a group. We say that G has spread r if for any set of distinct elements {x1,..., xr}\subset G there exists an element y\in G with the property that <xi, y>=G for every 0<i<r+1. Few bounds on the spread of finite simple groups are…

In this paper, two new classes of lower bounds on the probability of error for $m$-ary hypothesis testing are proposed. Computation of the minimum probability of error which is attained by the maximum a-posteriori probability (MAP)…

We compute the minimal exponent of the affine cone over a complete intersection of smooth projective hypersurfaces intersecting transversely. The upper bound for the minimal exponent is proved, more generally, in the weighted homogeneous…