Related papers: Refined class number formulas and Kolyvagin system…
Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with better parameters than explicit constructions do. But the probabilistic…
In this work we use the number classification in families of the form 6n+1, and 6n+5 with n integer (Such families contain all odd prime numbers greater than 3 and other compound numbers related with primes). We will use this kind of…
We define Kolyvagin systems and Stark systems attached to $p$-adic representations in the case of arbitrary `core rank' (the core rank is a measure of the generic Selmer rank in a family of Selmer groups). Previous work dealt only with the…
This paper investigates how global decision problems over arithmetically represented domains acquire reflective structure through class-quantification. Arithmetization forces diagonal fixed points whose verification requires reflection…
In this paper we produce infinite families of counterexamples to Jantzen's question posed in 1980 on the existence of Weyl $p$-filtrations for Weyl modules for an algebraic group and Donkin's Tilting Module Conjecture formulated in 1990.…
We generalize current known distribution results on Shanks--R\'enyi prime number races to the case where arbitrarily many residue classes are involved. Our method handles both the classical case that goes back to Chebyshev and function…
In this paper, we construct (many) Kolyvagin systems out of Stickelberger elements, utilizing ideas borrowed from our previous work on Kolyvagin systems of Rubin-Stark elements. We show how to apply this construction to prove results on the…
In this paper we present an equivalent statement to the Jacobian conjecture. For a polynomial map F on an affine space of dimension n, we define recursively n finite sequences of polynomials. We give an equivalent condition to the…
For each prime $p$, let $I_p \subset \mathbb{Z}/p\mathbb{Z}$ denote a collection of residue classes modulo $p$ such that the cardinalities $|I_p|$ are bounded and about $1$ on average. We show that for sufficiently large $x$, the sifted set…
In this note we present a method to bound gaps between primes via the divergence of the series of reciprocals of the prime numbers, a consequence of a version of the Bertrand's test for convergence of series of positive numbers and a…
In this work initial numbers and repunit numbers have been studied. All numbers have been considered in a decimal notation. The problem of simplicity of initial numbers has been studied. Interesting properties of numbers repunit are proved:…
In the former article "Formal mathematical systems including a structural induction principle" we have presented a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the…
A composite positive integer $n$ is said to be a {\it weak Carmichael number} if $$ \sum_{\gcd(k,n)=1\atop 1\le k\le n-1}k^{n-1}\equiv \varphi(n) \pmod{n}. \leqno(1) $$ It is proved that a composite positive integer $n$ is a weak Carmichael…
Following the natural instinct that when a group operates on a number field then every term in the class number formula should factorize `compatibly' according to the representation theory (both complex and modular) of the group, we are led…
We prove a refined version of Markov's theorem in Diophantine approximation. More precisely, we characterize completely the set of irrationals $x$ such that $\left|x-\frac{p}{q}\right|<\frac{1}{3q^2}$ has only finitely many rational…
In this talk we discuss a class of Feynman integrals, which can be expressed to all orders in the dimensional regularisation parameter as iterated integrals of modular forms. We review the mathematical prerequisites related to elliptic…
We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…
Prime number multiplet classifications and patterns are extended to negative integers. The extension from prime numbers to single prime powers is also studied. Prime number septets at equal distance are given. It is also shown that each…
It is well known that the following Collatz Conjecture is one of the unsolved problems in mathematics. Collatz Conjecture: For any positive integer $n>1$, the following recursive algorithm will convergent to 1 by a finite number of steps.…
In 2020, Roger Baker \cite{Bak} proved a result on the exceptional set of moduli in the prime number theorem for arithmetic progressions of the following kind. Let $\mathcal{S}$ be a set of pairwise coprime moduli $q\le x^{9/40}$. Then the…