English
Related papers

Related papers: A Note on the least squarefree number in an arithm…

200 papers

We suggest a method for simultaneously generating high order quadrature weights for integrals over Lipschitz domains and their boundaries that requires neither meshing nor moment computation. The weights are determined on pre-defined…

Numerical Analysis · Mathematics 2025-08-26 Oleg Davydov , Bruno Degli Esposti

The well-known result states that the square-free counting function up to $N$ is $N/\zeta(2)+O(N^{1/2})$. This corresponds to the identity polynomial $\text{Id}(x)$. It is expected that the error term in question is…

Number Theory · Mathematics 2024-09-18 Watcharakiete Wongcharoenbhorn , Yotsanan Meemark

The purpose of the present article is to show how the modular method together with different techniques can be used to prove non-existence of primitive non-trivial solutions of the equation $x^2+dy^6=z^p$ for square-free values $1 \le d \le…

Number Theory · Mathematics 2021-09-16 Franco Golfieri , Ariel Pacetti , Lucas Villagra Torcomian

We consider the set $\mathcal M_n\left(\mathbb Z; H\right)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain and asymptotic formula on the number of matrices from $\mathcal M_n\left(\mathbb Z; H\right)$ with…

Number Theory · Mathematics 2026-04-28 Alina Ostafe , Igor E. Shparlinski

A Littlewood polynomial is a single-variable polynomial all of whose coefficients lie in $\{ \pm 1\}$. We establish the leading term asymptotics of the number of reciprocal or skew-reciprocal Littlewood polynomials with square discriminant.…

Number Theory · Mathematics 2025-06-11 David Hokken

The sum of square roots is as follows: Given $x_1,\dots,x_n \in \mathbb{Z}$ and $a_1,\dots,a_n \in \mathbb{N}$ decide whether $ E=\sum_{i=1}^n x_i \sqrt{a_i} \geq 0$. It is a prominent open problem (Problem 33 of the Open Problems Project),…

Computational Geometry · Computer Science 2023-12-05 Friedrich Eisenbrand , Matthieu Haeberle , Neta Singer

For any $\varepsilon >0$, we obtain an asymptotic formula for the number of solutions $n \le x$ to $$ \lVert \alpha n + \beta \rVert < x^{-\frac{1}{4}+\varepsilon} $$ where $n$ is $[y,z]$-smooth for infinitely many real number $x$. In…

Number Theory · Mathematics 2019-05-02 Kam Hung Yau

Motivated by asymptotic phenomena of moduli spaces of higher rank stable sheaves on algebraic surfaces, we study the Picard number of the moduli space of one-dimensional stable sheaves supported in a sufficiently positive divisor class on a…

Algebraic Geometry · Mathematics 2025-03-11 Fei Si , Feinuo Zhang

We consider the problem of maximizing the sum of a monotone submodular function and a linear function subject to a general solvable polytope constraint. Recently, Sviridenko et al. (2017) described an algorithm for this problem whose…

Data Structures and Algorithms · Computer Science 2018-10-10 Moran Feldman

We prove an asymptotic formula for the number of integers $\leq x$ which can be written as the product of $k ~(\geq 2)$ distinct primes $p_1\cdots p_k$ with each prime factor in an arithmetic progression $p_j\equiv a_j \bmod q$, $(a_j,…

Number Theory · Mathematics 2018-02-21 Xianchang Meng

We prove that the primes below $x$ are, on average, equidistributed in arithmetic progressions to smooth moduli of size up to $x^{1/2+1/40-\epsilon}$. The exponent of distribution $\tfrac{1}{2} + \tfrac{1}{40}$ improves on a result of…

Number Theory · Mathematics 2025-02-25 Julia Stadlmann

We investigate the problem of showing that the values of a given polynomial are smooth (i.e., have no large prime factors) a positive proportion of the time. Although some results exist that bound the number of smooth values of a polynomial…

Number Theory · Mathematics 2007-05-23 Greg Martin

We consider the error term of the asymptotic formula for the number of pairs of $k$-free integers up to $x$. Our error term improves results by Heath-Brown, Brandes and Dietmann/Marmon. We then extend our results to $r$-tuples of $k$-free…

Number Theory · Mathematics 2014-03-20 T. Reuss

In this note, we prove by using T. Estermann's and S. Dimitrov's arguments with an elementary inequality that there are infinitely many $n$ for which all of the numbers $n^2+1,n^2+2$ and $n^2+3$ are squarefree. We also improve the error…

Number Theory · Mathematics 2022-11-29 W. Wongcharoenbhorn

Assuming the generalized Riemann hypothesis, we give asymptotic bounds on the size of intervals that contain primes from a given arithmetic progression using the approach developed by Carneiro, Milinovich and Soundararajan [Comment. Math.…

Number Theory · Mathematics 2021-01-12 Andrés Chirre , Valdir José Pereira Júnior , David de Laat

Let $\mathbb{F}_q[t]$ be the ring of polynomials over $\mathbb{F}_q$, the finite field of $q$ elements, and let $p$ be the characteristic of $\mathbb{F}_q$. We denote $\widetilde{G}_q(k)$ to be the least integer $t_0$ with the property that…

Number Theory · Mathematics 2015-09-07 Shuntaro Yamagishi

Burgess proved that for $\chi_q$ a primitive Dirichlet character modulo $q$ with $q$ cubefree, $\Big|\sum_{M< n\le M+N}\chi_q(n)\Big| \ll N^{1-\frac{1}{r}}q^{\frac{r+1}{4r^2}+\epsilon}$ for all integers $r\ge1.$ More recently, explicit…

Number Theory · Mathematics 2025-11-25 Elchin Hasanalizade , Hua Lin , Greg Martin , Andradis Luna Martínez , Enrique Treviño

In this note, we answer a question of Mirzakhani on asymptotic behavior of the one-point volume polynomial of moduli spaces of curves. We also present some applications of Mirzakhani's asymptotic formulae of Weil-Petersson volumes.

Algebraic Geometry · Mathematics 2014-11-18 Kefeng Liu , Hao Xu

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…

Number Theory · Mathematics 2016-12-12 Youness Lamzouri , Xiannan Li , Kannan Soundararajan

We improve on the best available bounds for the square-free sieve and provide a general framework for its applicability. The failure of the local-to-global principle allows us to obtain results better than those reached by a classical…

Number Theory · Mathematics 2015-06-26 Harald Helfgott
‹ Prev 1 4 5 6 7 8 10 Next ›