Related papers: Distributive properties of the rationals

Sorting is a common and ubiquitous activity for computers. It is not surprising that there exist a plethora of sorting algorithms. For all the sorting algorithms, it is an accepted performance limit that sorting algorithms are linearithmic…

The octonions are one of the four normed division algebras, together with the real, complex and quaternion number systems. The latter three hold a primary place in random matrix theory, where in applications to quantum physics they are…

The theory of two binary relations has the strong amalgamation property when the first relation is assumed to be coarser than the second relation, and each relation satisfies a chosen set of properties from the following list: transitivity,…

In this paper we mainly study sums of four rational squares with certain restrictions. Let $\mathbb Q_{\ge0}$ be the set of nonnegative rational numbers. We establish the following four-square theorem for rational numbers: For any…

The notion of difference between two quantities plays a basic role in mathematics, consequently in all branches of human activity where the mathematics is applied. However the long stand question is: what is the difference between three (or…

This paper studies the minimal length representation of the natural numbers. Let O be a fixed set of integer-valued functions (primarily hyperoperations). For each n, what is the shortest way of expressing n as a combinations of functions…

For a rational number $q$, a rational $D(q)$-$n$-tuple is a set of $n$ distinct nonzero rationals $\{a_1, a_2, \dots, a_n\}$ such that $a_ia_j+q$ is a rational square for all $1 \leqslant i < j \leqslant n$. For every $q$ we find all…

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…

The theory of addition in the domains of natural (N), integer (Z), rational (Q), real (R) and complex (C) numbers is decidable, so is the theory of multiplication in all those domains. By Godel's Incompleteness Theorem the theory of…

We pose 100 new conjectures on representations involving primes or related things, which might interest number theorists and stimulate further research. Below are five typical examples: (i) For any positive integer $n$, there exists…

By considering generalized logarithm and exponential functions used in nonextensive statistics, the four usual algebraic operators : addition, subtraction, product and division, are generalized. The properties of the generalized operators…

We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…

Let $\Delta_x f(x,y)=f(x+1,y)-f(x,y)$ and $\Delta_y f(x,y)=f(x,y+1)-f(x,y)$ be the difference operators with respect to $x$ and $y$. A rational function $f(x,y)$ is called summable if there exist rational functions $g(x,y)$ and $h(x,y)$…

The classic model of computable randomness considers martingales that take real or rational values. Recent work by Bienvenu et al. (2012) and Teutsch (2014) shows that fundamental features of the classic model change when the martingales…

We consider a rational system of first order difference equations in the plane with four parameters such that all fractions have a common denominator. We study, for the different values of the parameters, the global and local properties of…

Ordinary binary multiplication of natural numbers can be generalized in a non-trivial way to a ternary operation by considering discrete volumes of lattice hexagons. With this operation, a natural notion of `3-primality' -- primality with…

We prove an identity for five arguments, valid in the lattice of natural numbers with gcd and lcm as lattice operations. More generally, this identity characterizes arbitrary distributive lattices. Fixing three of the five arguments, we…

In this expository paper we describe four primality tests. The first test is very efficient, but is only capable of proving that a given number is either composite or 'very probably' prime. The second test is a deterministic polynomial time…

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…

The extension problem asks whether positive semi-definite functions on a symmetric unital subset of a discrete group can be extended to positive semi-definite functions on the whole group. It has been known at least since the work of Rudin…