Related papers: Representation and coding of rational pairs on a T…
A triangle with rational sides and rational area is called a rational triangle. In this paper we consider three problems of finding pairs of rational triangles which have a common circumradius as well as either a common perimeter or a…
We define an extension of parity from the integers to the rational numbers. Three parity classes are found -- even, odd and `none'. Using the 2-adic valuation, we partition the rationals into subgroups with a rich algebraic structure. The…
Can we do arithmetic in a completely different way, with a radically different data structure? Could this approach provide practical benefits, like operations on giant numbers while having an average performance similar to traditional…
Based on Broise-Alamichel and Paulin's work on the Gauss map corresponding to the principal convergents, we continue the study of the Gauss map via Farey maps to contain all the intermediate convergents. We define the geometric Farey map,…
Diophantine quadruples are sets of four distinct positive integers such that the product of any two is one less than a square. All known examples belong to an infinite set which can be constructed recursively. Some observations on these…
Let $m_t(\alpha)$ denote the $t$-metric Mahler measure of the algebraic number $\alpha$. Recent work of the first author established that the infimum in $m_t(\alpha)$ is attained by a single point $\bar\alpha = (\alpha_1,\ldots,\alpha_N)\in…
Motivated by a concept studied in [1], we consider a property of matrices over finite fields that generalizes triangular totally nonsingular matrices to block matrices. We show that (1) matrices with this property suffice to construct good…
In this paper the properties of R\'edei rational functions are used to derive rational approximations for square roots and both Newton and Pad\'e approximations are given as particular cases. As a consequence, such approximations can be…
We prime-encode the natural numbers via recursive factorisation, iterated to the exponents, generating a corpus of planar rooted trees equivalently represented as Dyck words. This forms a deterministic text endowed with internal rules.…
Some properties of the optimal representation of numbers are investigated. This representation, which is to the base-e, is examined for coding of integers. An approximate representation without fractions that we call WF is introduced and…
To enumerate 3-manifold triangulations with a given property, one typically begins with a set of potential face pairing graphs (also known as dual 1-skeletons), and then attempts to flesh each graph out into full triangulations using an…
We introduce and study the {\em orderly spanning trees} of plane graphs. This algorithmic tool generalizes {\em canonical orderings}, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning…
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our…
We propose a procedure to build a decision tree which approximates the performance of complex machine learning models. This single approximation tree can be used to interpret and simplify the predicting pattern of random forests (RFs) and…
We construct bijections giving three "codes" for trees. These codes follow naturally from the Matrix Tree Theorem of Tutte and have many advantages over the one produced by Prufer in 1918. One algorithm gives explicitly a bijection that is…
We present efficient algorithms for computing a maximum agreement forest (MAF) of a pair of multifurcating (nonbinary) rooted trees. Our algorithms match the running times of the currently best algorithms for the binary case. The size of an…
The Farey sequence is a natural exhaustion of the set of rational numbers between 0 and 1 by finite lists. Ford Circles are a natural family of mutually tangent circles associated to Farey fractions: they are an important object of study in…
We consider the problem of approaching real numbers with rational numbers with prime denominator and with a single numerator allowed for each denominator. We obtain basic results, both probabilistic and deterministic, draw connections to…
We investigate the spectral properties of rooted trees with the intention of improving the currently existing results that deal with this matter. The concept of an assigned rational function is recursively defined for each vertex of a…
In this note, we discuss families of orbifolds underlying 6D SCFT F-theory models and find a novel pairing structure in the SCFT landscape. Inspection of the rational functions defining models with a common F-theory endpoint leads us to…