Related papers: Marshall Hall's Conjecture and Gaps Between Intege…

Let $f(x)$ be a polynomial of degree $n \ge 1$ with real coefficients and let $X \ge 2$ and $\delta \ge 0$ be real numbers. Let $\|\cdot\|$ be the distance to the nearest integer. We obtain upper bounds for the number of solutions to the…

In this article, we consider a family of elliptic curves defined by $E_{m}: y^2= x^3 -m^2 x + (pqr)^2 $ where $m $ is a positive integer and $p, q, ~\text{and}~ r$ are distinct odd primes and study the torsion as well the rank of…

An almost square of type 2 is an integer $n$ that can be factored in two different ways as $n = a_1 b_1 = a_2 b_2$ with $a_1$, $a_2$, $b_1$, $b_2 \approx \sqrt{n}$. In this paper, we shall improve upon previous result on short intervals…

Completing Aronov et al.'s study on zero-discrepancy matrices for digital halftoning, we determine all (m, n, k, l) for which it is possible to put mn consecutive integers on an m-by-n board (with wrap-around) so that each k-by-l region…

In this note, we extend the notion of minimal gaps to the higher dimensional sequences. We bound the minimal gap for $(\{\boldsymbol{a}_n\boldsymbol{\alpha}\}),$ $(\{a_n\boldsymbol{\alpha}\})$ and…

Let $E_k$ be the set of positive integers having exactly $k$ prime factors. We show that almost all intervals $[x,x+\log^{1+\varepsilon} x]$ contain $E_3$ numbers, and almost all intervals $[x,x+\log^{3.51} x]$ contain $E_2$ numbers. By…

Let $\alpha$ be a real number such that $1< \alpha <2$ and let $x_0=x_0(\alpha)$ be a {\rm(}unique{\rm)} positive solution of the equation $$ x^{\alpha-1} -\frac{\pi}{e^2\sqrt{3}}x +1=0. $$ Then we prove that for each positive integer…

The aim of this paper is to demonstrate relations between Gromov-Hausdorff distance properties and the Borsuk Conjecture. The Borsuk number of a given bounded metric space $X$ is the infimum of cardinal numbers $n$ such that $X$ can be…

We show that every cubic bridgeless graph with n vertices has at least 3n/4-10 perfect matchings. This is the first bound that differs by more than a constant from the maximal dimension of the perfect matching polytope.

We establish an improved upper bound for the number of incidences between m points and n circles in three dimensions. The previous best known bound, originally established for the planar case and later extended to any dimension $\ge 2$, is…

We construct geometric barriers for minimal graphs in H^n xR. We prove the existence and uniqueness of a solution of the vertical minimal equation in the interior of a convex polyhedron in H^n extending continuously to the interior of each…

The shiftable Heffter arrays are naturally generalized to the shiftable Heffter spaces. We present a recursive construction which starting from a single shiftable Heffter space leads to infinitely many other shiftable Heffter spaces of the…

It is well-known that the number of non-crossing perfect matchings of $2k$ points in convex position in the plane is $C_k$, the $k$th Catalan number. Garc\'ia, Noy, and Tejel proved in 2000 that for any set of $2k$ points in general…

Let $P$ be a set of points in general position in the plane. Join all pairs of points in $P$ with straight line segments. The number of segment-crossings in such a drawing, denoted by $\crg(P)$, is the \emph{rectilinear crossing number} of…

We study the minimal gap statistic for sequences of the form $\left( \alpha x_n \right)_{n = 1}^{\infty}$ where $\left( x_n \right)_{n = 1}^{\infty}$ is a sequence of real numbers, and its connection to the additive energy of $\left( x_n…

We consider the question of which quadratic fields have elliptic curves with everywhere good reduction. By revisiting work of Setzer, we expand on congruence conditions that determine the real and imaginary quadratic fields with elliptic…

We prove an optimal $\Omega(n)$ lower bound on the randomized communication complexity of the much-studied Gap-Hamming-Distance problem. As a consequence, we obtain essentially optimal multi-pass space lower bounds in the data stream model…

Let $ES_{d}(n)$ be the smallest integer such that any set of $ES_{d}(n)$ points in $\mathbb{R}^{d}$ in general position contains $n$ points in convex position. In 1960, Erd\H{o}s and Szekeres showed that $ES_{2}(n) \geq 2^{n-2} + 1$ holds,…

Almost $50$ years ago Erd\H{o}s and Purdy asked the following question: Given $n$ points in the plane, how many triangles can be approximate congruent to equilateral triangles? They pointed out that by dividing the points evenly into three…

The list of all groups that can appear as torsion subgroups of elliptic curves over number fields of degree $d$, $d=4,5,6$, is not completely determined. However, the list of groups $\Phi^{\infty}(d)$, $d=4,5,6$, that can be realized as…