Related papers: More constructions of $n$-cycle permutations
An involution is usually defined as a mapping that is its own inverse. In this paper, we study quaternion involutions that have the additional properties of distribution over addition and multiplication. We review formal axioms for such…
Chow rings of flag varieties have bases of Schubert cycles $\sigma_u$, indexed by permutations. A major problem of algebraic combinatorics is to give a positive combinatorial formula for the structure constants of this basis. The celebrated…
Motivated by recent results on the constructions of permutation polynomials with few terms over the finite field $\mathbb{F}_{2^n}$, where $n$ is a positive even integer, we focus on the construction of permutation trinomials over…
For general repeated measures designs the Wald-type statistic (WTS) is an asymptotically valid procedure allowing for unequal covariance matrices and possibly non-normal multivariate observations. The drawback of this procedure is the poor…
We describe a new method for finding patterns in permutations that produce a given pattern after the permutation has been passed once through a stack. We use this method to describe West-3-stack-sortable permutations, that is, permutations…
In this paper, we prove that every PP is an AGW-PP. We also extend the result of Wan and Lidl to other permutation polynomials over finite fields and determine their group structure. Moreover, we provide a new general method to find the…
We survey the known results about simple permutations. In particular, we present a number of recent enumerative and structural results pertaining to simple permutations, and show how simple permutations play an important role in the study…
We undertake a detailed investigation into the structure of permutations in monotone grid classes whose row-column graphs do not contain components with more than one cycle. Central to this investigation is a new decomposition, called the…
We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…
We introduce a notion of {\em cyclic Schur-positivity} for sets of permutations, which naturally extends the classical notion of Schur-positivity, and it involves the existence of a bijection from permutations to standard Young tableaux…
We consider random permutations on $\Sn$ with logarithmic growing cycles weights and study asymptotic behavior as the length $n$ tends to infinity. We show that the cycle count process converges to a vector of independent Poisson variables…
We use an interesting result of probabilistic flavor concerning the product of two permutations consisting of one cycle each to find an explicit formula for the average number of block interchanges needed to sort a permutation of length…
In this paper, we present the compositional inverses of several classes permutation polynomials of the form $\sum_{i=1}^kb_i(x^{p^m}+x+\delta)^{s_i}-x$ over $\mathbb{F}_{p^{2m}}$, where for $1\leq i \leq k,$ $s_i, m$ are positive integers,…
Consider an n qubit computational basis state corresponding to a bit string x, which has had an unknown local unitary applied to each qubit, and whose qubits have been reordered by an unknown permutation. We show that, given such a state…
Using a result of Gessel and Reutenauer, we find a simple formula for the number of cyclic permutations with a given descent set, by expressing it in terms of ordinary descent numbers (i.e., those counting all permutations with a given…
In a recent paper Zheng et al. characterized the coefficients of $ f(x) = x + a_1x^{s_1(2m-1)+1} + a_2x^{s_2(2m-1)+1} + a_3x^{s_3(2m-1)+1} $ over $\mathbb{ F}_2^{2m}$ that lead $ f(x) $ to be a permutation of $\mathbb{ F}_2^{2m}$ for $…
Each group G of nxn permutation matrices has a corresponding permutation polytope, P(G):=conv(G) in R^{nxn}. We relate the structure of P(G) to the transitivity of G. In particular, we show that if G has t nontrivial orbits, then…
We have generalised the properties with the tensor product, of one 4x4 matrix which is a permutation matrix, and we call a tensor commutation matrix. Tensor commutation matrices can be constructed with or without calculus. A formula allows…
Using a result of Longo and Xu, we show that the anomaly arising from a cyclic permutation orbifold of order 3 of a holomorphic conformal net $\mathcal A$ with central charge $c=8k$ depends on the "gravitational anomaly" $k\pmod 3$. In…
Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, communication…