相关论文: Complex continued fractions, Kleinian and extremal…

In this paper, we investigate the distribution of the maximum of partial sums of certain cubic exponential sums, commonly known as "Birch sums". Our main theorem gives upper and lower bounds (of nearly the same order of magnitude) for the…

We consider a family of continued fraction expansions of any number in the unit closed interval $[0,1]$ whose digits are differences of consecutive non-positive integer powers of an integer $m \geq 2$. For this expansion, we apply the…

We consider infinite iterated function systems $\{f_i\}_{i=1}^{\infty}$ on $[0,1]$ with a polynomially increasing contraction rate. We look at subsets of such systems where we only allow iterates $f_{i_1}\circ f_{i_2}\circ f_{i_3}\circ...$…

We carry out a detailed investigation of congruence half-factorial Krull monoids with finite cyclic class group and related problems. Specifically, we determine precisely all relatively large values that can occur as a minimal distance of a…

The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise quantum walks have shown much potential as a frame- work for developing new quantum algorithms.…

We show that the number of digits in the integers of a creative telescoping relation of expected minimal order for a bivariate proper hypergeometric term has essentially cubic growth with the problem size. For telescopers of higher order…

A discrete rotation algorithm can be apprehended as a parametric application $f\_\alpha$ from $\ZZ[i]$ to $\ZZ[i]$, whose resulting permutation ``looks like'' the map induced by an Euclidean rotation. For this kind of algorithm, to be…

We prove the convergence of a wide class of continued fractions, including generalized continued fractions over quaternions and octonions. Fractional points in these systems are not bounded away from the unit sphere, so that the iteration…

We investigate the finite subgroups that occur in the Hamiltonian quaternion algebra over the real subfield of cyclotomic fields. When possible, we investigate their distribution among the maximal orders.

We investigate the number of steps taken by three variants of the Euclidean algorithm on average over Farey fractions. We show asymptotic formulae for these averages restricted to the interval $(0,1/2)$, establishing that they behave…

In this paper, we will first summarize known results concerning continued fractions. Then we will limit our consideration to continued fractions of quadratic numbers. The second author described periods and sometimes precise form of…

We give a new algorithm of slow continued fraction expansion related to any real cubic number field as a 2-dimensional version of the Farey map. Using our algorithm, we can find the generators of dual substitutions (so-called tiling…

Zaremba's conjecture concerns a formation of continued fraction expansions for rational numbers with partial quotient bounded by an absolute constant. We present asymptotic estimates for the size of $\epsilon$-thickening of certain fractal…

By a classical result of Gauss and Kuzmin, the continued fraction expansion of a ``random'' real number contains each digit $a\in\mathbb{N}$ with asymptotic frequency $\log_2(1+1/(a(a+2)))$. We generalize this result in two directions:…

Building on the results of our previous work on Euclidean leaper tours, considering all integers $k>1$ and $h>0$, we study the existence of Hamiltonian cycles in the vertex set $C(2,k):=\{0,1\}^k$ of the $k$-dimensional hypercube when the…

A set of segments in the plane may form a Euclidean TSP tour or a matching, among others. Optimal TSP tours as well as minimum weight perfect matchings have no crossing segments, but several heuristics and approximation algorithms may…

In usual restriction terms of the Quadratic Unconstrained Binary Optimization (QUBO) hamiltonians, a integer number of logical qubits R, called the Integer Restriction Coefficient (IRC), are forced to stay active. In this paper we gather…

Hurwitz (1887) defined a continued fraction algorithm for complex numbers which is better behaved in many respects than a more "natural" extension of the classical continued fraction algorithm to the complex plane would be. Although the…

We propose constructions of codes over quotient rings of Eisenstein integers equipped with the Euclidean, square Euclidean, and hexagonal distances as a generalization of codes over Eisenstein integer fields. By set partitioning, we…

We consider a special class of periodic continued fractions (called alpha-fractions) and discuss the related algebraic and geometric problems. A classical description of the Jacobi variety of a hyperelliptic curve due to Jacobi naturally…