Related papers: Finding Almost Squares
A continuous approximation for the results of [1] is obtained. In this approximation the energy distribution is represented in the form of the product of the Gibbs factor and superstatistics factor. The mutual weights of the factors are…
We use the spectral theory of Hilbert-Maass forms for real quadratic fields to obtain the asymptotics of some sums involving the number of representations as a sum of two squares in the ring of integers.
We establish a new asymptotic formula for the number of polynomials of degree $n$ with $k$ prime factors over a finite field $\mathbb{F}_q$. The error term tends to $0$ uniformly in $n$ and in $q$, and $k$ can grow beyond $\log n$.…
This paper investigates quasi-isometries between graphs with variable edge lengths. A quasi-isometry is a mapping between metric spaces that approximately preserves distances, allowing for a bounded amount of additive and multiplicative…
We estimate the covariance in counts of almost-primes in $\mathbb{F}_q[T]$, weighted by higher-order von Mangoldt functions. The answer takes a pleasant algebraic form. This generalizes recent work of Keating and Rudnick that estimates the…
We study approximation algorithms for variants of the \emph{median string} problem, which asks for a string that minimizes the sum of edit distances from a given set of $m$ strings of length $n$. Only the straightforward $2$-approximation…
We study a summability method called almost convergence for bounded measurable functions defined on a locally compact abelian group. We define almost convergence using topologically invariant means and exhibit two different kinds of…
Indexing of static and dynamic sets is fundamental to a large set of applications such as information retrieval and caching. Denoting the characteristic vector of the set by B, we consider the problem of encoding sets and multisets to…
We carry out a detailed investigation of congruence half-factorial Krull monoids with finite cyclic class group and related problems. Specifically, we determine precisely all relatively large values that can occur as a minimal distance of a…
We give a simple inequality that compares the laws of two random variables taking values in a convex subset of a normed vector space. By combining this with Arratia's coupling, recently refined by Koukoulopoulos and the author, we obtain a…
We study intermediate-scale statistics for the fractional parts of the sequence $(\alpha a_n)_{n=1}^{\infty}$, where $(a_n)_{n=1}^{\infty}$ is a positive, real-valued lacunary sequence, and $\alpha\in\mathbb{R}$. In particular, we consider…
We study the asymptotics of the average number of squares (or quadratic residues) in Z_n and Z_n^*. Similar analyses are performed for cubes, square roots of 0 and 1, and cube roots of 0 and 1.
In this paper we discuss near-perfect numbers of various forms. In particular, we study the existence of near-perfect numbers in the Fibonacci and Lucas sequences, near-perfect values taken by integer polynomials and repdigit near-perfect…
We present a one-parameter family of quantum maps whose spectral statistics are of the same intermediate type as observed in polygonal quantum billiards. Our central result is the evaluation of the spectral two-point correlation form factor…
We compute a \emph{sparse} solution to the classical least-squares problem $\min_x||A x -b||,$ where $A$ is an arbitrary matrix. We describe a novel algorithm for this sparse least-squares problem. The algorithm operates as follows: first,…
Following T. H. Chan, we consider the problem of approximation of a given rational fraction a/q by sums of several rational fractions a_1/q_1, ..., a_n/q_n with smaller denominators. We show that in the special cases of n=3 and n=4 and…
In this paper we discuss approximation of partially smooth functions. The problem arises naturally in the study of laminated currents.
We provide a general framework for getting expected linear time constant factor approximations (and in many cases FPTASs) to several well-known problems in Computational Geometry, such as $k$-center clustering and farthest nearest neighbor.…
The Gauss Circle Problem concerns finding asymptotics for the number of lattice point lying inside a circle in terms of the radius of the circle. The heuristic that the number of points is very nearly the area of the circle is surprisingly…
A two-step method for solving planar Laplace problems via rational approximation is introduced. First complex rational approximations to the boundary data are determined by AAA approximation, either globally or locally near each corner or…