Related papers: On differences of perfect powers and prime powers

Perfect error correcting codes allow for an optimal transmission of information while guaranteeing error correction. For this reason, proving their existence has been a classical problem in both pure mathematics and information theory.…

Recently, the authors showed that for every irrational number $\alpha$, there exist infinitely many positive integers $n$ represented by any given positive definite binary quadratic form $Q$, satisfying $||\alpha n||<n^{-(1/2-\varepsilon)}$…

We study a question of Harju from 2019 regarding the existence of infinite ternary square-free words whose subsequences modulo $p$ and $q$ are also square-free for relatively prime integers $p$ and $q$. Among such pairs $(p, q)$ with $p, q…

For sufficiently large integers $K$, $x$, $y$, and $q$ satisfying $K \le y < x$, where $f(u) = \alpha u^n + \alpha_{n-1}u^{n-1} + \ldots + \alpha_1 u$ is a polynomial of degree $n$ with real coefficients, $n$ is a fixed positive integer,…

Starting from the classical division polynomials we construct homogeneous polynomials $\alpha_n$, $\beta_n$, $\gamma_n$ such that for $P = (x:y:z)$ on an elliptic curve in Weierstrass form over an arbitrary ring we have $nP =…

Generalising Solomon's theorem, C. Gordon and F. Rodriguez-Villegas have proven recently that, in any group, the number of solutions to a system of coefficient-free equations is divisible by the order of this group whenever the rank of the…

We study the existence of formal power series solutions to q-algebraic equations. When a solution exists, we give a sufficient condition on the equation for this solution to have a positive radius of convergence. We emphasize on the case…

The Green-Tao-Ziegler theorem provides asymptotics for the number of prime tuples of the form $(\psi_1(n),\ldots,\psi_t(n))$ when $n$ ranges among the integer vectors of a convex body $K\subset [-N,N]^d$ and $\Psi=(\psi_1,\ldots,\psi_t)$ is…

Let $k \ge 2$ be an even integer, $ \ell \ge \max\{5, k-1\} $ be a prime, and $N$ be a squarefree positive integer. It is known that if the $\rm{mod}\,\ell$ Galois representation $\overline{\rho}_f$ associated with a newform $f$ of weight…

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…

Let $ \mathbb{Q}\mathcal{E}_{\mathbb{Z}} $ be the set of power sums whose characteristic roots belong to $ \mathbb{Z} $ and whose coefficients belong to $ \mathbb{Q} $, i.e. $ G : \mathbb{N} \rightarrow \mathbb{Q} $ satisfies…

Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…

The Hardy--Littlewood prime $k$-tuples conjecture has long been thought to be completely unapproachable with current methods. While this sadly remains true, startling breakthroughs of Zhang, Maynard, and Tao have nevertheless made…

We consider the equation $[p_{1}^{c}] + [p_{2}^{c}] + [p_{3}^{c}] = N$, where $N$ is a sufficiently large integer, and prove that if $1 < c < \frac{17}{16}$, then it has a solution in prime numbers $p_{1}$, $p_{2}$, $p_{3}$ such that each…

Let $f=\sum_{n=0}^\infty f_n x^n \in \overline{\mathbb Q}[[x]$ be a solution of an algebraic differential equation $Q(x,y(x), \ldots, y^{(k)}(x))=0$, where $Q$ is a multivariate polynomial with coefficients in $\overline{\mathbb Q}$. The…

Given a strictly increasing sequence of positive real numbers tending to infinity $(q_{n})_{n=1}^{\infty}$, and an arbitrary sequence of real numbers $(r_{n})_{n=1}^{\infty}.$ We study the set of $\alpha\in(1,\infty)$ for which…

Assume that $G$ is a graph with edge ideal $I(G)$ and matching number ${\rm match}(G)$. For every integer $s\geq 1$, we denote the $s$-th squarefree power of $I(G)$ by $I(G)^{[s]}$. It is shown that for every positive integer $s\leq {\rm…

We consider the problem of determining whether a given prime p is a congruent number. We present an easily computed criterion that allows us to conclude that certain primes for which congruency was previously undecided, are in fact not…

It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…

The Taylor resolution is almost never minimal for powers of monomial ideals, even in the square-free case. In this paper we introduce a smaller resolution for each power of any square-free monomial ideal, which depends only on the number of…