SearcharxivSearch

arXiv subjects

Onno M. Cain

Publications and source records attributed to Onno M. Cain.

3 recordsLinked to original sources

Inventory Loops (i.e. Counting Sequences) have Pre-period $2\max S_1+60$

An Inventory Sequence $(S_0, S_1, S_2, ...)$ is the iteration of the map $f$ defined roughly by taking an integer to its numericized description (e.g. $f(1381)=211318$ since "$1381$" has two $1$'s, one $3$, and one $8$). Our work analyzes the iteration under the infinite base. Any starting value of positive digits is known to be ultimately periodic [1] (e.g. $S_0=1381$ reaches the 1-cycle $f(3122331418)=3122331418$). Parametrizations of all possible cycles are also known [2,3]. We answer Bronstein and Fraenkel's open question of 26 years showing the pre-period of any such starting value is no more than $2M+60$ where $M=\max S_1$. And oddly the period of the cycle can be determined after only $O(\log\log M)$ iterations.

math.NT

Prime-bounded subwords

In the number $373$ all subwords ($3$, $7$, $37$, $73$, and $373$) are prime. Similarly, in $9719$ all subwords are divisible by at most one prime. And similarly again in $7319797913$ all subwords are divisible by at most two primes. These are the largest integers with their respective properties. We show for any $k\ge 1$ there are only finitely many integers having subwords divisible by at most $k$ primes. In fact, we show for any $B$ and $d$ coprime that $n$ contains a base-$B$ subword divisible by $d$ if $n>B^d$. So as example consequence, past a certain point every prime contains a subword divisible by say $10000000007$.

math.HO

Bioperational Multisets in Various Semi-rings

One can find lists of whole numbers having equal sum and product. We call such a creature a bioperational multiset. No one seems to have seriously studied them in areas outside whole numbers such as the rationals, Gaussian integers, or semi-rings. We enumerate all possible sum-products for a bioperational multiset over whole numbers and six additional domains.

math.RA