Related papers: Metrics on Signed Permutations with the Same Peak …

It is a classical result that any permutation in the symmetric group can be generated by a sequence of adjacent transpositions. The sequences of minimal length are called reduced words, and in this paper we study the graphs of these reduced…

Let $\Sigma_g$ be a closed hyperbolic surface of genus $g$ and let $Ham(\Sigma_g)$ be the group of Hamiltonian diffeomorphisms of $\Sigma_g$. The most natural word metric on this group is the autonomous metric. It has many interesting…

The density of vibrational states for glasses and jammed solids exhibits universal features, including an excess of modes above the Debye prediction known as the boson peak located at a frequency $\omega^*$ . We show that the eigenvector…

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…

Let $S_n$ be the symmetric group of all permutations of $\{1, \cdots, n\}$ with two generators: the transposition switching $1$ with $2$ and the cyclic permutation sending $k$ to $k+1$ for $1\leq k\leq n-1$ and $n$ to $1$ (denoted by…

A random vector $X=(X_1,\ldots,X_n)$ with the $X_i$ taking values in an arbitrary measurable space $(S, \mathscr{S})$ is exchangeable if its law is the same as that of $(X_{\sigma(1)}, \ldots, X_{\sigma(n)})$ for any permutation $\sigma$.…

We propose sum rules for permutations $p_n(k)$ of the ensemble $\left\{1,2,\cdots,n\right\}$ with $k$ fixed points, in the form of partial sums of their moments. The corresponding identities involve Stirling numbers of the first kind…

It is known when we call a poset P, a $\mathcal{P}$-chain permutational poset, given a subset of permutations $\mathcal{P}$ of the symmetric group $S_{n}$. In this work, we use the same idea to study subsets of words of length $n$, that are…

From a geometric perspective, we employ metric mean dimension to investigate the set of generic points of invariant measures and saturated sets in infinite entropy systems. For systems with the specification property, we establish certain…

The maximum drop size of a permutation $\pi$ of $[n]=\{1,2,\ldots, n\}$ is defined to be the maximum value of $i-\pi(i)$. Chung, Claesson, Dukes and Graham obtained polynomials $P_k(x)$ that can be used to determine the number of…

Morozova and Chentsov (Morozova and Chentsov 90) studied Riemannian metrics on the set of probability measures. They showed that, up to a constant factor, the Fisher information is the only Riemannian metric which is monotone under…

MacMahon's classic theorem states that the 'length' and 'major index' statistics are equidistributed on the symmetric group S_n. By defining natural analogues or generalizations of those statistics, similar equidistribution results have…

Let $k$ be a nonnegative integer, and let $\alpha$ and $\beta$ be two permutations of $n$ symbols. We say that $\alpha$ and $\beta$ $k$-commute if $H(\alpha\beta, \beta\alpha)=k$, where $H$ denotes the Hamming metric between permutations.…

We provide an asymptotic expression for the probability that a randomly chosen polynomial with given degree, having integral coefficients bounded by some B, has a prescribed signature. We also give certain related formulas and numerical…

Let $G$ be a Cayley graph of the elementary abelian $2$-group $\mathbb{Z}_2^{n}$ with respect to a set $S$ of size $d$. We prove that for any such $G, S$ and $d$, the maximum degree of any induced subgraph of $G$ on any set of more than…

Complete constant positive scalar curvature metrics on S^n - {p_1, ..., p_k} admit a definite asymptotic structure; i.e. the metric is asymptotic to a specific S^{n-1}-invariant metric near the puncture points. This allows one to glue…

In this paper we study the parameterized complexity of two well-known permutation group problems which are NP-complete. 1. Given a permutation group G=<S>, subgroup of $S_n$, and a parameter $k$, find a permutation $\pi$ in G such that…

We derive simplified sphere-packing and Gilbert--Varshamov bounds for codes in the sum-rank metric, which can be computed more efficiently than previous ones. They give rise to asymptotic bounds that cover the asymptotic setting that has…

We investigate the asymptotic properties of permutations drawn from the Luce model, a natural probabilistic framework in which permutations are generated sequentially by sampling without replacement, with selection probabilities…

Bj\"orner and Wachs defined a major index for labeled plane forests and showed that it has the same distribution as the number of inversions. We define and study the distributions of a few other natural statistics on labeled forests.…