Related papers: Refined class number formulas and Kolyvagin system…
In 1988, Gross proposed a conjectural congruence between Stickelberger elements and algebraic regulators, which is often referred to as the refined class number formula. In this paper, we prove this congruence.
The primary objective of this paper is the study of different instances of the elliptic Stark conjectures of Darmon, Lauder and Rotger, in a situation where the elliptic curve attached to the modular form $f$ has split multiplicative…
It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…
In this paper the authors provide a complete answer to Donkin's Tilting Module Conjecture for all rank $2$ semisimple algebraic groups and $\text{SL}_{4}(k)$ where $k$ is an algebraically closed field of characteristic $p>0$. In the…
The set of prime numbers has been analyzed, based on their algebraic and arithmetical structure. Here by obtaining a sort of linear formula for the set of prime numbers, they are redefined and identified; under a systematic procedure it has…
In 1984, Deligne proved that for any prime number $p$, the reduction modulo $p$ of the diagonal of a multivariate algebraic power series with integer coefficients is algebraic over the field of rational functions with coefficients in…
Let $f$ be a cuspidal newform and $p \geq 3$ a prime such that the associated $p$-adic Galois representation has large image. We establish a new and refined "Birch and Swinnerton-Dyer type" formula for Bloch-Kato Selmer groups of the…
We study the rational dynamics of the map $\mathcal{T}(x)=\lfloor x\rfloor(1+\{x\})$, which appears in the recursive construction of the prime-representing constant of Fridman, Garbulsky, Glecer, Grime and Florentin. For a rational number…
Let $p$ be an odd prime number, $D_p$ be the dihedral group of order $2p$, $h_p$ and $h^+_p$ be the class numbers of $\bm{Q}(\zeta_p)$ and $\bm{Q}(\zeta_p+ \zeta_p^{-1})$ respectively. Theorem. $h_p^+=1$ if and only if, for any field $k$…
Kurepa's conjecture states that there is no odd prime $p$ that divides $!p=0!+1!+\cdots+(p-1)!$. We search for a counterexample to this conjecture for all $p<2^{34}$. We introduce new optimization techniques and perform the computation…
We prove a conjecture that classifies exceptional numbers. This conjecture arises in two different ways, from cryptography and from coding theory. An odd integer $t\geq 3$ is said to be exceptional if $f(x)=x^t$ is APN (Almost Perfect…
For any prime p and any positive integer n, let B(p,n) denote the n-th layer of the cyclotomic Z_p-extension over the rationals. Based on the heuristics of Cohen and Lenstra, and refined by new results on class numbers of particular B(p,n),…
Let $A/\mathbb{Q}$ be an elliptic curve having split multiplicative reduction at an odd prime $p$. Under some mild technical assumptions, we prove the statement: $$rank_{\mathbb{Z}}A(\mathbb{Q})=1 \ \ and\ \ \…
Consider the recursive relation generating a new positive integer $n_{\ell +1}$ from the positive integer $n_{\ell }$ according to the following simple rules: if the integer $n_{\ell }$ is odd, $n_{\ell +1}=3n_{\ell }+1$; if the integer…
Our main result in this article is a proof (under mild technical assumptions) of an analogue for $p$-adic Galois representations attached to a newform $f$ of even weight $k\geq4$ of Kolyvagin's conjecture on the $p$-indivisibility of…
Let $K$ be a number field, and let $G$ be a finitely generated subgroup of $K^\times$. Without relying on the Generalized Riemann Hypothesis we prove an asymptotic formula for the number of primes $\mathfrak p$ of $K$ such that the order of…
We formulate some refinements of Goldbach's conjectures based on heuristic arguments and numerical data. For instance, any even number greater than 4 is conjectured to be a sum of two primes with one prime being 3 mod 4. In general, for…
This paper grew out of the observation that the possibilities of proof by induction and definition by recursion are often confused. The paper reviews the distinctions. The von Neumann construction of the ordinal numbers includes a…
Fix $a \in \mathbb{Z}$, $a\notin \{0,\pm 1\}$. A simple argument shows that for each $\epsilon > 0$, and almost all (asymptotically 100% of) primes $p$, the multiplicative order of $a$ modulo $p$ exceeds $p^{\frac12-\epsilon}$. It is an…
Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…