English
Related papers

Related papers: Creepers: Real quadratic orders with large class n…

200 papers

We show that for each positive integer $a$ there exist only finitely many prime numbers $p$ such that $a$ appears an odd number of times in the period of continued fraction of $\sqrt{p}$ or $\sqrt{2p}$. We also prove that if $p$ is a prime…

Number Theory · Mathematics 2023-09-04 Vítězslav Kala , Piotr Miska

Let $p$ and $q$ be positive integers. The $(p, q)$-leaper $L$ is a generalised knight which leaps $p$ units away along one coordinate axis and $q$ units away along the other. Consider a free $L$, meaning that $p + q$ is odd and $p$ and $q$…

Combinatorics · Mathematics 2022-05-24 Nikolai Beluhov

We give a new characterization of maximal repetitions (or runs) in strings based on Lyndon words. The characterization leads to a proof of what was known as the "runs" conjecture (Kolpakov \& Kucherov (FOCS '99)), which states that the…

Discrete Mathematics · Computer Science 2018-07-03 Hideo Bannai , Tomohiro I , Shunsuke Inenaga , Yuto Nakashima , Masayuki Takeda , Kazuya Tsuruta

Let $g>1$ be an integer and $f(X)\in{\mathbb Z}[X]$ a polynomial of positive degree with no multiple roots, and put $u(n)=f(g^n)$. In this note, we study the sequence of quadratic fields ${\mathbb Q}(\sqrt{u(n)}\,)$ as $n$ varies over the…

Number Theory · Mathematics 2016-02-23 William D. Banks , Igor E. Shparlinski

We construct a countable family of multi-dimensional continued fraction algorithms, built out of five specific multidimensional continued fractions, and find a wide class of cubic irrational real numbers a so that either (a, a^2) or (a,…

In this note, we study the problem of existence of sequences of consecutive 1's in the periodic part of the continued fractions expansions of square roots of primes. We prove unconditionally that, for a given $N\gg 1$, there are at least…

Number Theory · Mathematics 2019-04-09 Piotr Miska , Maciej Ulas

A sequence $S=s_{1}s_{2}..._{n}$ is \emph{nonrepetitive} if no two adjacent blocks of $S$ are identical. In 1906 Thue proved that there exist arbitrarily long nonrepetitive sequences over 3-element set of symbols. We study a generalization…

Combinatorics · Mathematics 2011-04-15 Jarosław Grytczuk , Jakub Kozik , Marcin Witkowski

We prove that the statistics of the period of the continued fraction expansion of certain sequences of quadratic irrationals from a fixed quadratic field approach the `normal' statistics given by the Gauss-Kuzmin measure. As a by-product,…

Dynamical Systems · Mathematics 2013-02-22 Menny Aka , Uri Shapira

For a given positive integer $k$, we prove that there are at least $x^{1/2-o(1)}$ integers $d\leq x$ such that the real quadratic fields $\mathbb Q(\sqrt{d+1}),\dots,\mathbb Q(\sqrt{d+k})$ have class numbers essentially as large as…

Number Theory · Mathematics 2023-07-18 Giacomo Cherubini , Alessandro Fazzari , Andrew Granville , Vítězslav Kala , Pavlo Yatsyna

Continued fractions in the field of $p$--adic numbers have been recently studied by several authors. It is known that the real continued fraction of a positive quadratic irrational is eventually periodic (Lagrange's Theorem). It is still…

Number Theory · Mathematics 2023-05-22 Nadir Murru , Giuliano Romeo

We study the generalized continued fraction expansions of complex numbers in term of elements from Euclidean subrings, especially Gaussian or Eisenstein integers, in a general framework as pursued in [3] and [1]. We introduce a common…

Number Theory · Mathematics 2023-01-18 S. G. Dani , Ojas Sahasrabudhe

We prove a number of results related to a problem of Po-Shen Loh, which is equivalent to a problem in Ramsey theory. Let $a=(a_1,a_2,a_3)$ and $b=(b_1,b_2,b_3)$ be two triples of integers. Define $a$ to be 2-less than $b$ if $a_i<b_i$ for…

Combinatorics · Mathematics 2023-06-22 W. T. Gowers , J. Long

Quadratic irrationals posses a periodic continued fraction expansion. Much less is known about cubic irrationals. We do not even know if the partial quotients are bounded, even though extensive computations suggest they might follow…

Number Theory · Mathematics 2011-08-02 Mitja Lakner , Peter Petek , Marjeta Škapin Rugelj

We generalize the classical theory of periodic continued fractions (PCFs) over ${\mathbf Z}$ to rings ${\mathcal O}$ of $S$-integers in a number field. Let ${\mathcal B}=\{\beta, {\beta^*}\}$ be the multi-set of roots of a quadratic…

Number Theory · Mathematics 2022-12-02 Bradley W. Brock , Noam D. Elkies , Bruce W. Jordan

Motivated by the problem of routing reliably and scalably in a graph, we introduce the notion of a splicer, the union of spanning trees of a graph. We prove that for any bounded-degree n-vertex graph, the union of two random spanning trees…

Discrete Mathematics · Computer Science 2008-07-10 Navin Goyal , Luis Rademacher , Santosh Vempala

We introduce the concept of Minkowski normality, a different type of normality for the regular continued fraction expansion. We use the ordering \[ \frac{1}{2},\quad \frac{1}{3}, \frac{2}{3},\quad \frac{1}{4}, \frac{3}{4},\frac{2}{5},…

Dynamical Systems · Mathematics 2019-02-28 K. Dajani , M. R. de Lepper , E. A. Robinson

A rollercoaster is a sequence of real numbers for which every maximal contiguous subsequence, that is increasing or decreasing, has length at least three. By translating this sequence to a set of points in the plane, a rollercoaster can be…

Computational Geometry · Computer Science 2018-01-29 Therese Biedl , Ahmad Biniaz , Robert Cummings , Anna Lubiw , Florin Manea , Dirk Nowotka , Jeffrey Shallit

We investigate the efficiency of several types of continued fraction expansions of a number in the unit interval using a generalization of Lochs theorem from 1964. Thus, we aimed to compare the efficiency by describing the rate at which the…

Number Theory · Mathematics 2021-01-26 Dan Lascu , Gabriela Ileana Sebe

Several sequences of free cumulants that count binary plane trees correspond to sequences of classical cumulants that count the decreasing versions of the same trees. Using two new operations on colored binary plane trees that we call…

Combinatorics · Mathematics 2022-01-12 Colin Defant

Graph spanners are sparse subgraphs that faithfully preserve the distances in the original graph up to small stretch. Spanner have been studied extensively as they have a wide range of applications ranging from distance oracles, labeling…

Data Structures and Algorithms · Computer Science 2018-05-16 Merav Parter , Eylon Yogev