Related papers: A Survey of Simple Permutations

A permutation is called {\it {block-wise simple}} if it contains no interval of the form $p_1\oplus p_2$ or $p_1 \ominus p_2$. We present this new set of permutations and explore some of its combinatorial properties. We present a generating…

Permutation trinomials over finite fields consititute an active research due to their simple algebraic form, additional extraordinary properties and their wide applications in many areas of science and engineering. In the present paper, six…

It is known that the set of permutations, under the pattern containment ordering, is not a partial well-order. Characterizing the partially well-ordered closed sets (equivalently: down sets or ideals) in this poset remains a wide-open…

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…

In this paper, we summarize the work on the characterization of finite simple groups and the study on finite groups with the set of element orders and two orders (the order of group and the set of element orders). Some related topics, and…

We consider uniform random permutations in proper substitution-closed classes and study their limiting behavior in the sense of permutons. The limit depends on the generating series of the simple permutations in the class. Under a mild…

A survey of recent results in elementary number theory is presented in this paper. Special attention is given to structure and asymptotic properties of certain families of positive integers.

This article presents a methodology that automatically derives a combinatorial specification for a permutation class C, given its basis B of excluded patterns and the set of simple permutations in C, when these sets are both finite. This is…

Following a question of J. Cooper, we study the expected number of occurrences of a given permutation pattern $q$ in permutations that avoid another given pattern $r$. In some cases, we find the pattern that occurs least often, (resp. most…

Permutation polynomials over finite fields have taken an important role in vast areas in mathematics as well as engineering. Recently, Tu et al. gave some classes of complete permutation polynomials over finite fields of even…

We describe an algorithm, implemented in Python, which can enumerate any permutation class with polynomial enumeration from a structural description of the class. In particular, this allows us to find formulas for the number of permutations…

We investigate a family of permutation polynomials of finite fields of characteristic 2. Through a connection between permutation polynomials and quadratic forms, a general treatment is presented to characterize these permutation…

We introduce a permutation analogue of the celebrated Szemeredi Regularity Lemma, and derive a number of consequences. This tool allows us to provide a structural description of permutations which avoid a specified pattern, a result that…

A consecutive pattern in a permutation $\pi$ is another permutation $\sigma$ determined by the relative order of a subsequence of contiguous entries of $\pi$. Traditional notions such as descents, runs and peaks can be viewed as particular…

We survey a research program on the strong convergence of unitary and permutation representations of discrete groups. We also take the opportunity to flesh out details that have not appeared elsewhere.

In this paper, we study properties and patterns on permutations of multisets whose multivariate generating functions are symmetric. We interpret this phenomenon through the lens of group actions and define such a property or pattern as…

We show that the classification of simple finite group schemes over an algebraically closed field reduces to the classification of abstract simple finite groups and of simple restricted Lie algebras in positive characteristic. Both these…

The concept of differential uniformity was recently extended to the $c$-differential uniformity. An interesting problem in this area is the construction of functions with low $c$-differential uniformity and a lot of research has been done…

Using generating functions, we enumerate regular semisimple conjugacy classes in the finite classical groups. For the general linear, unitary, and symplectic groups this gives a different approach to known results; for the special…

We establish new results concerning endomorphisms of a finite chain if the cardinality of the image of such endomorphism is no more than some fixed number. The semiring of all such endomorphisms can be seen as a simplex whose vertices are…