Related papers: Permutations and negative beta-shifts

We explore a bijection between permutations and colored Motzkin paths that has been used in different forms by Foata and Zeilberger, Biane, and Corteel. By giving a visual representation of this bijection in terms of so-called cycle…

Let $\mathfrak{S}_n$ and $\mathfrak{B}_n$ denote the respective sets of ordinary and bigrassmannian (BG) permutations of order $n$, and let $(\mathfrak{S}_n,\leq)$ denote the Bruhat ordering permutation poset. We study the restricted poset…

This is my dissertation. Its research object is a symmetric group of permutations acting on a finite set. The density of permutations with a given cycle structure pattern is explored when the group order tends to infinity. New and sharper…

A permutation is said to be a square if it can be obtained by shuffling two order-isomorphic patterns. The definition is intended to be the natural counterpart to the ordinary shuffle of words and languages. In this paper, we tackle the…

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…

Mutations are typically classified by their effects on the nucleotide sequence and by their size. Here, we argue that if our main aim is to understand the effect of mutations on evolutionary outcomes (such as adaptation or speciation), we…

We constructively prove that the partially ordered set of finite permutations ordered by deletion of entries contains an infinite antichain.

Let $\mathcal{M}(n)$ be the subgroup of $GL(n,\mathbb{Z})$ generated by the particular involutions that are identical to the identity, except for a single line where $-1$ and $+1$ alternate. We study the properties of $\mathcal{M}(n)$, and…

Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…

As well known, permanent of a square (0,1)-matrix $A$ of order $n$ enumerates the permutations $\beta$ of $1,2,...,n$ with the incidence matrices $B\leq A.$ To obtain enumerative information on even and odd permutations with condition…

We develop constructions for exchangeable sequences of point processes that are rendered conditionally-i.i.d. negative binomial processes by a (possibly unknown) random measure called the base measure. Negative binomial processes are useful…

We introduce a new class of permutations, called web permutations. Using these permutations, we provide a combinatorial interpretation for entries of the transition matrix between the Specht and web bases, which answers Rhoades's question.…

The boolean elements of a Coxeter group have been characterized and shown to possess many interesting properties and applications. Here we introduce "prism permutations," a generalization of those elements, characterizing the prism…

A sufficient and necessary condition ensuring that the backward shift operator on the K\"{o}the sequence space admits an invariant distributionally $\varepsilon$-scrambled set for some $\varepsilon>0$ is obtained, improving the main results…

For any permutation w, we characterize the reduced words of w that are their own commutation class. When w is the long element n(n-1)...321 and n \ge 4, there are exactly four such words.

In this paper, we present an algorithm that enumerates a certain class of signed permutations, referred to as grid signed permutation classes. In the case of permutations, the corresponding grid classes are of interest because they are…

First conformal transformations of the $S$-matrix are derived in massless $\phi^4$-theory. Then it is shown that the anomalous transformations can be rewritten as a symmetry once one has introduced a local coupling and interprets the charge…

A general theory of permutation orbifolds is developed for arbitrary twist groups. Explicit expressions for the number of primaries, the partition function, the genus one characters, the matrix elements of modular transformations and for…

Uhlmann showed that there exists a positive, unital and trace-preserving map transforming a Hermitian matrix $A$ into another $B$ if and only if the vector of eigenvalues of $A$ majorizes that of $B$. In this work I characterize the…

The Robinson-Schensted correspondence can be viewed as a map from permutations to partitions. In this work, we study the number of inversions of permutations corresponding to a fixed partition $\lambda$ under this map. Hohlweg characterized…