Related papers: Distributive properties of the rationals
In this paper we analyse the dynamics of a family of rational operators coming from a fourth-order family of root-finding algorithms. We first show that it may be convenient to redefine the parameters to prevent redundancies and…
The abc conjecture, one of the most famous open problems in number theory, claims that three positive integers satisfying a+b=c cannot simultaneously have significant repetition among their prime factors; in particular, the product of the…
A quasigroup is a pair $(Q, *)$ where $Q$ is a non-empty set and $*$ is a binary operation on $Q$ such that for every $(a, b) \in Q^2$ there exists a unique $(x, y) \in Q^2$ such that $a*x=b=y*a$. Let $(Q, *)$ be a quasigroup. A pair $(x,…
A binary operator * over real numbers is said to be associative if $(x*y)*z=x*(y*z)$ and is said to be reducible if $x*y=x*z$ or $y*w=z*w$ if and only if $z=y$. The operation is said to have an identity element $\tilde{e}$ if…
Let $a=(a_1,\ldots,a_n)$ and $b=(b_1,\ldots,b_n)$ be two $n$-tuples of positive integers, let $X$ be a set of positive integers, and let $g$ be a positive integer. In this work we show an algorithmic process in order to compute all the sets…
We consider the new class $\boldsymbol{Q}$ of rational-infinitely (or quasi-infinitely) divisible distribution functions on the real line. By definition, $F\in \boldsymbol{Q}$ if there are some infinitely divisible distribution functions…
In this paper I demonstrate that any pair (m, n) of non-zero and distinct rational numbers may have, at most, four representations as the product of two rational factors such that the sum of factors of m coincides with the sum of factors of…
Simplification of fractional powers of positive rational numbers and of sums, products and powers of such numbers is taught in beginning algebra. Such numbers can often be expressed in many ways, as this article discusses in some detail.…
Given a natural number $k\ge 2$ and a $k$-automatic set $S$ of natural numbers, we show that the lower density and upper density of $S$ are recursively computable rational numbers and we provide an algorithm for computing these quantities.…
Given any oracle, A, we construct a basic sequence Q, computable in the jump of A, such that no A-computable real is Q-distribution-normal. A corollary to this is that there is a Delta^0_{n+1} basic sequence with respect to which no…
Receiver operating characteristics (ROCs) are a well-established representation of the tradeoff between detection and false alarm probabilities in classical binary hypothesis testing. We use classical ROCs as motivation for two types of…
This paper establishes a uniform procedure to split the operations in any algebraic operad, generalizing previous known notions of splitting algebraic structures from the dendriform algebra of Loday that splits the associative operation to…
We show that one can formulate an algebra with lattice ordering so as to contain one quantum and five classical operations as opposed to the standard formulation of the Hilbert space subspace algebra. The standard orthomodular lattice is…
We construct a countable family of multi-dimensional continued fraction algorithms, built out of five specific multidimensional continued fractions, and find a wide class of cubic irrational real numbers a so that either (a, a^2) or (a,…
In this paper, we consider the problem of order preservation under addition and multiplication operators over the vector space of univariate real-valued random variables. Consistent with the case of usual order over the real numbers-as…
A commutative order in a quaternion algebra is called selective if it is embeds into some, but not all, the maximal orders in the algebra. It is known that a given quadratic order over a number field can be selective in at most one…
We consider the design of a revenue-optimal mechanism when two items are available to be sold to a single buyer whose valuation is uniformly distributed over an arbitrary rectangle $[c_1,c_1+b_1]\times[c_2,c_2+b_2]$ in the positive…
Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…
Let $\mathcal{A}$ be a random set constructed by picking independently each element of $\{1, \dots, n\}$ with probability $\alpha \in (0, 1)$. We give a formula for the probability that a rational number $q$ belong to the random ratio set…
We study the class $\boldsymbol{Q}$ of distribution functions $F$ that have the property of rational-infinite divisibility: there exist some infinitely divisible distribution functions $F_1$ and $F_2$ such that $F_1=F*F_2$. The class…