Related papers: Regenerative random permutations of integers

Natural numbers which are nontrivial multiples of some permutation of their base-$b$ digit representations are called permutiples. Specific cases include numbers which are multiples of cyclic permutations (cyclic numbers) and reversals of…

Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation distance between the joint distribution of pattern occurrences…

We present examples of multiplicative semigroups of positive reals (Beurling's generalized integers) with gaps bounded from below.

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…

It is a well-known fact that genetic sequences may contain sections with repeated units, called repeats, that differ in length over a population, with a length distribution of geometric type. A simple class of recombination models with…

We consider permutations avoiding a pattern of length three under the family of Mallows distributions. In particular, for any pattern $\tau\in S_3-\{321\}$, we obtain rather precise results on the asymptotic probability as $n\to\infty$ that…

This paper investigates the effect of permutations on blocks of a prime reciprocal sequence on its randomness. A relationship between the number of permutations used and the improvement of performance is presented. This can be used as a…

A quiver mutation loop is a sequence of mutations and vertex relabelings, along which a quiver transforms back to the original form. For a given mutation loop, we introduce a quantity called a partition q-series. The partition q-series are…

We enumerate permutations that avoid all but one of the $k$ patterns of length $k$ starting with a monotone increasing subsequence of length $k-1$. We compare the size of such permutation classes to the size of the class of permutations…

A mutation loop of a valued quiver $Q$, is a combination of quiver automorphisms (permutations of vertices and valuations) and mutations that sends $Q$ to itself. In this article we study what we called \emph{global mutations loops} which…

The Hultman numbers enumerate permutations whose cycle graph has a given number of alternating cycles (they are relevant to the Bafna-Pevzner approach to genome comparison and genome rearrangements). We give two new interpretations of the…

The aim of this paper is to give a new approach to modified q-Bernstein polynomials for functions of two variables. By using these type polynomials, we derive recurrence formulas and some new interesting identities related to the second…

In this paper, we construct two classes of permutation polynomials over $\mathbb{F}_{q^2}$ with odd characteristic from rational R\'{e}dei functions. A complete characterization of their compositional inverses is also given. These…

For a polynomial P, we consider the sequence of iterated integrals of ln P(x). This sequence is expressed in terms of the zeros of P(x). In the special case of ln(1 + x^2), arithmetic properties of certain coefficients arising are…

We study the problem of counting alternating permutations avoiding collections of permutation patterns including 132. We construct a bijection between the set S_n(132) of 132-avoiding permutations and the set A_{2n + 1}(132) of alternating,…

We describe the Sylow $p$-groups of the group of polynomial permutations of the integers mod $p^n$.

In this paper, we consider the degenerate Carlitz q-Bernoulli numbers and polynomials and we investigate some properties of those polynomials.

We consider Reinforced Random Walks where transition probabilities are a function of the proportion of times the walk has traversed an edge. We give conditions for recurrence or transience. A phase transition is observed, similar to…

Previously, the author introduced quasirandom permutations, permutations of $\mathbb{Z}_n$ which map intervals to sets with low discrepancy. Here we show that several natural number-theoretic permutations are quasirandom, some very strongly…

We introduce the notion of a restricted exchangeable partition of $\mathbb{N}$. We obtain integral representations, consider associated fragmentations, embeddings into continuum random trees and convergence to such limit trees. In…