English
Related papers

Related papers: Efficient equidistribution of periodic nilsequence…

200 papers

We show that many theorems which assert that two kinds of partitions of the same integer $n$ are equinumerous are actually special cases of a much stronger form of equality. We show that in fact there correspond partition statistics $X$ and…

Combinatorics · Mathematics 2007-05-23 Herbert S. Wilf

Motivated by a question of van der Poorten about the existence of infinite chain of prime numbers (with respect to some base), in this paper we advance the study of sequences of consecutive polynomials whose coefficients are chosen…

Number Theory · Mathematics 2018-05-24 Domingo Gómez-Pérez , Alina Ostafe , Min Sha

A predictive distribution over a sequence of $N+1$ events is said to be "frequency mimicking" whenever the probability for the final event conditioned on the outcome of the first $N$ events equals the relative frequency of successes among…

Methodology · Statistics 2019-09-06 Frank Lad , Giuseppe Sanfilippo

We consider the unconstrained optimization of multivariate trigonometric polynomials by the sum-of-squares hierarchy of lower bounds. We first show a convergence rate of $O(1/s^2)$ for the relaxation with degree $s$ without any assumption…

Optimization and Control · Mathematics 2023-04-19 Francis Bach , Alessandro Rudi

Given a level set $E$ of an arbitrary multiplicative function $f$, we establish, by building on the fundamental work of Frantzikinakis and Host [13,14], a structure theorem which gives a decomposition of $\mathbb{1}_E$ into an almost…

Number Theory · Mathematics 2022-05-16 Vitaly Bergelson , Joanna Kułaga-Przymus , Mariusz Lemańczyk , Florian K. Richter

In this paper two related simplification problems for systems of linear inequalities describing precedence relation systems are considered. Given a precedence relation system, the first problem seeks a minimum subset of the precedence…

Data Structures and Algorithms · Computer Science 2015-03-17 Kin Cheong Sou

The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…

Computational Complexity · Computer Science 2018-01-16 Alexander A. Sherstov

In this work and its sister paper [5] we give a new proof of the famous Linnik theorem bounding the least prime in an arithmetic progression. Using sieve machinery in both papers, we are able to dipense with the log-free zero density bounds…

Number Theory · Mathematics 2023-03-13 John B Friedlander , Henryk Iwaniec

We consider the energy norm arising from elliptic problems with discontinuous piecewise constant diffusion. We prove that under the quasi-monotonicity property on the diffusion coefficient, the best approximation error with continuous…

Numerical Analysis · Mathematics 2021-05-18 Francesca Tantardini , Rüdiger Verfürth

A reasonably complete theory of the approximation of an irrational by rational fractions whose numerators and denominators lie in prescribed arithmetic progressions is developed in this paper. Results are both, on the one hand, from a…

Number Theory · Mathematics 2014-08-27 Faustin Adiceam

We focus here on a class of fourth-order parabolic equations that can be written as a system of second-order equations by introducing an auxiliary variable. We design a novel second-order fully discrete mixed finite element method to…

Numerical Analysis · Mathematics 2020-08-28 Sana Keita , Abdelaziz Beljadid , Yves Bourgault

We improve the estimates in the restriction problem in dimension $n \ge 4$. To do so, we establish a weak version of a $k$-linear restriction estimate for any $k$. The exponents in this weak $k$-linear estimate are sharp for all $k$ and…

Classical Analysis and ODEs · Mathematics 2017-11-06 Larry Guth

Partitions of the set of primes are introduced based on the Chebyshev polynomials at rationals. The prime densities of all such partitions are established. Euler's Criterion for $SL(2,\mathbb Q)$ is formulated, which is the bridge between…

Number Theory · Mathematics 2020-08-04 Maciej P. Wojtkowski

We present different implementations for the irreducible Sobol (IS) sequences introduced in [3]. For this purpose we retain two strategies: first we use the connection between IS and Niederreiter sequences to provide a very simple…

Numerical Analysis · Mathematics 2019-10-10 H. Faure , C. Lemieux

Following work of Mazur-Tate and Satoh, we extend the definition of division polynomials to arbitrary isogenies of elliptic curves, including those whose kernels do not sum to the identity. In analogy to the classical case of division…

Number Theory · Mathematics 2026-04-20 Katherine E. Stange

In this paper we study some iterative methods for simultaneous approximation of polynomial zeros. We give new semilocal convergence theorems with error bounds for Ehrlich's and Nourein's iterations. Our theorems generalize and improve…

Numerical Analysis · Mathematics 2007-09-10 Petko D. Proinov

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

The main results of this paper are to prove bounds for ergodic averages for nilflows on general higher step nilmanifolds. Under Diophantine condition on the frequency of a toral projection of the flow, we prove that almost all orbits become…

Dynamical Systems · Mathematics 2021-07-27 Minsung Kim

We improve Irving's method of the double-sieve by using the DHR sieve. By extending the upper and lower sieve functions into their respective non-elementary ranges, we are able to make improvements on the previous records on the number of…

Number Theory · Mathematics 2016-06-14 Pin-Hung Kao

Quasi-logarithmic combinatorial structures are a class of decomposable combinatorial structures which extend the logarithmic class considered by Arratia, Barbour and Tavar\'{e} (2003). In order to obtain asymptotic approximations to their…

Combinatorics · Mathematics 2010-07-30 A. D. Barbour , Bruno Nietlispach