Related papers: Permutation groups, pattern involvement, and Galoi…
Permutations of correlated sequences of random variables appear naturally in a variety of applications such as graph matching and asynchronous communications. In this paper, the asymptotic statistical behavior of such permuted sequences is…
A transitive permutation group is called elusive if it contains no semiregular element. We show that no group of automorphisms of a connected graph of valency at most four is elusive and determine all the elusive groups of automorphisms of…
Let $G\subset\GL(\BC^r)$ be a finite complex reflection group. We show that when $G$ is irreducible, apart from the exception $G=\Sgot_6$, as well as for a large class of non-irreducible groups, any automorphism of $G$ is the product of a…
We work in the context of a complete totally transcendental theory $T = T^{eq}$. We consider the prime model $M_{A}$ over a set $A$. For intermediate sets $B$ with $A\subseteq B \subseteq M_{A}$ which are normal ($Aut(M_{A}/A)$-invariant)…
This paper studies the number of monic integer polynomials $f$ of height at most $H$ whose Galois group, endowed with the action on the roots, is isomorphic to a prescribed permutation group $(G,\Omega)$. New upper bounds are obtained for…
Global permutation patterns have recently been shown to characterize important properties of a Coxeter group. Here we study global patterns in the context of signed permutations, with both characterizing and enumerative results.…
We consider some examples of superintegrable system which were recently isolated through a differential Galois group analysis. The identity of these systems is clarified and the corresponding Poisson algebras derived.
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 prove that the category of preordered groups contains two full reflective subcategories that give rise to some interesting Galois theories. The first one is the category of the so-called commutative objects, which are precisely the…
Hecke operators relate characters of rational conformal field theories (RCFTs) with different central charges, and extend the previously studied Galois symmetry of modular representations and fusion algebras. We show that the conductor $N$…
Turing theory of pattern formation is among the most popular theoretical means to account for the variety of spatio-temporal structures observed in Nature and, for this reason, finds applications in many different fields. While Turing…
In the context of the genome rearrangement problem, we analyze two well known models, namely the block transposition and the prefix block transposition models, by exploiting the connection with the notion of permutation pattern. More…
\noindent In our contribution to this volume we deal with \emph{discrete} symmetries: these are symmetries based upon groups with a discrete set of elements (generally a set of elements that can be enumerated by the positive integers). In…
In this note, an intrinsic description of some families of linear codes with symmetries is given, showing that they can be described more generally as quasi group codes, that is, as linear codes allowing a group of permutation automorphisms…
We study the automorphisms of a Cayley graph that preserve its natural edge-colouring. More precisely, we are interested in groups G, such that every such automorphism of every connected Cayley graph on G has a very simple form: the…
Comparability graphs are graphs which have transitive orientations. The dimension of a poset is the least number of linear orders whose intersection gives this poset. The dimension ${\rm dim}(X)$ of a comparability graph $X$ is the…
Dokos et. al. studied the distribution of two statistics over permutations $\mathfrak{S}_n$ of $\{1,2,\dots, n\}$ that avoid one or more length three patterns. A permutation $\sigma\in\mathfrak{S}_n$ contains a pattern…
We prove potential automorphy results for a single Galois representation $G_F \rightarrow GL_n(\overline{\mathbb{Q}}_l)$ where $F$ is a CM number field. The strategy is to use the $p,q$ switch trick and modify the Dwork motives employed in…
We construct via Fra\"iss\'e amalgamation an $\omega$-categorical structure whose automorphism group is an infinite oligomorphic Jordan primitive permutation group preserving a `limit of $D$-relations'. The construction is based on a…
We introduce the mathematical theory of the particle systems that interact via permutations, where the transition rates are assigned not to the jumps from a site to a site, but to the permutations themselves. This permutation processes can…