Related papers: An Analytic Heuristic for Multiplicity Computation…

Shimura's conjectire (1963) concerns the rationality of the generating series for Hecke operators for the symplectic group of genus g. This conjecture wes proved by Andrianov for arbitrary genus g. For genus g=4, we explicify the rational…

Zaremba's conjecture (1971) states that every positive integer number $d$ can be represented as a denominator (continuant) of a finite continued fraction $\frac{b}{d}=[d_1,d_2,\ldots,d_{k}],$ with all partial quotients…

We prove an explicit formula for infinitely many convergents of Hurwitzian continued fractions that repeat several copies of the same constant and elements of one arithmetic progression, in a quasi-periodic fashion. The proof involves…

We prove, in particular, the well--known Zaremba conjecture from the theory of continued fractions for any prime denominator. More precisely, we show, firstly, that under some mild conditions, for any sufficiently large $q$, there exists…

The goal of this paper is to formulate a systematical method for constructing the fastest possible continued fraction approximations of a class of functions. The main tools are the multiple-correction method, the generalized Mortici's lemma…

We prove there exists a density one subset $\dd \subset \N$ such that each $n \in \dd$ is the denominator of a finite continued fraction with partial quotients bounded by 5.

We identify all small groups of order up to 288 in the GAP Library for which the Zassenhaus conjecture on rational conjugacy of units of finite order in the integral group ring cannot be established by an existing method. The groups must…

We present a conjecture on multiplicity of irreducible representations of a subgroup $H$ contained in the irreducible representations of a group $G$, with $G$ and $H$ having the same derived groups. We point out some consequences of the…

The Ramanujan Machine project predicts new continued fraction representations of numbers expressed by important mathematical constants. Generally, the value of a continued fraction is found by reducing it to a second order linear difference…

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…

We prove a suite of dynamical results, including exactness of the transformation and piecewise-analyticity of the invariant measure, for a family of continued fraction systems, including specific examples over reals, complex numbers,…

Let G be a reductive algebraic group over Q, and suppose that Gamma is an arithmetic subgroup of G(R) defined by congruence conditions. A basic problem in arithmetic is to determine the multiplicities of discrete series representations in…

This paper concerns extension of the classical Lagrange theorem, on the eventual periodicity of continued fraction expansions of quadratic surds, and the versions of it found in the literature in the case of complex numbers. In this…

Julia Robinson has given a first-order definition of the rational integers Z in the rational numbers Q by a formula (\forall \exists \forall \exists)(F=0) where the \forall-quantifiers run over a total of 8 variables, and where F is a…

We show that lambda calculus is a computation model which can step by step simulate any sequential deterministic algorithm for any computable function over integers or words or any datatype. More formally, given an algorithm above a family…

Recently, W. M. Schmidt and L. Summerer developed a new theory called Parametric Geometry of Numbers which approximates the behaviour of the successive minima of a family of convex bodies in $\mathbb{R}^{n}$ related to the problem of…

We prove bounds for the popularity of products of sets with weak additive structure, and use these bounds to prove results about continued fractions. Namely, we obtain a nearly sharp upper bound for the cardinality of Zaremba's set modulo…

The article presents a generalization of the classical Hardy-Littlewood conjecture concerning the density of prime tuples to the case of tuples consisting of almost-prime numbers (numbers with a specified quantity of prime divisors). The…

We introduce the notion of matrices graph, defining continued fraction algorithms where the past and the future are almost independent. We provide an algorithm to convert more general algorithms into matrices graphs. We present an algorithm…

For $n > 2$, let $\Gamma$ denote either $SL(n, Z)$ or $Sp(n, Z)$. We give a practical algorithm to compute the level of the maximal principal congruence subgroup in an arithmetic group $H\leq \Gamma$. This forms the main component of our…