Related papers: Brauer's Height Zero Conjecture

We prove the High Girth Existence Conjecture - the common generalization of the Existence Conjecture for Combinatorial Designs originating from the 1800s and Erd\H{o}s' Conjecture from 1973 on the Existence of High Girth Steiner Triple…

This paper proves the existence of infinitely many Perrin pseudoprimes, as conjectured by Adams and Shanks in 1982. The theorem proven covers a general class of pseudoprimes based on recurrence sequences. The result uses ingredients of the…

Let k be an algebraically closed field of characteristic p>0, let m,r be integers with m\ge1, r\ge0 and m\ge r and let S_0(2m,r) be the symplectic Schur algebra over k as introduced by the first author. We introduce the symplectic Schur…

We measure whether there are numerous pairs of twin primes (hereafter referred to as twin prime pairs) according to the prime number inferred by sieve of Eratosthenes. In this study, we reveal at least three additional twin prime pairs…

The twin prime conjecture asserts that there are infinitely many pairs of primes that differ by two. While recent advances have improved our understanding of bounded prime gaps, the conjecture remains unresolved. This paper refines the…

Let $p\geq 5$ be a prime number. Let $\mathsf{E}/\mathbb{Q}$ be an elliptic curve with good ordinary reduction at $p$. Let $K$ be an imaginary quadratic field where $p$ splits, and such that the generalized Heegner hypothesis holds. Under…

Recently the problem of constructing a perfect Euler cuboid was related with three conjectures asserting the irreducibility of some certain three polynomials depending on integer parameters. In this paper a partial result toward proving the…

We give an upper bound for the exponential sum over squarefree integers. This establishes a conjecture by Br\"udern and Perelli.

It is a well-known fact that for any natural number $n$, there always exists a prime in $[n, 2n]$. Our aim in this note is to generalize this result to $[n, kn]$. A lower as well as an upper bound on the number of primes in $[n, kn]$ were…

A strong version of Andrica's conjecture can be formulated as follows: Except for $p_n\in\{3,7,13,23,31,113\}$, that is $n\in\{2,4,6,9,11,30\}$, one has$\sqrt{p_{n+1}}-\sqrt{p_n} < \frac{1}{2}.$ While a proof is far out of reach I shall…

The height $H(n)$ of $n$, introduced by Pillai in 1929, is the smallest positive integer $i$ such that the $i$th iterate of Euler's totient function at $n$ is $1$. H. N. Shapiro (1943) studied the structure of the set of all numbers at a…

In this paper, we derive a more precise version of the Strong Pair Correlation Conjecture on the zeros of the Riemann zeta function under Riemann Hypothesis and Twin Prime Conjecture.

Gerth generalised Cohen-Lenstra heuristics to the prime $p=2$. He conjectured that for any positive integer $m$, the limit $$ \lim_{x \to \infty} \frac{\sum_{0 < D \le X, \atop{ \text{squarefree} }} |{\rm Cl}^2_{\Q(\sqrt{D})}/{\rm…

This is an expository paper aiming to introduce Zilber's Exponential Closedness conjecture to a general audience. Exponential Closedness predicts when (systems of) equations involving addition, multiplication, and exponentiation have…

We give a purely combinatorial proof for a two-fold generalization of van der Waerden-Brauer's theorem and Hindman's theorem. We also give tower bounds for a finite version of it.

We use Brauer-Manin obstructions to explain failures of the integral Hasse principle and strong approximation away from infinity for the equation x^2+y^2+z^k=m with fixed integers k>=3 and m. Under Schinzel's hypothesis (H), we prove that…

We establish a lower bound for the size of possible counterexamples of the Dixmier Conjecture. We prove that $B>15$, where $B$ is the minimum of the greatest common divisor of the total degrees of $P$ and $Q$, where $(P,Q)$ runs over the…

The Brouwer conjecture (BC) in spectral graph theory claims that the sum of the largest k Kirchhoff eigenvalues of a graph are bounded above by the number m of edges plus k(k+1)/2. We show that (BC) holds for all graphs with n vertices if n…

Let $p$ be an odd prime, and suppose that $G$ is a $p$-solvable group and $\varphi\in {\rm IBr}(G)$ has vertex $Q$. In 2011, Cossey, Lewis and Navarro proved that the number of lifts of $\varphi$ is at most $|Q:Q'|$ whenever $Q$ is normal…

We prove explicit upper bounds for weighted sums over prime numbers in arithmetic progressions with slowly varying weight functions. The results generalize the well-known Brun-Titchmarsh inequality.