相关论文: Permutation graphs, fast forward permutations, and…

In this article we consider the cycle structure of compositions of pairs of involutions in the symmetric group S_n chosen uniformly at random. These can be modeled as modified 2-regular graphs, giving rise to exponential generating…

We consider permutations of $\{1,...,n\}$ obtained by $\lfloor\sqrt{n}t\rfloor$ independent applications of random stirring. In each step the same marked stirring element is transposed with probability $1/n$ with any one of the $n$…

Given a real number beta>1, a permutation pi of length n is realized by the beta-shift if there is some x in [0,1] such that the relative order of the sequence x,f(x),...,f^{n-1}(x), where f(x) is the factional part of beta*x, is the same…

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…

Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. The authors of [2] showed that the expected number of distinct consecutive patterns of all lengths $k\in\{1,2,\ldots,n\}$ in $\pi_n$ was $\frac{n^2}{2}(1-o(1))$ as $n\to\infty$,…

The purpose of this note is to point out that the theory of expander graphs leads to an interesting test whether $n$ real numbers $x_1, \dots, x_n$ could be $n$ independent samples of a random variable. To any distinct, real numbers $x_1,…

Let $f$ be a permutation from $\mathbb{N}_0$ onto $\mathbb{N}_0$. Let $x\in\mathbb{N}_0$ and consider a (finite or infinite) sequence $s= (x,f(x),f^2(x),\cdots)$. We call $s$ a permutation sequence. Let $D$ be the set of elements of $s$. If…

We prove several general formulas for the distributions of various permutation statistics over any set of permutations whose quasisymmetric generating function is a symmetric function. Our formulas involve certain kinds of plethystic…

For permutations P and T of lengths |P|\le|T|, let t(P,T) be the probability that the restriction of T to a random |P|-point set is (order) isomorphic to P. We show that every sequence \{T_j\} of permutations such that |T_j|\to\infty and…

Given a permutation sigma of the integers {-n,-n+1,...,n} we consider the Markov chain X_{sigma}, which jumps from k to sigma (k\pm 1) equally likely if k\neq -n,n. We prove that the expected hitting time of {-n,n} starting from any point…

The periodic discrete Toda equation defined over finite fields has been studied. We obtained the finite graph structures constructed by the network of states where edges denote possible time evolutions. We simplify the graphs by introducing…

A foundation model like GPT elicits many emergent abilities, owing to the pre-training with broad inclusion of data and the use of the powerful Transformer architecture. While foundation models in natural languages are prevalent, can we…

An involution is a permutation that is its own inverse. Given a permutation $\sigma$ of $[n],$ let $\mathbf{N}_{n}(\sigma)$ denote the number of ways to write $\sigma$ as a product of two involutions of $[n].$ If we endow the symmetric…

Quantum query complexity is typically characterized in terms of XOR queries |x,y> to |x,y+f(x)> or phase queries, which ensure that even queries to non-invertible functions are unitary. When querying a permutation, another natural model is…

A permutation array $A$ is a set of permutations on a finite set $\Omega$, say of size $n$. Given distinct permutations $\pi, \sigma\in \Omega$, we let $hd(\pi, \sigma) = |\{ x\in \Omega: \pi(x) \ne \sigma(x) \}|$, called the Hamming…

A permutation on an alphabet $ \Sigma $, is a sequence where every element in $ \Sigma $ occurs precisely once. Given a permutation $ \pi $= ($\pi_{1} $, $ \pi_{2} $, $ \pi_{3} $,....., $ \pi_{n} $) over the alphabet $ \Sigma $ =$\{ $0, 1,…

We prove that if x^m + c*x^n permutes the prime field GF(p), where m>n>0 and c is in GF(p)^*, then gcd(m-n,p-1) > sqrt{p} - 1. Conversely, we prove that if q>=4 and m>n>0 are fixed and satisfy gcd(m-n,q-1) > 2q*(log log q)/(log q), then…

For random graphs, the containment problem considers the probability that a binomial random graph $G(n,p)$ contains a given graph as a substructure. When asking for the graph as a topological minor, i.e., for a copy of a subdivision of the…

The permutation language $P_n$ consists of all words that are permutations of a fixed alphabet of size $n$. Using divide-and-conquer, we construct a regular expression $R_n$ that specifies $P_n$. We then give explicit bounds for the length…

We study the number of values taken by the sums $\sum_{i=u}^{v-1} a_i$, where $a_1,a_2,\dots,a_n$ is a permutation of $1,2,\dots,n$ and $1 \leq u < v \leq n+1$. In particular, we show that for a random choice of a permutation, with high…