Related papers: Permutation groups, pattern involvement, and Galoi…

For an arbitrary finite permutation group $G$, subgroup of the symmetric group $S_\ell$, we determine the permutations involving only members of $G$ as $\ell$-patterns, i.e., avoiding all patterns in the set $S_\ell \setminus G$. The set of…

We study groups generated by sets of pattern avoiding permutations. In the first part of the paper we prove some general results concerning the structure of such groups. In the second part we carry out a case-by-case analysis of groups…

We consider the problem of characterizing the class of those permutation groups that are the symmetry groups of Boolean functions. These are exactly the automorphism groups of hypergraphs. They are also called the relation groups. In this…

We present a geometric setting for the differential Galois theory of $G$-invariant connections with parameters. As an application of some classical results on differential algebraic groups and Lie algebra bundles, we see that the Galois…

There is a deep connection between permutations and trees. Certain sub-structures of permutations, called sub-permutations, bijectively map to sub-trees of binary increasing trees. This opens a powerful tool set to study enumerative and…

We consider sets of operations on a set A that are closed under permutation of variables, addition of dummy variables and composition. We describe these closed sets in terms of a Galois connection between operations and systems of pointed…

In this paper, we investigate the connection between infinite permutation monoids and bimorphism monoids of first-order structures. Taking our lead from the study of automorphism groups of structures as infinite permutation groups and the…

We present a Galois theory of parameterized linear differential equations where the Galois groups are linear differential algebraic groups, that is, groups of matrices whose entries are functions of the parameters and satisfy a set of…

We consider the problem of enumerating permutations in the symmetric group on $n$ elements which avoid a given set of consecutive pattern $S$, and in particular computing asymptotics as $n$ tends to infinity. We develop a general method…

We consider three isogeny invariants of abelian varieties over finite fields: the Galois group, Newton polygon, and the angle rank. Motivated by work of Dupuy, Kedlaya, and Zureick-Brown, we define a new invariant called the weighted…

The purpose of this paper is to constructively develop a Galois theory on irreducible shifts of finite type (SFTs) and to analyze the automorphism groups of SFTs using this framework. Let $X$ and $Y$ be irreducible SFTs. We demonstrate that…

The Galois/monodromy group of a family of geometric problems or equations is a subtle invariant that encodes the structure of the solutions. Computing monodromy permutations using numerical algebraic geometry gives information about the…

We prove the Galois correspondence between the subgroups of a finite automorphism group G of a simple vertex operator algebra V and the vertex operator subalgebras of V containing the set V^G of G-invariants.

The main theorem of Galois theory states that there are no finite group-subgroup pairs with the same invariants. On the other hand, if we consider complex linear reductive groups instead of finite groups, the analogous statement is no…

This paper is on the inverse parameterized differential Galois problem. We show that surprisingly many groups do not occur as parameterized differential Galois groups over K(x) even when K is algebraically closed. We then combine the method…

Group algebras of permutations have proved highly useful in solving a number of problems in large N gauge theories. I review the use of permutations in classifying gauge invariants in one-matrix and multi-matrix models and computing their…

The theory of permutation orbifolds is reviewed and applied to the study of symmetric product orbifolds and the congruence subgroup problem. The issue of discrete torsion, the combinatorics of symmetric products, the Galois action and…

Correlation factors are constructed that are consistent with the permutation symmetry group of N Fermions at given value of the filling factor.

We study the algebraic properties of binary relations whose underlying digraph is smooth, that is has no source or sink. Such objects have been studied as surjective hyper-operations (shops) on the corresponding vertex set, and as binary…

We compare several definitions of the Galois group of a linear difference equation that have arisen in algebra, analysis and model theory and show, that these groups are isomorphic over suitable fields. In addition, we study properties of…