相关论文: Finding Almost Squares

We establish that, for almost all natural numbers $N$, there is a sum of two positive integral cubes lying in the interval $[N-N^{7/18+\epsilon},N]$. Here, the exponent $7/18$ lies half way between the trivial exponent $4/9$ stemming from…

A subset $\mathcal{A}\subseteq\mathbb{Z}$ is called $s$-almost square universal if every sufficiently large positive integer can be written as a sum of at most $s$ squares of integers from $\mathcal{A}$. In this article, we study the…

We find the closest approximation to 1 from below using a sum of $n$ Egyptian fractions.

We consider the question of approximating any real number $\alpha$ by sums of $n$ rational numbers $\frac{a_1}{q_1} + \frac{a_2}{q_2} + ... + \frac{a_n}{q_n}$ with denominators $1 \leq q_1, q_2, ..., q_n \leq N$. This leads to an inquiry on…

We investigate the problem of r almost-primes represented by sets of quadratic forms and give upper bounds for r. Our results extend work of Diamond and Halberstam in which they investigated the corresponding problem for polynomials.

This is an informal announcement of results to be described and proved in detail in a paper to appear. We give various results on the structure of approximate subgroups in linear groups such as $\SL_n(k)$. For example, generalising a result…

We define the notion of an almost polynomial identity of an associative algebra $R$, and show that its existence implies the existence of an actual polynomial identity of $R$. A similar result is also obtained for Lie algebras and Jordan…

In this paper we study quadratic forms which are universal when restricted to almost prime inputs, establishing finiteness theorems akin to the Conway--Schneeberger 15 theorem.

The Total Least Squares solution of an overdetermined, approximate linear equation $Ax \approx b$ minimizes a nonlinear function which characterizes the backward error. We show that a globally convergent variant of the Gauss--Newton…

We present a variation of quasi-isometry to approach the problem of defining a geometric notion equivalent to commensurability. In short, this variation can be summarized as "quasi-isometry with uniform parameters for a large enough family…

In this letter, we consider two sets of observations defined as subspace signals embedded in noise and we wish to analyze the distance between these two subspaces. The latter entails evaluating the angles between the subspaces, an issue…

We present a ${\Gamma}$-convergence approximation for the total anisotropic length of a partition. This theoretical result gives rise to a numerical method which allows the study of minimal partitions with respect to different anisotropies.…

Let $1\leq a<q$ be a pair of small integers such that $\gcd(a,q)=1$ and let $x>1$ be a large number. This note discusses the existence of a short sequence of primes $p\equiv a\bmod q$ between two squares $x^2$ and $(x+1)^2$.

In this paper, we show that, for some constant $C > 0$, the interval $(x, x + C x^{5/26}]$ always contains a squarefree number when $x$ is sufficiently large (in terms of $C$). Our improvement comes from establishing asymptotic relations…

This work deals with almost automorphy of distributions. We give characterizations and main properties of these distributions. We also study the existence of distributional almost automorphic solutions of linear difference-differential…

We study the computational complexity of finding a solution for the straight-cut and square-cut pizza sharing problems. We show that computing an $\varepsilon$-approximate solution is PPA-complete for both problems, while finding an exact…

The $k$-median and $k$-means clustering objectives are classic objectives for modeling clustering in a metric space. Given a set of points in a metric space, the goal of the $k$-median (resp. $k$-means) problem is to find $k$ representative…

We explore an algorithm for approximating roots of integers, discuss its motivation and derivation, and analyze its convergence rates with varying parameters and inputs. We also perform comparisons with established methods for approximating…

For a non-square positive integer x, let k_x denote the distance between x^3 and the perfect square closest to x^3. A conjecture of Marshall Hall states that the ratios r_x = (x^(1/2))/k_x, are bounded above. (Elkies has shown that any such…

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…