Related papers: Enumerating the rationals from left to right
We study metrical properties of various subsequences associated to the sequence of rational approximants coming from the continued fraction of an irrational number. Our methods build upon Bosma, Jager and Wiedijk's proof of the…
A Skolem sequence is a linear arrangement of the multiset, {1, 1, 2, 2, ..., n, n} such that if r in [n] appears in positions i and j, then |i-j| = r. We first translate the problem to a particular set of perfect matchings, then apply the…
Fibonacci polynomials are generalizations of Fibonacci numbers, so it is natural to consider polynomial versions of the various results for Fibonacci numbers. According to Hong, Pongsriiam, Bulawa, and Lee, the generating function of the…
We consider the problem of approaching real numbers with rational numbers with prime denominator and with a single numerator allowed for each denominator. We then present a simple application, related to possible correlations between trace…
We introduce a generalized $k$-FL sequence and special kind of pairs of real numbers that are related to it, and give an application on the integral solutions of a certain equation using those pairs. Also, we associate skew circulant and…
Our overall goal is to unify and extend some results in the literature related to the approximation of generating functions of finite and infinite sequences over a field by rational functions. In our approach, numerators play a significant…
Ordered logics and type systems have been used in a variety of applications including computational linguistics, memory allocation, stream processing, logical frameworks, parametricity, and enforcing security protocols. In most…
We construct a new scheme of approximation of any multivalued algebraic function $f(z)$ by a sequence $\{r_{n}(z)\}_{n\in \mathbb{N}}$ of rational functions. The latter sequence is generated by a recurrence relation which is completely…
Many kinds of data are naturally amenable to being treated as sequences. An example is text data, where a text may be seen as a sequence of words. Another example is clickstream data, where a data instance is a sequence of clicks made by a…
In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order with A. In definition 5 we redefine co-ordering for rational…
Rational approximations to a square root $\sqrt{k}$ can be produced by iterating the transformation $f(x) = (dx+k)/(x+d)$ starting from $\infty$ for any positive integer $d$. We show that these approximations coincide infinitely often with…
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…
In this paper, we connect two well established theories, the Fibonacci numbers and the Jordan algebras. We give a series of matrices, from literature, used to obtain recurrence relations of second-order and polynomial sequences. We also…
In this paper, we investigate the representations of rational numbers via continued fraction, Egyptian fraction, and Engel fraction expansions. Given $m \in \mathbb{N}$, denote by $C_m, E_m, E_m^*$ the sets of rational numbers whose…
We discuss a particular problem of enumerating rational curves on a Grassmannian from several perspectives, including systems theory, real enumerative geometry, and symbolic computation. We also present a new transversality result, showing…
One distinguishing feature of rational curves is that they have algebraic parameterizations. Arc spaces are a way of describing approximations to parameterizations of all curves in some fixed space. Playing on these descriptions, this paper…
We consider a family of integer sequences generated by nonlinear recurrences of the second order, which have the curious property that the terms of the sequence, and integer multiples of the ratios of successive terms (which are also…
Disproving a conjecture of Bleicher and Erd\H{o}s, we show that there exists a lacunary sequence of positive integers such that finite sums of reciprocals of its terms attain all rational numbers from a non-empty open interval. We also…
For a linear code $C$ of length $n$ with dimension $k$ and minimum distance $d$, it is desirable that the quantity $kd/n$ is large. Given an arbitrary field $\mathbb{F}$, we introduce a novel, but elementary, construction that produces a…
We introduce an algorithmic approach based on generating tree method for enumerating the inversion sequences with various pattern-avoidance restrictions. For a given set of patterns, we propose an algorithm that outputs either an accurate…