English
Related papers

Related papers: Counting the Positive Rationals: A Brief Survey

200 papers

Consider the representation of a rational number in the form, associated with "centered" Euclidean algorithm. We prove a new formula for the limit distribution function for sequences of rationals with bounded sum of partial quotients.

Number Theory · Mathematics 2011-10-25 Elena Zhabitskaya

In this paper, we propose a numerical method for verifying the positiveness of solutions to semilinear elliptic equations. We provide a sufficient condition for a solution to an elliptic equation to be positive in the domain of the…

Numerical Analysis · Mathematics 2016-07-05 Kazuaki Tanaka , Kouta Sekine , Shin'ichi Oishi

Proper continued fractions are generalized continued fractions with positive integer numerators $a_i$ and integer denominators with $b_i\geq a_i$. In this paper we study the strength of approximation of irrational numbers to their…

Dynamical Systems · Mathematics 2024-12-09 Niels Langeveld , David Ralston

The first part of this article deals with theorems on uniqueness in law for \sigma-finite and constructive countable random sets, which in contrast to the usual assumptions may have points of accumulation. We discuss and compare two…

Probability · Mathematics 2012-07-24 Philip Herriger

We study the number of factorizations of a positive integer, where the parts of the factorization are of l different colors (or kinds). Recursive or explicit formulas are derived for the case of unordered and ordered, distinct and…

Combinatorics · Mathematics 2020-08-25 Jacob Sprittulla

Let $X$ be an algebraic variety over a finite field $\bF_q$, homogeneous under a linear algebraic group. We show that the number of rational points of $X$ over $\bF_{q^n}$ is a periodic polynomial function of $q^n$ with integer…

Algebraic Geometry · Mathematics 2009-04-17 Michel Brion , Emmanuel Peyre

We consider the set of $n\times n$ matrices with rational entries having numerator and denominator of size at most $H$ and obtain upper and lower bounds on the number of such matrices of a given rank and then apply them to count such…

Number Theory · Mathematics 2026-03-04 Muhammad Afifurrahman , Vivian Kuperberg , Alina Ostafe , Igor E. Shparlinski

This article critically reappraises arguments in support of Cantor's theory of transfinite numbers. The following results are reported: i) Cantor's proofs of nondenumerability are refuted by analyzing the logical inconsistencies in…

General Mathematics · Mathematics 2010-02-25 J. A. Perez

Let $b \geq 2$ be an integer and $S$ be a finite non-empty set of primes not containing divisors of $b$. For any non-dense set $A \subset [0,1)$ such that $A \cap \mathbb{Q}$ is invariant under $\times b$ operation, we prove the finiteness…

Number Theory · Mathematics 2022-04-18 Bing Li , Ruofan Li , Yufeng Wu

Among all sequences that satisfy a divide-and-conquer recurrence, the sequences that are rational with respect to a numeration system are certainly the most immediate and most essential. Nevertheless, until recently they have not been…

Computational Complexity · Computer Science 2013-07-02 Philippe Dumas

This paper is a supplement to a talk for mathematics teachers given at the 2016 LSU Mathematics Contest for High School Students. The paper covers more details and aspects than could be covered in the talk. We start with an interesting…

History and Overview · Mathematics 2016-03-01 Lawrence Smolinsky

We prove some general recursions for the numbers of representations of positive integers as a sum x+y, x in X, y in Y, where X,Y are increasing sequences. In particular, we obtain recursions for the number of the Goldbach, Lemoine-Levy,…

Number Theory · Mathematics 2013-07-16 Vladimir Shevelev

Consider the representation of a rational number as a continued fraction, associated with "odd" Euclidean algorithm. In this paper we prove certain properties for the limit distribution function for sequences of rationals with bounded sum…

Number Theory · Mathematics 2011-10-25 Elena Zhabitskaya

Deciding the positivity of a sequence defined by a linear recurrence with polynomial coefficients and initial condition is difficult in general. Even in the case of recurrences with constant coefficients, it is known to be decidable only…

Symbolic Computation · Computer Science 2024-12-12 Alaa Ibrahim , Bruno Salvy

Godel numbering is an arithmetization of sintax which defines provability by coding a primitive recursive predicate, Pf(x,v). A multiplicity of researches and results all around this well-known recursive predicate are today widespread in…

Logic in Computer Science · Computer Science 2024-04-08 Paola Cattabriga

Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…

Logic in Computer Science · Computer Science 2007-12-11 Klaus Aehlig , Arnold Beckmann

The coefficient of x^{-1} of a formal Laurent series f(x) is called the formal residue of f(x). Many combinatorial numbers can be represented by the formal residues of hypergeometric terms. With these representations and the extended…

Combinatorics · Mathematics 2011-09-29 Qing-Hu Hou , Hai-Tao Jin

Continued fractions are used to give an alternate proof of $e^{x/y}$ is irrational.

History and Overview · Mathematics 2021-04-14 Sourangshu Ghosh

We present an approach to a large class of enumerative problems concerning rational curves in projective spaces. This approach uses analysis to obtain topological information about moduli spaces of stable maps. We demonstrate it by…

Algebraic Geometry · Mathematics 2014-11-11 Aleksey Zinger

The binomial convolution of two sequences $\{a_n\}$ and $\{b_n\}$ is the sequence whose $n$th term is $\sum_{k=0}^{n} \binom{n}{k} a_k b_{n-k}$. If $\{a_n\}$ and $\{b_n\}$ have rational generating functions then so does their binomial…

Combinatorics · Mathematics 2024-02-14 Ira M. Gessel , Ishan Kar