相关论文: Almost sure lower bounds for a model problem for m…
The celebrated result of Kabanets and Impagliazzo (Computational Complexity, 2004) showed that PIT algorithms imply circuit lower bounds, and vice versa. Since then it has been a major challenge to understand the precise connections between…
For a sequence of independent identically distributed random variables having a distribution function with an unknown parameter from a set $\Theta \subset \mathbf{R}^d$, we prove an analogue of the lower bound of Bahadur asymptotic…
Harper's Theorem states that, in a hypercube, among all sets of a given fixed size the Hamming balls have minimal closed neighbourhoods. In this paper we prove a stability-like result for Harper's Theorem: if the closed neighbourhood of a…
This work falls within the theory of linear forms in logarithms over a commutative linear group defined over a number field. We give lower bounds for simultaneous linear forms in logarithms of algebraic numbers, treating both the…
The proof of Toda's celebrated theorem that the polynomial hierarchy is contained in $\P^{# P}$ relies on the fact that, under mild technical conditions on the complexity class $C$, we have $\exists C \subset BP \cdot \oplus C$. More…
A criterion is given for studying (explicit) Baker type lower bounds of linear forms in numbers $1,\Theta_1,...,\Theta_m\in\mathbb{C}^*$ over the ring $\mathbb{Z}_{\mathbb{I}}$ of an imaginary quadratic field $\mathbb{I}$. This work deals…
We provide a new construction for a set of boxes approximating axis-parallel boxes of fixed volume in $[0, 1]^d$. This improves upper bounds for the minimal dispersion of a point set in the unit cube and its inverse in both the periodic and…
It is well-known that an algorithm exists which approximates the NP-complete problem of Set Cover within a factor of ln(n), and it was recently proven that this approximation ratio is optimal unless P = NP. This optimality result is the…
Recently Alan D. Sokal gave a very short and completely elementary proof of the uniform boundedness principle. The aim of this note is to point out that by using a similiar technique one can give a considerably short and simple proof of a…
We consider the problem of efficiently simulating random quantum states and random unitary operators, in a manner which is convincing to unbounded adversaries with black-box oracle access. This problem has previously only been considered…
We present some streamlined proofs of some of the basic results in Aubry-Mather theory (existence of quasi-periodic minimizers, multiplicity results when there are gaps among minimizers) based on the study of hull functions. We present…
We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of adversary method, by analyzing the eigenspace structure of the problem. Using the new method, we prove a strong direct product…
We present connections between the recent literature on multigroup fairness for prediction algorithms and classical results in computational complexity. Multiaccurate predictors are correct in expectation on each member of an arbitrary…
We study the total mass of high points in a random model for the Riemann-Zeta function. We consider the same model as in [8], [2], and build on the convergence to 'Gaussian' multiplicative chaos proved in [14]. We show that the total mass…
We revisit the Kahn-Kalai conjecture, recently proved in striking fashion by Park and Pham, and present a slightly reformulated simple proof which has a few advantages: (1) it works for non-uniform product measures, (2) it gives…
It is desirable that a given continued fraction algorithm is simple in the sense that the possible representations can be characterized in an easy way. In this context the so-called finite range condition plays a prominent role. We show…
Generalized empirical likelihood and generalized method of moments are well spread methods of resolution of inverse problems in econometrics. Each method defines a specific semiparametric model for which it is possible to calculate…
In this note we would like to give an explicit lower bound by using a lower saturated subset of \mathbb{R}_{\geq 0}^n.
Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of stability. Examples can be found in areas as diverse as voting theory,…
The aim of this note is to present a self-contained proof of the fact that a function can be approximated using a linear combination of Gaussian coherent states, with a number of terms controlled in terms of the smoothness and of the decay…