Related papers: Permutation groups, pattern involvement, and Galoi…
Greither and Pareigis have established a connection between Hopf Galois structures on a Galois extension $L/K$ with Galois group $G$, and the regular subgroups of the group of permutations on $G$, which are normalized by $G$. Byott has…
Permutation Matrices are a well known class of matrices which encode the elements of the symmetric group on $d$ elements as a square $d\times d$ matrix. Motivated by [4], we define a similar class of matrices which are a generalization of…
We consider the logarithm of the characteristic polynomial of random permutation matrices, evaluated on a finite set of different points. The permutations are chosen with respect to the Ewens distribution on the symmetric group. We show…
We study the relation between the Galois group $G$ of a linear difference-differential system and two classes $\mathcal{C}_1$ and $\mathcal{C}_2$ of groups that are the Galois groups of the specializations of the linear difference equation…
We determine a set of permutation patterns $q$ so that the number of permutations with $r$ occurrences of $q$ is asymptotically $n^r$ times the number of permutations avoiding $q$, partially settling a conjecture of Conway and Guttman. We…
A strategy to address the inverse Galois problem over Q consists of exploiting the knowledge of Galois representations attached to certain automorphic forms. More precisely, if such forms are carefully chosen, they provide compatible…
We study petal diagrams of knots, which provide a method of describing knots in terms of permutations in a symmetric group $S_{2n+1}$. We define two classes of moves on such permutations, called trivial petal additions and crossing…
Shuffle algebras are monoids for an unconvential monoidal category structure on graded vector spaces. We present two homological results on shuffle algebras with monomial relations, and use them to prove exact and asymptotic results on…
Let F be a finitely generated field of characteristic zero and \Gamma<GL_n(F) a finitely generated subgroup. For an element g in \Gamma, let Gal(F(g)/ F) be the Galois group of the splitting field of the characteristic polynomial of g over…
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 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 (1)} a_{\sigma (2)} ... a_{\sigma (n)}$, where $\sigma$…
We say that two permutations $[n]\to [n]$ intersect if they map some element $x$ to the same element $y$. A matching in a family of permutations is a collection of pairwise disjoint permutations. In this paper, we study families of…
A generalized numerical semigroup is a submonoid $S$ of $\mathbb{N}^d$ with finite complement in it. We characterize isomorphisms between these monoids in terms of permutation of coordinates. Considering the equivalence relation that…
A simple permutation is one which maps no proper non-singleton interval onto an interval. We consider the enumeration of simple permutations from several aspects. Our results include a straightforward relationship between the ordinary…
Given a connection on a meromorphic vector bundle over a compact Riemann surface with reductive Galois group, we associate to it a projective variety. Connections such that their associated projective variety are curves can be classified,…
In the first part of this paper we try to explain to a general mathematical audience some of the remarkable web of conjectures linking representations of Galois groups with algebraic geometry, complex analysis and discrete subgroups of Lie…
Permutons are probability measures on the unit square with uniform marginals that provide a natural way to describe limits of permutations. We are interested in the permuton limits for permutations sampled uniformly from certain…
Given a finite group $G$, we introduce the \textit{permutability degree} of $G$, as $$pd(G)=\frac{1}{|G| \ |\mathcal{L}(G)|} {\underset{X \in \mathcal{L}(G)}\sum}|P_G(X)|,$$ where $\mathcal{L}(G)$ is the subgroup lattice of $G$ and $P_G(X)$…
Let $\Omega=\{1,2,...,n\}$ where $n \ge 2$. The {\em shape} of an ordered set partition $P=(P_1,..., P_k)$ of $\Omega$ is the integer partition $\lambda=(\lambda_1,...,\lambda_k)$ defined by $\lambda_i = |P_i|$. Let G be a group of…
In the last decade a huge amount of articles has been published studying pattern avoidance on permutations. From the point of view of enumeration, typically one tries to count permutations avoiding certain patterns according to their…