English
Related papers

Related papers: The distribution of rationals in residue classes

200 papers

We show several properties related to the structure of the family of classes of two-dimensional periodic continued fractions. This approach to the study of the family of classes of nonequivalent two dimexsional periodic continued fractions…

Number Theory · Mathematics 2009-11-17 Oleg Karpenkov

A class of random discrete distributions $P$ is introduced by means of a recursive splitting of unity. Assuming supercritical branching, we show that for partitions induced by sampling from such $P$ a power growth of the number of blocks is…

Probability · Mathematics 2007-05-23 Alexander V. Gnedin , Yuri Yakubovich

This paper investigates the quadratic irrationals that arise as periodic points of the Gauss type shift associated to the odd continued fraction expansion. It is shown that these numbers, which we call O-reduced, when ordered by the length…

Number Theory · Mathematics 2022-03-03 Maria Siskaki

In this paper, we study various classes of partition functions such as those related to the parity of the number of parts, to differences of partition numbers, and to partitions with a repeated smallest part. We establish identities…

Combinatorics · Mathematics 2026-01-27 Rahul Kumar , Nargish Punia

A relative one-relator presentation has the form P = < X,H ; R > where X is a set, H is a group, and R is a group word on X and H. We show that if the group word on X obtained from R by deleting all the terms from H has what we call the…

Group Theory · Mathematics 2007-06-25 Stephen J Pride

Let $x$ be a irrational number in the unit interval and denote by its continued fraction expansion $[a_1(x), a_2(x), \cdots, a_n(x), \cdots]$. For any $n \geq 1$, write $T_n(x) = \max_{1 \leq k \leq n}\{a_k(x)\}$. We are interested in the…

Number Theory · Mathematics 2016-08-30 Lulu Fang , Kunkun Song

We examine a discrete random recursive tree growth process that, at each time step, either adds or deletes a node from the tree with probability $p$ and $1-p$, respectively. Node addition follows the usual uniform attachment model. For node…

Probability · Mathematics 2021-08-03 Arnold Saunders

We give combinatorial descriptions of the terms occurring in continuants of general continued fractions that diverge to three limits. Equating these with the usual combinatorial descriptions due to Euler, Sylvester, and Minding induces…

Combinatorics · Mathematics 2021-11-01 Douglas Bowman , Herman D. Schaumburg

In a recent paper, Henry Bradford showed that all sufficiently fast growing functions appear as the residual finiteness growth function of some group. In this paper we show that the groups there constructed are conjugacy separable and that…

Group Theory · Mathematics 2024-10-16 Lukas Vandeputte

We present a geometric way of describing the irrationality of a number using the area of a circular sector $A(r)$. We establish a connection between this and the continued fraction expansion of the number, and prove bounds for $A(r)$ as…

Number Theory · Mathematics 2017-01-30 Pedro Morales-Almazan

We construct a random model to study the distribution of class numbers in special families of real quadratic fields $\mathbb Q(\sqrt d)$ arising from continued fractions. These families are obtained by considering periodic continued…

Number Theory · Mathematics 2018-12-17 Alexander Dahl , Vítězslav Kala

In the standard formulation of the occupancy problem one considers the distribution of r balls in n cells, with each ball assigned independently to a given cell with probability 1/n. Although closed form expressions can be given for the…

Probability · Mathematics 2007-05-23 Paul Dupuis , Carl Nuzman , Phil Whiting

We establish $L^p$ estimates for multilinear multipliers acting on $(n-1)$-tuples of functions on $\mathbb{R}^d$. We assume that the multiplier satisfies symbol estimates outside a linear subspace of dimension $m$. The difficulty of proving…

Classical Analysis and ODEs · Mathematics 2025-03-20 Jianghao Zhang

Let $p$ be an odd prime number. In this article, we study the number of quadratic residues and non-residues modulo $p$ which are multiples of $2$ or $3$ or $4$ and lying in the interval $[1, p-1]$, by applying the Dirichlet's class number…

Number Theory · Mathematics 2019-01-30 Jaitra Chattopadhyay , Bidisha Roy , Subha Sarkar , R. Thangadurai

We establish a central limit theorem for counting large continued fraction digits $(a_n)$, i.e. we count occurrences $\{a_n>b_n\}$, where $(b_n)$ is a sequence of positive integers. Our result improves a similar result by Philipp which…

Probability · Mathematics 2021-12-02 Marc Kesseböhmer , Tanja Schindler

We studied two probabilistic models of the distribution of primes in the natural number [1].The paper considers the third probabilistic model of the distribution of primes in the natural number. The author proved that the results obtained…

Number Theory · Mathematics 2015-09-30 Victor Volfson

Given a classification problem and a family of classifiers, the Rashomon ratio measures the proportion of classifiers that yield less than a given loss. Previous work has explored the advantage of a large Rashomon ratio in the case of a…

Machine Learning · Computer Science 2024-04-30 Evzenie Coupkova , Mireille Boutin

In this paper Euler shows how, if we have recursive functions f,g,h and an infinite sequence A,B,C,... which satisfies fA=gB+hC, f'B=g'C+h'D, f''C=g''D+h''E, f'''D=g'''E+h'''F, etc., where the primes denote an index not a derivative, then…

History and Overview · Mathematics 2007-05-23 Leonhard Euler

Some type-based approaches to termination use sized types: an ordinal bound for the size of a data structure is stored in its type. A recursive function over a sized type is accepted if it is visible in the type system that recursive calls…

Programming Languages · Computer Science 2015-07-01 Andreas Abel

Conjunctive queries select and are expected to return certain tuples from a relational database. We study the potentially easier problem of counting all selected tuples, rather than enumerating them. In particular, we are interested in the…

Computational Complexity · Computer Science 2019-04-30 Holger Dell , Marc Roth , Philip Wellnitz