Related papers: A new explicit expansion approach to Mersenne prim…
In this paper, we introduce two primality tests based on new divisibility properties of binomial coefficients. These new properties were enunciated and proved in previous work. We also study two similar tests that can be obtained from…
A fairly general continuation theorem of Leray-Schauder type for the class of so-called admissible multimaps is set forth. This result is then used to establish a universal rule for solving operator inclusions of Hammerstein type in…
We use the arithmetic of the Kummer surface associated to the Jacobian of a hyperelliptic curve to study the primality of integers of the form $4m^2 5^n-1$. We provide an algorithm capable of proving the primality or compositeness of most…
We present a new topological proof of the infinitude of prime numbers with a new topology. Furthermore, in this topology, we characterize the infinitude of any non-empty subset of prime numbers.
In previous work on Clebsch-Gordan coefficients, certain remarkable hexagonal arrays of integers are constructed that display behaviors found in Pascal's Triangle. We explain these behaviors further using the binomial transform and discrete…
We obtain new bounds, pointwisely and on average, for Dedekind sums $\mathsf{s}(\lambda,p)$ modulo a prime $p$ with $\lambda$ of small multiplicative order $d$ modulo $p$. Assuming the infinitude of Mersenne primes, the range of our results…
We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…
The linear complexity is a measure for the unpredictability of a sequence over a finite field and thus for its suitability in cryptography. In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion…
We provide an explicit and algorithmic version of a theorem of Momose classifying isogenies of prime degree of elliptic curves over number fields, which we implement in Sage and PARI/GP. Combining this algorithm with recent work of…
We introduce a new type of reduction of inversive difference polynomials that is associated with a partition of the basic set of automorphisms $\sigma$ and uses a generalization of the concept of effective order of a difference polynomial.…
In this master's thesis, we introduce expansion systems as a general framework to describe a large variety of approximation algorithms, such as Taylor approximation, decimal expansion and continued fraction. We consider some basic…
Classifications of twin primes are established and then applied to triplets that generalize to all higher multiplets. Mersenne and Fermat twins and triplets are treated in this framework. Regular prime number multiplets are related to…
We prove an extension of the well-known combinatorial-topological lemma of E. Sperner to the case of infinite-dimensional cubes. It is obtained as a corollary to an infinitary extension of the Lebesgue Covering Dimension Theorem.
We investigate the analyticity property of the partially resummed series expansion(PRSE) of the partition function for the eight-vertex model. Developing a graphical technique, we have obtained a first few terms of the PRSE and found that…
We obtain an effective analytic formula, with explicit constants, for the number of distinct irreducible factors of a polynomial $f \in \mathbb{Z}[x]$. We use an explicit version of Mertens' theorem for number fields to estimate a related…
The goal of this note is to provide a recursive algorithm that allows one to calculate the expansion of the metric tensor up to the desired order in Riemann normal coordinates. We test our expressions up to fourth order and predict results…
In this note, we present an eighth-order derivative-free family of iterative methods for nonlinear equations. The proposed family shows optimal eight-order of convergence in the sense of the Kung and Traub conjecture \cite{5} and is based…
A new class of integrable mappings and chains is introduced. Corresponding $(1+2)$ integrable systems invariant with respect to such discrete transformations are presented in an explicit form. Their soliton-type solutions are constructed in…
In this paper we use a set of partial differential equations to prove an expansion theorem for multiple complex Hermite polynomials. This expansion theorem allows us to develop a systematic and completely new approach to the complex Hermite…
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.…