Related papers: Finding Almost Squares II

In this work we present a new simple but efficient scheme - Subsquares approach - for development of algorithms for enclosing the solution set of overdetermined interval linear systems. We are going to show two algorithms based on this…

We study how well a real number can be approximated by sums of two or more rational numbers with denominators up to a certain size.

A new result in convex analysis on the calculation of proximity operators in certain scaled norms is derived. We describe efficient implementations of the proximity calculation for a useful class of functions; the implementations exploit…

For numerical semigroups with a specified list of (not necessarily minimal) generators, we obtain explicit asymptotic expressions, and in some cases quasipolynomial/quasirational representations, for all major factorization length…

Legendre discovered that the continued fraction expansion of $\sqrt N$ having odd period leads directly to an explicit representation of $N$ as the sum of two squares. In this vein, it was recently observed that the continued fraction…

We study the behavior of the smallest possible constants $d(a,b)$ and $d_n$ in Hardy's inequalities $$ \int_a^b\left(\frac{1}{x}\int_a^xf(t)dt\right)^2\,dx\leq d(a,b)\,\int_a^b [f(x)]^2 dx $$ and $$…

This is a continuation of our previous paper studying the structure of Cartan subalgebras of von Neumann factors of type II_1. We provide more examples of II_1 factors having either zero, one or several Cartan subalgebras. We also prove a…

We consider the problem of finding the best nonnegative rank-2 approximation of an arbitrary nonnegative matrix. We first revisit the theory, including an explicit parametrization of all possible nonnegative factorizations of a nonnegative…

An algorithm is given to factor an integer with $N$ digits in $\ln^m N$ steps, with $m$ approximately 4 or 5. Textbook quadratic sieve methods are exponentially slower. An improvement with the aid of an a particular function would provide a…

In this work, we determined the general terms of all almost balancing numbers of first and second type in terms of balancing numbers and conversely we determined the general terms of all balancing numbers in terms of all almost balancing…

Finite linear least squares is one of the core problems of numerical linear algebra, with countless applications across science and engineering. Consequently, there is a rich and ongoing literature on algorithms for solving linear least…

We study the problem of writing Gaussian primes as the sum of two squares, both of which are interesting arithmetically, in particular, when one is the square of a prime and the other the square of an almost-prime.

We present new approximation schemes for bin packing based on the following two approaches: (1) partitioning the given problem into mostly identical sub-problems of constant size and then construct a solution by combining the solutions of…

We re-examine previous constructions of infinite binary words containing few distinct squares with the goal of finding the "simplest", in a certain sense. We exhibit several new constructions. Rather than using tedious case-based arguments…

For a given positive random variable $V>0$ and a given $Z\sim N(0,1)$ independent of $V$, we compute the scalar $t_0$ such that the distance between $Z\sqrt{V}$ and $Z\sqrt{t_0}$ in the $L^2(\R)$ sense, is minimal. We also consider the same…

In this note, we present some new results on even almost perfect numbers which are not powers of two. In particular, we show that $2^{r+1} < b$, if ${2^r}{b^2}$ is an even almost perfect number.

Let $\sigma(n)$ be the sum of the positive divisors of $n$. A number $n$ is said to be 2-near perfect if $\sigma(n) = 2n +d_1 +d_2 $, where $d_1$ and $d_2$ are distinct positive divisors of $n$. We give a complete description of those $n$…

Fourier series of smooth, non-periodic functions on $[-1,1]$ are known to exhibit the Gibbs phenomenon, and exhibit overall slow convergence. One way of overcoming these problems is by using a Fourier series on a larger domain, say $[-T,T]$…

We prove that five ways to define entry A086377 in the On-Line Encyclopedia of Integer Sequences do lead to the same integer sequence.

Let $F_1,\dotsc,F_R$ be quadratic forms with integer coefficients in $n$ variables. When $n\geq 9R$ and the variety $V(F_1,\dotsc,F_R)$ is a smooth complete intersection, we prove an asymptotic formula for the number of integer points in an…