Related papers: On permutations induced by tame automorphisms over…

We construct explicitly a family of proper subgroups of the tame automorphism group of affine three-space (in any characteristic) which are generated by the affine subgroup and a non-affine tame automorphism. One important corollary is the…

In this article we continue the study of automorphism groups of constant length substitution shifts and also their topological factors. We show that up to conjugacy, all roots of the identity map are letter exchanging maps, and all other…

In this note we prove that every finite collection of connected algebraic subgroups of the group of triangular automorphisms of the affine space generates a connected solvable algebraic subgroup.

We show that the theory of algebraically closed fields with multiplicative circular orders has a model companion $\mathrm{ACFO}$. Using number-theoretic results on character sums over finite fields, we show that if $\mathbb{F}$ is an…

Various descending chains of subgroups of a finite permutation group can be used to define a sequence of `basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the…

We show a general theorem of existence of temporal foliations in a general causal set, under mild constraints. Then we study automorphisms of infinite causal sets (which satisfy further requirements) and show that they fall under one of two…

We give a function field specific, algebraic proof of the main results of class field theory for abelian extensions of degree coprime to the characteristic. By adapting some methods known for number fields and combining them in a new way,…

We prove a broad generalization of a theorem of W. Burnside on real characters using permutation characters. Under a necessary hypothesis, We can give some control on multiplicities (a result that needs the Classification of Finite Simple…

We determine a strong form of the decomposition theorem for proper toric maps over finite fields.

Motivated by recent results on the constructions of permutation polynomials with few terms over the finite field $\mathbb{F}_{2^n}$, where $n$ is a positive even integer, we focus on the construction of permutation trinomials over…

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 $q$ be a prime power. We determine all permutation trinomials of $\Bbb F_{q^2}$ of the form $ax+bx^q+x^{2q-1}\in\Bbb F_{q^2}[x]$. The subclass of such permutation trinomials of $\Bbb F_{q^2}$ with $a,b\in\Bbb F_q$ was determined in a…

We develop a theory of sesquilinear forms over finite fields, investigating their representations via polynomials and coefficient matrices, along with classification results for these forms. Through their connection to quadratic forms, we…

We study automorphisms of the free associative algebra K<x,y,z> over a field K which fix the variable z. We describe the structure of the group of z-tame automorphisms and derive algorithms which recognize z-tame automorphisms and z-tame…

The dynamics of a linear dynamical system over a finite field can be described by using the elementary divisors of the corresponding matrix. It is natural to extend the investigation to a general finite commutative ring. In a previous…

A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the…

We show that many infinite classes of permutations over finite fields can be constructed via translators with a large choice of parameters. We first charac- terize some functions having linear translators, based on which several families of…

Let (S, B) be the log pair associated with a projective completion of a smooth quasi-projective surface V . Under the assumption that the boundary B is irreducible, we obtain an algorithm to factorize any automorphism of V into a sequence…

Finite field transforms have many applications and, in many cases, can be implemented with a low computational complexity. In this paper, the Z Transform over a finite field is introduced and some of its properties are presented.

This paper exploits adjacencies between the orbits of an ordered set P and a consequence of the classification of finite simple groups to, in many cases, exponentially bound the number of automorphisms. Results clearly identify the…