Related papers: Finding Almost Squares II
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 have obtained two more characterizations of nearly pseudocompact spaces.
An abelian square is a string of length 2n where the last n symbols form a permutation of the first n symbols. In this note we count the number of abelian squares and give an asymptotic estimate of this quantity.
We investigate some aspects of bounding, splitting, and almost disjointness. In particular, we investigate the relationship between the bounding number, the closed almost disjointness number, splitting number, and the existence of certain…
We construct sets $A, B$ in a vector space over $\mathbb{F}_2$ with the property that $A$ is "statistically" almost closed under addition by $B$ in the sense that $a + b$ almost always lies in $A$ when $a \in A, b \in B$, but which is…
Given a rectangle $R$ with area $A$ and a set of areas $L=\{A_1,...,A_n\}$ with $\sum_{i=1}^n A_i = A$, we consider the problem of partitioning $R$ into $n$ sub-regions $R_1,...,R_n$ with areas $A_1,...,A_n$ in a way that the total…
An intercalate in a Latin square is a $2\times2$ Latin subsquare. Let $N$ be the number of intercalates in a uniformly random $n\times n$ Latin square. We prove that asymptotically almost surely…
Edit distance is a measure of similarity of two strings based on the minimum number of character insertions, deletions, and substitutions required to transform one string into the other. The edit distance can be computed exactly using a…
The least squares method allows fitting parameters of a mathematical model from experimental data. This article proposes a general approach of this method. After introducing the method and giving a formal definition, the transitivity of the…
Functions with discontinuities appear in many applications such as image reconstruction, signal processing, optimal control problems, interface problems, engineering applications and so on. Accurate approximation and interpolation of these…
Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their `concavity index', $m$. Such polygons are called \emph{$m$-convex} polygons and are characterised by…
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…
Define a natural number $n$ as a \textit{square-full} integer if for every prime $p$ such that $p|n$, we have $p^2|n$. In this paper, we establish an upper bound on the variance of square-full integers in short intervals of an expected…
We begin the study of how to extend few variable means to several variable ones and how to shrink means of several variables to less variables. With the help of one of the techniques we show that it is enough to check an inequality between…
A square is a factor $S = (S_1; S_2)$ where $S_1$ and $S_2$ have the same pattern, and a permutation is said to be square-free if it contains no non-trivial squares. The permutation is further said to be bicrucial if every extension to the…
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…
On the math-fun mailing list (7 May 2013), Neil Sloane asked to calculate the number of $n \times n$ matrices with entries in $\{0,1\}$ which are squares of other such matrices. In this paper we analyze the case that the arithmetic is in…
In this paper, we consider a conjecture of Erdos and Rosenfeld and a conjecture of Ruzsa when the number is an almost square. By the same method, we consider lattice points of a circle close to the x-axis with special radii.
We introduce the notion of almost realizability, an arithmetic generalization of realizability for integer sequences, which is the property of counting periodic points for some map. We characterize the intersection between the set of…
Probably we have observed a new simple phenomena dealing with approximations to two real numbers.