Related papers: Lower bounds for contingency tables via Lorentzian…
In many high-dimensional problems,polynomial-time algorithms fall short of achieving the statistical limits attainable without computational constraints. A powerful approach to probe the limits of polynomial-time algorithms is to study the…
We explicitly find lower bounds on the volume of threefolds and fourfolds of general type in order to have nonvanishing of pluricanonical systems and birationality of pluricanonical maps. In the case of threefolds of large volume, we also…
We establish a version of the Pommerenke-Levin-Yoccoz inequality for the modulus of a polynomial-like restriction of a global polynomial and give two applications. First it is shown that if the modulus of a polynomial-like restriction of an…
We present a branch-and-bound algorithm to improve the lower bounds obtained by SONC/SAGE. The running time is fixed-parameter tractable in the number of variables. Furthermore, we describe a new heuristic to obtain a candidate for the…
The multivariate central limit theorems (CLT) for the volumes of excursion sets of stationary quasi-associated random fields on $\mathbb{R}^d$ are proved. Special attention is paid to Gaussian and shot noise fields. Formulae for the…
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…
The aim of this paper is to obtain an asymptotic expansion for ergodic integrals of translation flows on flat surfaces of higher genus (Theorem 1) and to give a limit theorem for these flows (Theorem 2).
We introduce different notions of polynomial convexity with bounds on degrees of polynomials in $\mathbb C^n$. We provide some examples in higher dimensions and show necessary and sufficient conditions for polynomial convexity with degree…
Poonen and Slavov recently developed a novel approach to Bertini irreducibility theorems over an arbitrary field, based on random hyperplane slicing. In this paper, we extend their work by proving an analogous bound for the dimension of the…
The aim of this paper is to obtain an asymptotic expansion for ergodic integrals of translation flows on flat surfaces of higher genus (Theorem 1) and to give a limit theorem for these flows (Theorem 2).
Determining the number of embeddings of Laman graph frameworks is an open problem which corresponds to understanding the solutions of the resulting systems of equations. In this paper we investigate the bounds which can be obtained from the…
We study the obstruction degrees of translates of sub-tori of multiplicative tori and we show how they are connected to lower bounds for the essential minimum of these varieties. In particular, we combine our computations with results of A.…
The standard coherence criterion for lower previsions is expressed using an infinite number of linear constraints. For lower previsions that are essentially defined on some finite set of gambles on a finite possibility space, we present a…
A classic theorem of Kazhdan and Margulis states that for any semisimple Lie group without compact factors, there is a positive lower bound on the covolume of lattices. H. C. Wang's subsequent quantitative analysis showed that the…
By use of H. C. Wang's bound on the radius of a ball embedded in the fundamental domain of a lattice of a semisimple Lie group, we construct an explicit lower bound for the volume of a quaternionic hyperbolic orbifold that depends only on…
A regularity lemma for polynomials provides a decomposition in terms of a bounded number of approximately independent polynomials. Such regularity lemmas play an important role in numerous results, yet suffer from the familiar shortcoming…
We prove matching asymptotic lower and upper bounds on the variances of the intrinsic volumes and the number of $k$-faces of $d$-dimensional random beta-polytopes. Using Stein's methods, we establish central limit theorems for the intrinsic…
A new lower bound for the maximal length of a multivector is obtained. It is much closer to the best known upper bound than previously reported lower bound estimates. The maximal length appears to be unexpectedly large for $n$-vectors, with…
We prove new estimates for the volume of a Lorentzian manifold and show especially that cosmological spacetimes with crushing singularities have finite volume.
This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…