Related papers: Counting multiplicative approximations
A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorithm up to a universal multiplicative factor related to the…
Let E be an elliptic curve over Q. In 1988, Koblitz conjectured a precise asymptotic for the number of primes p up to x such that the order of the group of points of E over the finite field F_p is prime. This is an analogue of the Hardy and…
Lazarsfeld and Mustata propose general and systematic usage of Okounkov's idea in order to study asymptotic behavior of linear series on an algebraic variety. It is a very simple way, but it yields a lot of consequences, like Fujita's…
The investigation of regularity/summability properties of the coefficients of bilinear forms in sequence spaces was initiated by Littlewood in $1930$. Nowadays, this topic has important connections with other fields of Pure and Applied…
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…
We prove versions of Khintchine's Theorem (1924) for approximations by rational numbers whose numerators lie in randomly chosen sets of integers, and we explore the extent to which the monotonicity assumption can be removed. Roughly…
Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…
This paper studies explicit and theoretical bounds for several interesting quantities in number theory, conditionally on the Generalized Riemann Hypothesis. Specifically, we improve the existing explicit bounds for the least quadratic…
The Macdonald symmetric functions are used to define measures on the set of all partitions of all integers. Probabilistic algorithms are given for growing partitions according to these measures. The case of Hall-Littlewood polynomials is…
Consider nonzero vectors $a_{1},\dots,a_{n}\in\mathbb{C}^{k}$, independent Rademacher random variables $\xi_{1},\dots,\xi_{n}$, and a set $S\subseteq\mathbb{C}^{k}$. What upper bounds can we prove on the probability that the random sum…
We compute the leading asymptotics as $N\to\infty$ of the maximum of the field $Q_N(q)= \log\det|q- A_N|$, $q\in \mathbb{C}$, for any unitarily invariant Hermitian random matrix $A_N$ associated to a non-critical real-analytic potential.…
Pseudoline arrangements are fundamental objects in discrete and computational geometry, and different works have tackled the problem of improving the known bounds on the number of simple arrangements of $n$ pseudolines over the past…
The accurate asymptotic evaluation of marginal likelihood integrals is a fundamental problem in Bayesian statistics. Following the approach introduced by Watanabe, we translate this into a problem of computational algebraic geometry,…
We propose a dimension reduction technique for Bayesian inverse problems with nonlinear forward operators, non-Gaussian priors, and non-Gaussian observation noise. The likelihood function is approximated by a ridge function, i.e., a map…
The Twin Prime conjecture states that there are infinitely many pairs of distinct primes which differ by $2$. Until recently this conjecture had seemed to be far out of reach with current techniques. However, in April 2013, Yitang Zhang…
Let $\mu\geq 2$ be a real number and let $\Mcal(\mu)$ denote the set of real numbers approximable at order at least $\mu$ by rational numbers. More than eighty years ago, Jarn\'i k and, independently, Besicovitch established that the…
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…
A new computational method is presented to implement the system of deductive logic described by Aristotle in Prior Analytics. Each Aristotelian problem is interpreted as a parametric probability network in which the premises give…
The Duffin--Schaeffer Conjecture answers a question on how well one can approximate irrationals by rational numbers in reduced form (an imposed condition) where the accuracy of the approximation depends on the rational number. It can be…
Assuming that Siegel zeros exist, we prove a hybrid version of the Chowla and Hardy--Littlewood prime tuples conjectures. Thus, for an infinite sequence of natural numbers $x$, and any distinct integers $h_1,\dots,h_k,h'_1,\dots,h'_\ell$,…