English
Related papers

Related papers: Fourier optimization and consequences of the gener…

200 papers

Under the assumption of the Riemann Hypothesis (RH), we prove explicit quantitative relations between hypothetical error terms in the asymptotic formulae for truncated mean-square average of exponential sums over primes and in the…

Number Theory · Mathematics 2017-05-12 Alessandro Languasco , Alessandro Zaccagnini

We show that sparsity constrained optimization problems over low dimensional spaces tend to have a small duality gap. We use the Shapley-Folkman theorem to derive both data-driven bounds on the duality gap, and an efficient primalization…

Optimization and Control · Mathematics 2021-02-16 Armin Askari , Alexandre d'Aspremont , Laurent El Ghaoui

We consider several old problems involving the number of prime divisors function $\omega(n)$, as well as the related functions $\Omega(n)$ and $\tau(n)$. Firstly, we show that there are infinitely many positive integers $n$ such that…

Number Theory · Mathematics 2026-04-28 Terence Tao , Joni Teräväinen

Optimal prediction methods compensate for a lack of resolution in the numerical solution of time-dependent differential equations through the use of prior statistical information. We present a new derivation of the basic methodology, show…

Numerical Analysis · Mathematics 2025-10-20 A. J. Chorin , R. Kupferman , D. Levy

This article presents a mathematical analysis and numerical strategies for solving the optimization problem of minimizing the quadratic function $J(P) = \text{Tr}(BP)- \frac{1}{2} \text{Tr}(A P A P)$, where $A,B \in \mathbb R^{M \times…

Optimization and Control · Mathematics 2026-03-19 Thomas Ayral , Eric Cancès , Fabian M. Faulstich , Lin Lin , Alicia Negre

The discrete Fourier transform has proven to be an essential tool in many geometric and combinatorial problems in vector spaces over finite fields. In general, sets with good uniform bounds for the Fourier transform appear more `random' and…

Combinatorics · Mathematics 2025-10-16 Jonathan M. Fraser , Firdavs Rakhmonov

We study three integrals related to the celebrated pair correlation conjecture of H. L. Montgomery. The first is the integral of Montgomery's function $F(\alpha, T)$ in bounded intervals, the second is an integral introduced by Selberg…

Number Theory · Mathematics 2022-02-21 Emanuel Carneiro , Vorrapan Chandee , Andrés Chirre , Micah B. Milinovich

Studies on simulation input uncertainty often built on the availability of input data. In this paper, we investigate an inverse problem where, given only the availability of output data, we nonparametrically calibrate the input models and…

Optimization and Control · Mathematics 2018-01-09 Aleksandrina Goeva , Henry Lam , Huajie Qian , Bo Zhang

In recent work, we considered the frequencies of patterns of consecutive primes $\pmod{q}$ and numerically found biases toward certain patterns and against others. We made a conjecture explaining these biases, the dominant factor in which…

Number Theory · Mathematics 2017-09-20 Robert J. Lemke Oliver , Kannan Soundararajan

In this paper we derive tight bounds on the expected value of products of {\em low influence} functions defined on correlated probability spaces. The proofs are based on extending Fourier theory to an arbitrary number of correlated…

Probability · Mathematics 2009-06-01 Elchanan Mossel

In this paper a new integral for the remainder of $\pi(x)$ is obtained. It is proved that there is an infinite set of the formulae containing miscellaneous parts of this integral.

Classical Analysis and ODEs · Mathematics 2011-05-26 Jan Moser

In this note we compare two measures of the complexity of a class $\mathcal F$ of Boolean functions studied in (unconditional) pseudorandomness: $\mathcal F$'s ability to distinguish between biased and uniform coins (the coin problem), and…

Computational Complexity · Computer Science 2020-09-01 Rohit Agrawal

The results presented in this paper are refinements of some results presented in a previous paper. Three such refined results are presented. The first one relaxes one of the basic hypotheses assumed in the previous paper, and thus extends…

Complex Variables · Mathematics 2015-05-06 Jorge L. deLyra

We continue the study of restricted Monte Carlo algorithms in a general setting. Here we show a lower bound for minimal errors in the setting with finite restriction in terms of deterministic minimal errors. This generalizes a result of…

Numerical Analysis · Mathematics 2020-12-24 Stefan Heinrich

Optimization seeks extremal points in a function. When there are superextensively many optima, optimization algorithms are liable to get stuck. Under these conditions, generic algorithms tend to find marginal optima, which have many nearly…

Disordered Systems and Neural Networks · Physics 2024-07-25 Jaron Kent-Dobias

We use a deterministic construction to prove the optimality of the exponent in the Mockenhaupt-Mitsis-Bak-Seeger Fourier restriction theorem for dimension $d=1$ and parameter range $0 < a,b \leq d$ and $b\leq 2a$. Previous constructions by…

Classical Analysis and ODEs · Mathematics 2025-06-27 Robert Fraser , Kyle Hambrook , Donggeun Ryou

We present precise bit and degree estimates for the optimal value of the polynomial optimization problem $f^*:=\text{inf}_{x\in \mathscr{X}}~f(x)$, where $\mathscr{X}$ is a semi-algebraic set satisfying some non-degeneracy conditions. Our…

Optimization and Control · Mathematics 2024-07-25 Boulos El Hilany , Elias Tsigaridas

For a complete noncompact connected Riemannian manifold with bounded geometry, we prove a compactness result for sequences of finite perimeter sets with uniformly bounded volume and perimeter in a larger space obtained by adding limit…

Metric Geometry · Mathematics 2015-04-21 Abraham Enrique Muñoz Flores , Stefano Nardulli

We present a new alternative theorems for sequences of functions. As applications, we extend recent results in the literature related to first-order necessary conditions for optimality problems. Our contributions involve extending…

Optimization and Control · Mathematics 2024-12-10 Mohammed Bachir , Rongzhen Lyu

We present and discuss general techniques for proving inapproximability results for truthful mechanisms. We make use of these techniques to prove lower bounds on the approximability of several non-utilitarian multi-parameter problems. In…

Computer Science and Game Theory · Computer Science 2017-02-16 Ahuva Mu'alem , Michael Schapira
‹ Prev 1 8 9 10 Next ›