相关论文: Finding Almost Squares II

We prove that suitable asymptotic formulae in short intervals hold for the problems of representing an integer as a sum of a prime square and a square, or a prime square. Such results are obtained both assuming the Riemann Hypothesis and in…

We study the distribution of normalized spacings between the fractional parts of an^2, n=1,2,.... We conjecture that if a is "badly approximable" by rationals, then the sequence of fractional parts has Poisson spacings, and give a number of…

We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We…

A binary shuffle square is a binary word of even length that can be partitioned into two disjoint, identical subwords. Huang, Nam, Thaper, and the first author conjectured that as $n\rightarrow \infty$, asymptotically half of all binary…

We prove that suitable asymptotic formulae in short intervals hold for the problems of representing an integer as a sum of a prime and a square, or a prime square. Such results are obtained both assuming the Riemann Hypothesis and in the…

The problem of root mean square approximation of a square integrable function by finite linear combinations of exponential functions is considered. It is subdivided into linear and nonlinear parts. The linear approximation problem is…

Rational approximation appears in many contexts throughout science and engineering, playing a central role in linear systems theory, special function approximation, and many others. There are many existing methods for solving the rational…

We study several variations of line segment covering problem with axis-parallel unit squares in $I\!\!R^2$. A set $S$ of $n$ line segments is given. The objective is to find the minimum number of axis-parallel unit squares which cover at…

In this work we show that based on a conjecture for the pair correlation of integers representable as sums of two squares, which was first suggested by Connors and Keating and reformulated here, the second moment of the distribution of the…

We present a new approach to RSA factorization inspired by geometric interpretations and square differences. This method reformulates the problem in terms of the distance between perfect squares and provides a recurrence relation that…

In approximation of functions based on point values, least-squares methods provide more stability than interpolation, at the expense of increasing the sampling budget. We show that near-optimal approximation error can nevertheless be…

We use a variation of the Circle Method, along with the Saddle Point Method, to obtain an asymptotic formula for the number of partitions of a number n into integers which are sums of two squares. Unlike previous work on partitions into…

Let $k \in \mathbb{N}$ and suppose we are given $k$ integers $1 \leq a_1, \dots, a_k \leq n$. If $\sqrt{a_1} + \dots + \sqrt{a_k}$ is not an integer, how close can it be to one? When $k=1$, the distance to the nearest integer is $\gtrsim…

We prove an explicit analogue of Legendre's conjecture for almost primes. Namely, for every integer $n \geq 1$, the interval $(n^2,(n+1)^2)$ contains an integer having at most $3$ prime factors, counted with multiplicity. This improves the…

We construct the quasi-classical approximation of the form factors in finite volume using the separation of variables. The latter is closely related to the Baxter equation.

We define an approximate version of the Fourier transform on $2^L$ elements, which is computationally attractive in a certain setting, and which may find application to the problem of factoring integers with a quantum computer as is…

Let $\mathbf H_2$ denote the set of even integers $n \not\equiv 1 \pmod 3$. We prove that when $H \ge X^{0.33}$, almost all integers $n \in \mathbf H_2$, $X < n \le X + H$ can be represented as the sum of a prime and the square of a prime.…

This paper presents some new results concerned with uniform distribution properties associated with the sequence $(a_n)_{n\in\mathbb{N}}$, which is defined as the distance from the $n$-th square pyramidal number to the closest square. We…

We improve some results about the asymptotic formulae in short intervals for the average number of representations of integers of the forms $n=p_{1}^{\ell_1}+p_{2}^{\ell_2}$ and $n=p^{\ell_1} + m^{\ell_2}$, where $\ell_1, \ell_2\ge 2$ are…

We show that the sequence of integers which have nearly the typical number of distinct prime factors forms a Poisson process. More precisely, for $\de$ arbitrarily small and positive, the nearest neighbor spacings between integers $n$ with…