Related papers: Lehmer's Problem, McKay's Correspondence, and $2,3…
ABSTRACT. In this article we present a point of view that highlights the importance of finding the upper bounds for prime gaps, in order to solve the twin primes conjecture and the Goldbach conjecture. For this purpose, we present a…
The size Ramsey number $ \hat{r}(G,H) $ of two graphs $ G $ and $ H $ is the smallest integer $ m $ such that there exists a graph $ F $ on $ m $ edges with the property that every red-blue colouring of the edges of $ F $, yields a red copy…
The following system of equations {x_1 \cdot x_1=x_2, x_2 \cdot x_2=x_3, 2^{2^{x_1}}=x_3, x_4 \cdot x_5=x_2, x_6 \cdot x_7=x_2} has exactly one solution in ({\mathbb N}\{0,1})^7, namely (2,4,16,2,2,2,2). Hypothesis 1 states that if a system…
We provide a negative answer to an old question in tight closure theory by showing that the containment x^3y^3 \in (x^4,y^4,z^4)^* in K[x,y,z]/(x^7+y^7-z^7) holds for infinitely many but not for almost all prime characteristics of the field…
The conjecture of Lehmer is proved to be true. The proof mainly relies upon: (i) the properties of the Parry Upper functions $f_{house(\alpha)}(z)$ associated with the dynamical zeta functions $\zeta_{house(\alpha)}(z)$ of the…
The ubiquitous ADE classification has induced many proposals of often mysterious correspondences both in mathematics and physics. The mathematics side includes quiver theory and the McKay Correspondence which relates finite group…
Building on recent work of Mattheus and Verstra\"ete, we establish a general connection between Ramsey numbers of the form $r(F,t)$ for $F$ a fixed graph and a variant of the Zarankiewicz problem asking for the maximum number of 1s in an…
For a finite set of integers such that the first few gaps between its consecutive elements equal $a$, while the remaining gaps equal $b$, we study dense packings of its translates on the line. We obtain an explicit lower bound on the…
In this paper several examples of gaps (lacunes) between dimensions of maximal and submaximal symmetric models are considered, which include investigation of number of independent linear and quadratic integrals of metrics and counting the…
The Erd\H{o}s distance problem concerns the least number of distinct distances that can be determined by $N$ points in the plane. The integer lattice with $N$ points is known as \textit{near-optimal}, as it spans $\Theta(N/\sqrt{\log(N)})$…
Lehmer's totient problem consists of determining the set of positive integers $n$ such that $\varphi(n)|n-1$ where $\varphi$ is Euler's totient function. In this paper we introduce the concept of $k$-Lehmer number. A $k$-Lehmer number is a…
A composite number $n$ is called a Lehmer number when $\phi(n) | n - 1$, where $\phi$ is the Euler totient function. Lehmer's totient problem asks if there exist any composite numbers $n$ such that $\phi(n)| n-1$? No such numbers are known.…
We study Laurent polynomials in any number of variables that are sums of at most $k$ monomials. We first show that the Mahler measure of such a polynomial is at least $h/2^{k-2}$, where $h$ is the height of the polynomial. Next, restricting…
An integer Heffter array $H(m,n;s;k)$ is an $m\times n$ partially filled array whose entries are the elements of a subset $\Omega\subset \mathbb{Z}$ such that $\{\Omega,-\Omega\}$ is a partition of the set $\{1,2,\ldots,2nk\}$ and such that…
The three gap theorem, also known as the Steinhaus conjecture or three distance theorem, states that the gaps in the fractional parts of $\alpha,2\alpha,\ldots, N\alpha$ take at most three distinct values. Motivated by a question of…
Beginning from the resolution of the Dirichlet L function, using the inner product formula between two infinite-dimensional vectors in the complex space, the author proved the baffling problem--Hecke conjecture.
Roughly speaking, the Kakeya Conjecture asks to what extent lines which point in different directions can be packed together in a small space. In $\R^2$, the problem is relatively straightforward and was settled in the 1970s. In $\R^3$ it…
The sparse analogue of Szemer\'edi's regularity method has played a central role in the development of extremal results for random graphs. While the sparse embedding lemma (the KLR conjecture) has been resolved, the corresponding sparse…
In the topos of simplicial sets, it makes sense to ask the following question about a given natural number $n$: what is the minimum value $m$ such that $n$-skeletality implies $m$-coskeletality? This is an instance of the Aufhebung relation…
V. Levenshtein first proposed the sequence reconstruction problem in 2001. This problem studies the model where the same sequence from some set is transmitted over multiple channels, and the decoder receives the different outputs. Assume…