Related papers: Some new primality criteria based on Lucas sequenc…

Let $H(n) = \prod_{p|n}\frac{p}{p-1}$ where $p$ ranges over the primes which divide $n$. It is well known that if $n$ is a primitive non-deficient number, then $H(n) > 2$. We examine inequalities of the form $H(n)> 2 + f(n)$ for various…

In 1876, Edouard Lucas showed that if an integer $b$ exists such that $b^{n-1} \equiv 1 (\mathrm{mod} \ n)$ and $b^{(n-1)/p} \not\equiv 1( \mathrm{mod} \ n)$ for all prime divisors $p$ of $n-1$ , then $n$ is prime, a result known as Lucas's…

Based on Euclid's algorithm, we find a kind of special sequences which play an interesting role in the study of primes. We call them W Sequences. They not only ties up the distribution of primes in short interval but also enables us to give…

We introduce an elementary argument to the theory of distribution of sequences modulo one.

This appendix to the beautiful paper of Ihara puts it in the context of infinite global fields of our papers. We study the behaviour of Euler--Kronecker constant $\gamma\_{K}$ when the discriminant (respectively, the genus) tends to…

The open problem of determining the exact value of the $n$-th linear polarization constant $c_n$ of $\R^n$ has received considerable attention over the past few years. This paper makes a contribution to the subject by providing a new lower…

Let $\tilde{\Phi}_n$ be a quasi-orthogonal polynomial of order 1 on the unit circle, obtained from an orthogonal polynomial $\Phi_n$ with measure $\mu$, which is in the Marcell\'{a}n class, if there exist another measure $\tilde{\mu}$ such…

The purpose of this paper is to construct new families of irreducible Gelfand-Tsetlin modules for U_q(gl_n). These modules have arbitrary singularity and Gelfand-Tsetlin multiplicities bounded by 2. Most previously known irreducible modules…

Hilbert's Entscheidungsproblem has given rise to a broad and productive line of research in mathematical logic, where the classification process of decidable classes of first-order sentences represent only one of the remarkable results.…

This paper addresses uncertainty propagation on unimodular matrix Lie groups that have a surjective exponential map. We derive the exact formula for the propagation of mean and covariance in a continuous-time setting from the governing…

We investigate the spectral properties of the product of $M$ complex non-Hermitian random matrices that are obtained by removing $L$ rows and columns of larger unitary random matrices uniformly distributed on the group ${\rm U}(N+L)$. Such…

The aim of this paper is to survey and extend results concerning bounds of the Euclidean minima of abelian number fields. In particular, we give upper bounds for the Euclidean minima of abelian number fields of prime power conductor.

This paper presents the Quanta Prime Sequence (QPS) and its foundational theorem, showcasing a unique class of polynomials with substantial implications. The study uncovers profound connections between Quanta Prime numbers and essential…

While decision theory provides an appealing normative framework for representing rich preference structures, eliciting utility or value functions typically incurs a large cost. For many applications involving interactive systems this…

Given a matrix $A\in \mathrm{GL}_d(\mathbb{Z})$. We study the pseudorandomness of vectors $\mathbf{u}_n$ generated by a linear recurrent relation of the form $$ \mathbf{u}_{n+1} \equiv A \mathbf{u}_n \pmod {p^t}, \qquad n = 0, 1, \ldots, $$…

The $k$th Dickson polynomial of the first kind, $D_k(x) \in {\mathbb Z}[x]$, is determined by the formula: $D_k(u+1/u) = u^k + 1/u^k$, where $k \ge 0$ and $u$ is an indeterminate. These polynomials are closely related to Chebyshev…

In this paper, we consider arithmetic progressions contained in Lucas sequences of first and second kind. We prove that for almost all sequences, there are only finitely many and their number can be effectively bounded. We also show that…

Assuming the Generalized Riemann Hypothesis, we prove the following: If b is an integer greater than one, then the multiplicative order of b modulo N is larger than N^(1-\epsilon) for all N in a density one subset of the integers. If A is a…

This paper is about the computability of the modal definability problem in classes of frames determined by Euclidean modal logics. We characterize those Euclidean modal logics such that the classes of frames they determine give rise to an…

Let $f$ be a measurable function satisfying $$f(x+1)=f(x), \qquad \int_0^1 f(x) dx=0, \qquad \textrm{Var} ~f < + \infty,$$ and let $(n_k)_{k\ge 1}$ be a sequence of integers satisfying $n_{k+1}/n_k \ge q >1$ $(k=1, 2, \ldots)$. By the…