Related papers: Pell equation: A generalization of continued fract…
We study new primality tests based on linear recurrent sequences of degree two exploiting a matricial approach. The classical Lucas test arises as a particular case and we see how it can be easily improved. Moreover, this approach shows…
The credit on {\it reduction theory} goes back to the work of Lagrange, Gauss, Hermite, Korkin, Zolotarev, and Minkowski. Modern reduction theory is voluminous and includes the work of A. Lenstra, H. Lenstra and L. Lovasz who created the…
The main result is a generalization of Keller's recursion equation for finding a prime number given the previous primes. We also examine the convergence of the limit in Keller's equation and the convergence of the limit in the general…
Linear temporal logic (LTL) is a specification language for finite sequences (called traces) widely used in program verification, motion planning in robotics, process mining, and many other areas. We consider the problem of learning LTL…
In this paper we introduce a link between geometry of ordinary continued fractions and trajectories of points that moves according to the second Kepler law. We expand geometric interpretation of ordinary continued fractions to the case of…
Generalization remains a significant challenge in visual classification tasks, particularly in handling unknown classes in real-world applications. Existing research focuses on the class discovery paradigm, which tends to favor known…
The discrete-time, the quantum, and the continuous calculus of variations have been recently unified and extended. Two approaches are followed in the literature: one dealing with minimization of delta integrals; the other dealing with…
The cardinality of the set of $D\leqslant x$ for which the fundamental solution of the Pell equation $t^2-Du^2=1$ is less than $D^{\frac{1}{2}+\alpha}$ with $\alpha\in[\frac{1}{2},1]$ is studied and certain lower bounds are obtained,…
The often elusive Poincar\'e recurrence can be witnessed in a completely separable system. For such systems, the problem of recurrence reduces to the classic mathematical problem of simultaneous Diophantine approximation of multiple…
A relationship between continued fractions and Weyl groupoids of Cartan schemes of rank two is found. This allows to decide easily if a given Cartan scheme of rank two admits a finite root system. We obtain obstructions and sharp bounds for…
General fractional calculus offers an elegant and self-consistent path toward the generalization of fractional calculus to an enhanced class of kernels. Prabhakar's theory can be thought of, to some extent, as an explicit realization of…
We study a generalization of Pell's equation, whose coefficients are certain algebraic integers. Let $X_0=0$ and $X_n=\sqrt{2+X_{n-1}}$ for each $n\in \mathbb{Z}_{\ge 1}$. We study the $\mathbb{Z}[X_{n-1}]$-solutions of the equation…
We discuss the history of attempts to solve the Pell equation using certain auxiliary equations that correspond, in modern terminology, to a second 2-descent.
We introduce a fractional calculus on time scales using the theory of delta (or nabla) dynamic equations. The basic notions of fractional order integral and fractional order derivative on an arbitrary time scale are proposed, using the…
The low-rank alternating direction implicit (ADI) method is an efficient and effective solver for large-scale standard continuous-time algebraic Riccati equations that admit low-rank solutions. However, the existing low-rank ADI algorithm…
We establish new combinatorial transcendence criteria for continued fraction expansions. Let $\alpha = [0; a_1, a_2,...]$ be an algebraic number of degree at least three. One of our criteria implies that the sequence of partial quotients…
The algorithm of Shor for prime factorization is a hybrid algorithm consisting of a quantum part and a classical part. The main focus of the classical part is a continued fraction analysis. The presentation of this is often short, pointing…
Since the invention of the famous LLL algorithm, lattice reduction has been an extremely useful tool in computational number theory. By construction, the LLL algorithm deals with lattices living in a vector space endowed with a positive…
In this paper, for any positive integer $\ell\geq2,$ we define $\ell$-generalized Fibonacci zeta function. We then study its analytic continuation to the whole complex plane $\mathbb{C}.$ Further, we compute a possible list of singularities…
We give an algorithm that finds a sequence of approximations with Dirichlet coefficients bounded by a constant only depending on the dimension. The algorithm uses the LLL-algorithm for lattice basis reduction. We present a version of the…