Related papers: Counting the Positive Rationals: A Brief Survey
The use of monoids in the study of word languages recognized by finite-state automata has been quite fruitful. In this work, we look at the same idea of "recognizability by finite monoids" for other monoids. In particular, we attempt to…
We provide a semi-grammatical description of the set of normal proofs of positive formulae in minimal predicate logic, i.e. a grammar that generates a set of schemes, from each of which we can produce a finite number of normal proofs. This…
We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results…
Counters that hold natural numbers are ubiquitous in modeling and verifying software systems; for example, they model dynamic creation and use of resources in concurrent programs. Unfortunately, such discrete counters often lead to…
Let $\mathbb{F}_q$ denote the finite field of odd characteristic $p$ with $q$ elements ($q=p^{n},n\in \mathbb{N} $) and $\mathbb{F}_q^*$ represent the nonzero elements of $\mathbb{F}_{q}$. In this paper, by using the Smith normal form we…
We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…
A famous problem posed by Diophantus was to find sets of distinct positive rational numbers such that the product of any two is one less than a rational square. Some sets of six such numbers are presented and the computational algorithm…
In this work initial numbers and repunit numbers have been studied. All numbers have been considered in a decimal notation. The problem of simplicity of initial numbers has been studied. Interesting properties of numbers repunit are proved:…
In this article, we present a binary tree with vertices given by rational functions $p(x)/q(x)$; the root and functional derivation of children are inspired by continued fractions. We prove some special properties of the tree. For example,…
An Egyptian fraction is a sum of distinct unit fractions (reciprocals of positive integers). We show that every rational number has Egyptian fraction representations where the number of terms is of the same order of magnitude as the largest…
We prove that a real number a greater than or equal to 2 is the irrationality exponent of some computable real number if and only if a is the upper limit of a computable sequence of rational numbers. Thus, there are computable real numbers…
We present some necessary and/or sufficient conditions for the positivity problem of three-term recurrence sequences. As applications we show the positivity of diagonal Taylor coefficients of some rational functions in a unified approach.…
We introduce a $q$-analog of the higher continued fractions introduced by the last three authors in a previous work (together with Gregg Musiker), which are simultaneously a generalization of the $q$-rational numbers of Morier-Genoud and…
We consider the question of approximating any real number $\alpha$ by sums of $n$ rational numbers $\frac{a_1}{q_1} + \frac{a_2}{q_2} + ... + \frac{a_n}{q_n}$ with denominators $1 \leq q_1, q_2, ..., q_n \leq N$. This leads to an inquiry on…
We describe a method that allows, under some hypotheses, to compute all the rational points of some genus 5 curves defined over a number field. This method is used to solve some arithmetic problems that remained open.
For a fixed integer $k \ge 0$, consider representations of positive integers as sums of binomial coefficients of the form $\binom{n}{k}$. While exact minimal bounds for the number of required summands are known only in a few low-dimensional…
We study the p-rationality of real quadratic fields in terms of generalized Fibonacci numbers and their periods modulo positive integers.
An additive submonoid of the nonnegative cone of the real line is called a positive monoid. Positive monoids consisting of rational numbers (also known as Puiseux monoids) have been the subject of several recent papers. Moreover, those…
Although the representation of the real numbers in terms of a base and a set of digits has a long history, new questions arise even in simple situations. This paper concerns binary radix systems, i.e., positional number systems with digits…
Goedel's functional "Dialectica" interpretation can be used to extract functional programs from non-constructive proofs in arithmetic by employing two sorts of higher-order witnessing terms: positive realisers and negative counterexamples.…