Related papers: Near-tight closure bounds for Littlestone and thre…

In the noisy query model, the (binary) return value of every query (possibly repeated) is independently flipped with some fixed probability $p \in (0, 1/2)$. In this paper, we obtain tight bounds on the noisy query complexity of several…

In a recent paper [7], we were led to consider a distance over a bounded open convex domain. It turns out to be the so-called Thompson metric, which is equivalent to the Hilbert metric. It plays a key role in the analysis of existence and…

We prove bounds for the number of solutions to $$a_1 + \dots + a_k = a_1' + \dots + a_k'$$ over $N$-element sets of reals, which are sufficiently convex or near-convex. A near-convex set will be the image of a set with small additive…

This is the first paper in a sequence on Krull dimension for limit groups, answering a question of Z. Sela. In this paper we show that strict resolutions of a fixed limit group have uniformly bounded length. The upper bound plays two roles…

We study a summability method called almost convergence for bounded measurable functions defined on a locally compact abelian group. We define almost convergence using topologically invariant means and exhibit two different kinds of…

The Riesz-Sobolev inequality provides an upper bound for a trilinear expression involving convolution of indicator functions of sets. It is known that equality holds only for homothetic ordered triples of appropriately situated ellipsoids.…

Consider all the level sets of a real function. We can group these level sets according to their Hausdorff dimensions. We show that the Hausdorff dimension of the collection of all level sets of a given Hausdorff dimension can be…

It is shown that the counting function of n Boolean variables can be implemented with the formulae of size O(n^3.06) over the basis of all 2-input Boolean functions and of size O(n^4.54) over the standard basis. The same bounds follow for…

The union-closed sets conjecture states that in any nonempty union-closed family $\mathcal{F}$ of subsets of a finite set, there exists an element contained in at least a proportion $1/2$ of the sets of $\mathcal{F}$. Using the…

We study the proximity of the optimal value of the m-dimensional knapsack problem to the optimal value of that problem with the additional restriction that only one type of items is allowed to include in the solution. We derive exact and…

In this note, we frst consider boundedness properties of a family of operators generalizing the Hilbert operator in the upper triangle case. In the diagonal case, we give the exact norm of these operators under some restrictions on the…

We construct a family of functions suitable for establishing lower bounds on the oracle complexity of first-order minimization of smooth strongly-convex functions. Based on this construction, we derive new lower bounds on the complexity of…

In this work, optimal rigidity results for eigenvalues on K\"ahler manifolds with positive Ricci lower bound are established. More precisely, for those K\"ahler manifolds whose first eigenvalue agrees with the Ricci lower bound, we show…

While useful probability bounds for $n$ pairwise independent Bernoulli random variables adding up to at least an integer $k$ have been proposed in the literature, none of these bounds are tight in general. In this paper, we provide several…

We develop a geometric and explicit construction principle that generates classes of Poincare-Einstein manifolds, and more generally almost Einstein manifolds. Almost Einstein manifolds satisfy a generalisation of the Einstein condition;…

We investigate the sample complexity of networks with bounds on the magnitude of its weights. In particular, we consider the class \[ H=\left\{W_t\circ\rho\circ \ldots\circ\rho\circ W_{1} :W_1,\ldots,W_{t-1}\in M_{d, d}, W_t\in…

We prove polynomial upper and lower bounds on the expected size of the maximum agreement subtree of two random binary phylogenetic trees under both the uniform distribution and Yule-Harding distribution. This positively answers a question…

We show that the correction terms in Heegaard Floer homology give a lower bound to the the genus of one-sided Heegaard splittings and the $\mathbb Z_2$--Thurston norm. Using a result of Jaco--Rubinstein--Tillmann, this gives a lower bound…

We generalize the classical Bernstein theorem concerning the constructive description of classes of functions uniformly continuous on the real line. The approximation of continuous bounded functions by entire functions of exponential type…

The sensitivity of a Boolean function f is the maximum over all inputs x, of the number of sensitive coordinates of x. The well-known sensitivity conjecture of Nisan (see also Nisan and Szegedy) states that every sensitivity-s Boolean…