Related papers: Carry Propagation in Multiplication by Constants

We first introduce the Hamming distance between two strings. Then, we apply this concept to the representations of whole numbers in base n for all positive integers n > 2. We claim that a simple formula exists for the sum of all Hamming…

Let us call a sequence of numbers heapable if they can be sequentially inserted to form a binary tree with the heap property, where each insertion subsequent to the first occurs at a leaf of the tree, i.e. below a previously placed number.…

We define a new mass transport model on a one-dimensional lattice of size $N$ with continuous masses at each site. The lattice is connected to mass reservoirs of different `chemical potentials' at the two ends. The mass transfer dynamics in…

We study the factorised steady state of a general class of mass transport models in which mass, a conserved quantity, is transferred stochastically between sites. Condensation in such models is exhibited when above a critical mass density…

We give the distribution of $M_n$, the maximum of a sequence of $n$ observations from a moving average of order 1. Solutions are first given in terms of repeated integrals and then for the case where the underlying independent random…

We consider the problem of determining the maximum number of moves required to sort a permutation of $[n]$ using cut-and-paste operations, in which a segment is cut out and then pasted into the remaining string, possibly reversed. We give…

A length-$n$ random sequence $X_1,\ldots,X_n$ in a space $S$ is finitely exchangeable if its distribution is invariant under all $n!$ permutations of coordinates. Given $N > n$, we study the extendibility problem: when is it the case that…

Let $X_1, X_2, ..., X_n, ... $ be a sequence of iid random variables with values in a finite alphabet $\{1,...,m\}$. Let $LI_n$ be the length of the longest increasing subsequence of $X_1, X_2, ..., X_n.$ We express the limiting…

A probability distribution is n-divisible if its nth convolution root exists. While modeling the dependence structure between several (re)insurance losses by an additive risk factor model, the infinite divisibility, that is the…

Two old conjectures from problem sections, one of which from SIAM Review, concern the question of finding distributions that maximize P(Sn <= t), where Sn is the sum of i.i.d. random variables X1, ..., Xn on the interval [0,1], satisfying…

We consider a stack sorting algorithm where only the appropriate output values are popped from the stack and then any remaining entries in the stack are run through the stack in reverse order. We identify the basis for the $2$-reverse pass…

A predictive distribution over a sequence of $N+1$ events is said to be "frequency mimicking" whenever the probability for the final event conditioned on the outcome of the first $N$ events equals the relative frequency of successes among…

A random $n$-permutation may be generated by sequentially removing random cards $C_1,...,C_n$ from an $n$-card deck $D = \{1,...,n\}$. The permutation $\sigma$ is simply the sequence of cards in the order they are removed. This permutation…

We study how the order of N independent random walks in one dimension evolves with time. Our focus is statistical properties of the inversion number m, defined as the number of pairs that are out of sort with respect to the initial…

I explore a theory of transport and optical properties of strange metallic carriers in strongly correlated systems that follows from assuming that the diffusion constant has reached its quantum limit $D=\hbar/m$, and that such quantum…

We developed an algorithm that easily goes from one odd number to the next odd number in binary representation for the reduced forward Collatz map (Syracuse function). The algorithm indicates when an odd number can grow or shrink to the…

We are concerned with the general problem of proving the existence of joint distributions of two discrete random variables $M$ and $N$ subject to infinitely many constraints of the form $\mathbb{P}\left(M=i,N=j\right)=0$. In particular, the…

We study the space requirements of a sorting algorithm where only items that at the end will be adjacent are kept together. This is equivalent to the following combinatorial problem: Consider a string of fixed length n that starts as a…

Two closely related discrete probability distributions are introduced. In each case the support is a set of vectors in $\mathbb{R}^n$ obtained from the partitions of the fixed positive integer $n$. These distributions arise naturally when…

We study the long range percolation model on $\mathbb{Z}$ where sites $i$ and $j$ are connected with probability $\beta |i-j|^{-s}$. Graph distances are now well understood for all exponents $s$ except in the case $s=2$ where the model…