Related papers: Groups generated by pattern avoiding permutations

The scope of this paper is two-fold. First, to present to the researchers in combinatorics an interesting implementation of permutations avoiding generalized patterns in the framework of discrete-time dynamical systems. Indeed, the orbits…

In this article, we introduce the study of a class of finite groups $G$ which admits a subgroup which intersects all non-trivial subgroups of $G$. We also explore a subclass of it consisting of all groups $G$ in which the prime order…

We construct examples of non-bi-orderable one-relator groups without generalized torsion. This answers a question asked in [2].

We study the structure of 01-matrices avoiding a pattern P as an interval minor. We focus on critical P-avoiders, i.e., on the P-avoiding matrices in which changing a 0-entry to a 1-entry always creates a copy of P as an interval minor. Let…

In this paper, we find explicit formulas or generating functions for the cardinalities of the sets $S_n(T,\tau)$ of all permutations in $S_n$ that avoid a pattern $\tau\in S_k$ and a set $T$, $|T|\geq 2$, of patterns from $S_3$. The main…

We study the relationship between two notions of pattern avoidance for involutions in the symmetric group and their restriction to fixed-point-free involutions. The first is classical, while the second appears in the geometry of certain…

We give a general constructive proof for hierarchical coordinatizations (Lagrange Decompositions) of permutation groups. The generalization originates from the investigation of how the subgroup chains of finite permutation groups yield…

We address the problem of tracking and detecting interactions between the different groups of runners that form during a race. In athletic races control points are set to monitor the progress of athletes over the course. Intuitively, a {\it…

This article introduces an analogue of permutation classes in the context of polyominoes. For both permutation classes and polyomino classes, we present an original way of characterizing them by avoidance constraints (namely, with excluded…

We show that all permutations in $S_n$ can be generated by affine unicritical polynomials. We use the $\operatorname{PGL}$ group structure to compute the cycle structure of permutations with low Carlitz rank. The tree structure of the group…

We investigate the isolated points in the space of finitely generated groups. We give a workable characterization of isolated groups and study their hereditary properties. Various examples of groups are shown to yield isolated groups. We…

We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…

Isomorphisms p between pattern classes A and B are considered. It is shown that, if p is not a symmetry of the entire set of permutations, then, to within symmetry, A is a subset of one a small set of pattern classes whose structure,…

The pattern avoidance problem seeks to construct a set $X\subset \mathbb{R}^d$ with large dimension that avoids a prescribed pattern. Examples of such patterns include three-term arithmetic progressions (solutions to $x_1 - 2x_2 + x_3 =…

We examine the subgroup $D(G)$ of a transitive permutation group $G$ which is generated by the derangements in $G$. Our main results bound the index of this subgroup: we conjecture that, if $G$ has degree $n$ and is not a Frobenius group,…

In this paper, we consider pattern avoidance in a subset of words on $\{1,1,2,2,\dots,n,n\}$ called reverse double lists. In particular a reverse double list is a word formed by concatenating a permutation with its reversal. We enumerate…

We offer elementary proofs for several results in consecutive pattern containment that were previously demonstrated using ideas from cluster method and analytical combinatorics. Furthermore, we establish new general bounds on the growth…

Necessary and sufficient conditions for finite semihypergroups to be built from groups of the same order are established

We consider here the morphogenesis (pattern formation) problem for some genetic network models. First, we show that any given spatio-temporal pattern can be generated by a genetic network involving a sufficiently large number of genes.…

Using the approach suggested in [arXiv:1002.2761] we present below a sufficient condition guaranteeing that two collections of patterns of permutations have the same exponential generating functions for the number of permutations avoiding…