Related papers: Permutation groups arising from pattern involvemen…

Let $X$ be a set and let $S$ be an inverse semigroup of partial bijections of $X$. Thus, an element of $S$ is a bijection between two subsets of $X$, and the set $S$ is required to be closed under the operations of taking inverses and…

In this article, we describe an algorithm to determine whether a permutation class C given by a finite basis B of excluded patterns contains a finite number of simple permutations. This is a continuation of the work initiated in [Brignall,…

Let S be a principally embedded sl_2 subalgebra in sl_n for n > 2. A special case of results of the third author and Gregg Zuckerman implies that there exists a positive integer b(n) such that for any finite-dimensional irreducible sl_n…

Let G be a finite solvable permutation group. Then modulo a possibly trivial normal elementary abelian 3-subgroup, some set-stabilizer in G is a 2-group.

We develop a new, powerful method for counting elements in a multiset. As a first application, we use this algorithm to study the number of occurrences of patterns in a permutation. For patterns of length 3 there are two Wilf classes, and…

We consider random permutations which are spherically symmetric with respect to a metric on the symmetric group $S_n$ and are consistent as $n$ varies. The extreme infinitely spherically symmetric permutation-valued processes are identified…

Given an oligomorphic group $G$ and a measure $\mu$ for $G$ (in a sense that we introduce), we define a rigid tensor category $\underline{\mathrm{Perm}}(G; \mu)$ of "permutation modules," and, in certain cases, an abelian envelope…

Packing density is a permutation occurrence statistic which describes the maximal number of permutations of a given type that can occur in another permutation. In this article we focus on containment of sets of permutations. Although this…

Let ${\cal K}_1(G)$ denote the inverse subsemigroup of ${\cal K}(G)$ consisting of all right cosets of all non-trivial subgroups of $G$. This paper concentrates on the study of the group $\Sigma({\cal K}_1(G))$ of all units of the…

I define three "measures" of the complicatedness of a finite group in terms of bases in permutation representations of the group, and consider their relationships to other measures.

We study general properties of the restriction of the representations of the finite complex reflection groups $G(de,e,r+1)$ to their maximal parabolic subgroups of type $G(de,e,r)$, and focus notably on the multiplicity of components. In…

The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},..., a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}... a_{n} =a_{\sigma (a)} a_{\sigma (2)} ... a_{\sigma (n)}$, where $\sigma$…

Let $S_n$ denote the set of permutations of $[n]:=\{1,\cdots, n\}$, and denote a permutation $\sigma\in S_n$ by $\sigma=\sigma_1\sigma_2\cdots \sigma_n$. For $l\ge2$ an integer, let $A^{(n)}_{l;k}\subset S_n$ denote the event that the set…

The group algebra of the permutation group is spanned by a set of elements called projectors. The coordinates of permutations expanded in projectors are matrix elements of irreducible representations. The projectors of the permutation group…

A group $G$ is invariably generated if there exists a subset $S \subseteq G$ such that, for every choice $g_s \in G$ for $s \in S$, the group $G$ is generated by $\{ s^{g_s} \mid s \in S \}$. In [GGJ16] Gelander, Golan and Juschenko showed…

The set of isotopy classes of ordered n-component links in the 3-sphere is acted on by the symmetric group via permutation of the components. The intrinsic symmetry group of the link, S(L), is defined to be the set of elements in the…

The genus spectrum of a finite group $G$ is the set of all $g$ such that $G$ acts faithfully on a compact Riemann surface of genus $g$. It is an open problem to find a general description of the genus spectrum of the groups in interesting…

The present survey aims at being a list of Conjectures and Problems in an area of model-theoretic algebra wide open for research, not a list of known results. To keep the text compact, it focuses on structures of finite Morley rank,…

A finite group of order $n$ is said to have the distinct divisor property (DDP) if there exists a permutation $g_1,\ldots, g_n$ of its elements such that $g_i^{-1}g_{i+1} \neq g_j^{-1}g_{j+1}$ for all $1\leq i<j<n$. We show that an abelian…

Let $G$ be a transitive permutation group on a finite set of size at least $2$. By a well known theorem of Fein, Kantor and Schacher, $G$ contains a derangement of prime power order. In this paper, we study the finite primitive permutation…