Related papers: Multidimensional $p$-adic continued fraction algor…
Continued fraction expansions provide a well-established bridge between algebraic properties of numbers and combinatorics on words. In this article, we investigate the algebraicity of $p$-adic numbers whose continued fractions arise from…
Multidimensional continued fractions generalize classical continued fractions with the aim of providing periodic representations of algebraic irrationalities by means of integer sequences. However, there does not exist any algorithm that…
In this paper, we introduce the polynomial continued fraction, a close relative of the well-known simple continued fraction expansions which are widely used in number theory and in general. While they may not possess all the intriguing…
Inspired by several alternative definitions of continued fraction expansions for elements in $\mathbb Q_p$, we study $p$-adically convergent periodic continued fractions with partial quotients in $\mathbb Z[1/p]$. To this end, following a…
We develop a theory of $p$-adic continued fractions for a quaternion algebra $B$ over $\mathbb Q$ ramified at a rational prime $p$. Many properties holding in the commutative case can be proven also in this setting. In particular, we focus…
We propose and study a generalized continued fraction algorithm that can be executed in an arbitrary imaginary quadratic field, the novelty being a non-restriction to the five Euclidean cases. Many hallmark properties of classical continued…
We study a natural extension to complex numbers of the standard continued fractions. The basic algorithm is due to Lagrange and Gauss, though it seems to have gone mostly unnoticed as a way to create continued fractions. The new…
Unlike the real case, there are not many studies and general techniques for providing simultaneous approximations in the field of $p$--adic numbers $\mathbb Q_p$. Here, we study the use of multidimensional continued fractions (MCFs) in this…
In this paper, we apply results on number systems based on continued fraction expansions to modular arithmetic. We provide two new algorithms in order to compute modular multiplication and modular division. The presented algorithms are…
Several conjectural continued fractions found with the help of various algorithms are published in this paper.
We first survey the current state of the art concerning the dynamical properties of multidimensional continued fraction algorithms defined dynamically as piecewise fractional maps and compare them with algorithms based on lattice reduction.…
We discuss continued fractions on real quadratic number fields of class number 1. If the field has the property of being 2-stage euclidean, a generalization of the euclidean algorithm can be used to compute these continued fractions.…
We describe various properties of continued fraction expansions of complex numbers in terms of Gaussian integers. Numerous distinct such expansions are possible for a complex number. They can be arrived at through various algorithms, as…
We prove an analog of Lagrange's Theorem for continued fractions on the Heisenberg group: points with an eventually periodic continued fraction expansion are those that satisfy a particular type of quadratic form, and vice-versa.
A method of constructing finite $p$-adic Sylvester expansions for all rationals is presented. This method parallels the classical Fibonacci-Sylvester (greedy) algorithm by iterating a $p$-adic division algorithm. The method extends to…
We consider expansions of vectors by a general class of multidimensional continued fraction algorithms. If the expansion is eventually periodic, then we describe the possible structure of a matrix corresponding to the repetend, and use it…
In this paper we study some problems related with the theory of multidimensional $p$-adic wavelets in connection with the theory of multidimensional $p$-adic pseudo-differential operators (in the $p$-adic Lizorkin space). We introduce a new…
In this paper, we study the complexity of p-adic continued fractions of a rational number, which is the p-adic analogue of the theorem of Lame. We calculate the length of Browkin expansion, and the length of Schneider expansion. Also, some…
Homogeneous continued fraction algorithms are multidimensional generalizations of the classical Euclidean algorithm, the dissipative map $$ (x_1,x_2) \in \mathbb{R}_+^2 \longmapsto \left\{\begin{array}{ll} (x_1 - x_2, x_2), & \mbox{if $x_1…
A method for approximating continuous functions $\mathbb{Z}_{p}^{n}\rightarrow\mathbb{Z}_{p}$ by a linear superposition of continuous functions $\mathbb{Z}_{p}\rightarrow\mathbb{Z}_{p}$ is presented and a polynomial regression model is…