Related papers: Tabulating Absolute Lucas Pseudoprimes

For a tuple $(\theta_1,..,\theta_M)$ of complex number, buliding on the approximation techniques in earlier papers of this series, this paper engages in deducing lower estimates on the transcendence degree of the field generated by…

We introduce a new class of pseudoprimes-so called "overpseudoprimes" which is a special subclass of super-Poulet pseudoprimes. Denoting via h(n) the multiplicative order of 2 modulo n, we show that odd number n is overpseudoprime iff value…

We obtain a recursive formula for the characteristic number of degree $d$ curves in $\mathbb{P}^2$ with prescribed singularities (of type $A_k$) that are tangent to a given line. The formula is in terms of the characteristic number of…

We consider large non-Hermitian random matrices $X$ with complex, independent, identically distributed centred entries and show that the linear statistics of their eigenvalues are asymptotically Gaussian for test functions having…

We study the primitive divisors of the terms of $(\Delta_n)_{n \geq 1}$, where $\Delta_n=N_{K/ \mathbb{Q}}(u^n-1)$ for $K$ a real quadratic field, and $u>1$ a unit element of its ring of integers. The methods used allow us to find the terms…

In this case study in ``fully automated enumeration'', we illustrate how to take full advantage of symbolic computation by developing (what we call) `symbolic-dynamical-programming' algorithms for computing many terms of `hard to compute…

We introduce a natural definition for sums of the form \[ \sum_{\nu=1}^x f(\nu) \] when the number of terms x is a rather arbitrary real or even complex number. The resulting theory includes the known interpolation of the factorial by the…

Stewart (2013) proved that the biggest prime divisor of the $n$th term of a Lucas sequence of integers grows quicker than $n$, answering famous questions of Erd\H{o}s and Schinzel. In this note we obtain a fully explicit and, in a sense,…

The paper aims to establish the Tur\'an inequalities, the Laguerre inequalities (order $2$), and the determinantal inequalities (order $3$) for $\Delta p(n)$ and $\Delta \bar{p}(n)$, where $\Delta f(n)$ is the first-order forward difference…

In 1848, Hermite introduced a reduction theory for binary forms of degree $n$ which was developed more fully in the seminal 1917 treatise of Julia. This canonical method of reduction made use of a new, fundamental, but irrational…

A class of derivatives is defined for the pseudo determinant $Det(A)$ of a Hermitian matrix $A$. This class is shown to be non-empty and to have a unique, canonical member $\mathbf{\nabla Det}(A)=Det(A)A^+$, where $A^+$ is the Moore-Penrose…

In this paper, we present first results of our investigation regarding symbolic pseudo-differential calculi on nilpotent Lie groups. On any graded Lie group, we define classes of symbols using difference operators. The operators are…

In this paper, we first prove that for any strong divisibility sequences $\boldsymbol{a} = \left(a_n\right)_{n\geq 1}$, we have the identity: $\mathrm{lcm} \left\lbrace \binom{n}{0}_{\bf{a}}, \binom{n}{1}_{\bf{a}},\dots,…

In this article, we discuss some applications of the well-known Douglas factorization lemma in the context of von Neumann algebras. Let $\mathcal{B}(\mathscr{H})$ denote the set of bounded operators on a complex Hilbert space $\mathscr{H}$,…

For quadratic polynomials with an indifferent fixed point with bounded type rotation number (they have a Siegel disk), much of what is known of their Julia set comes from the study of a quasiconformal model. The model is build from a…

An algorithmic upper bound on the domination number $\gamma$ of graphs in terms of the order $n$ and the minimum degree $\delta$ is proved. It is demonstrated that the bound improves best previous bounds for any $5\le \delta \le 50$. In…

We introduce the concept of an almost prime number generalizing a prime number. It turns out that a composite almost prime number must be a Carmichael number, in case it exists. We prove several properties of almost prime numbers and…

Formal mathematics and computer science proofs are formalized using Hilbert-Russell-style logical systems which are designed to not admit paradoxes and self-refencing reasoning. These logical systems are natural way to describe and reason…

We study additive properties of consecutive prime numbers and the primality of the sums they generate. For a given prime number $p_n$, we consider the sums \[ S_k(p_n) = p_n + p_{n+1} + \cdots + p_{n+k-1}, \] where $k \ge 3$ is an odd…

In this paper we show the existence of approximate completely positive semidefinite (cpsd) factorizations with a cpsd-rank bounded above (almost) independently from the cpsd-rank of the initial matrix. This is particularly relevant since…