Related papers: Computing the autotopy group of a Latin square by …

We give an algorithm for finding the index of a positive outer automorphism of the free group, and prove the algorithm exits in a finite time.

We study proportions of consecutive occurrences of permutations of a given size. Specifically, the feasible limits of such proportions on large permutations form a region, called feasible region. We show that this feasible region is a…

We derive a formula connecting the orders of the automorphism groups of a finite group and of its covering groups.

In this short paper, we begin to investigate the conditions under which a generic Bipermutive Cellular Automaton (BCA) with no-boundary conditions of diameter $d$ generates a Latin square of order $N=2^{d-1}$ admitting an orthogonal mate,…

The main purpose of this paper is to describe some published results and outline corresponding approaches which when applied to automorphism groups of algebras or groups establish that these groups are linear or non-linear.

A transversal in an $n \times n$ latin square is a collection of $n$ entries not repeating any row, column, or symbol. Kwan showed that almost every $n \times n$ latin square has $\bigl((1 + o(1)) n / e^2\bigr)^n$ transversals as $n \to…

We present an algorithm to construct the JSJ decomposition of one-ended hyperbolic groups which are fundamental groups of graphs of free groups with cyclic edge groups. Our algorithm runs in double exponential time, and is the first…

We introduce a graph attached to mutually orthogonal Sudoku Latin squares. The spectra of the graphs obtained from finite fields are explicitly determined. As a corollary, we then use the eigenvalues to distinguish non-isomorphic Sudoku…

The group ring of the automorphism group of a p-group is studied using the automorphism groups of subgroups and quotient groups of P.

We show that the outer automorphism group of a polycyclic-by-finite group is an arithmetic group. This result follows from a detailed structural analysis of the automorphism groups of such groups. We use an extended version of the theory of…

The well-known quadrangle criterion states that a latin square is isotopic to the Cayley table of a group if and only if all quadrangles spanned by the same triple of symbols coincide on the fourth symbol. Gowers and Long (2020)…

This paper defines and develops cycle indices for the finite classical groups. These tools are then applied to study properties of a random matrix chosen uniformly from one of these groups. Properties studied by this technique will include…

Let $A$ be a $n$ by $n$ matrix. A skeleton decomposition is any factorization of the form $CUR$ where $C$ comprises columns of $A$, and $R$ comprises rows of $A$. In this paper, we consider uniformly sampling $\l\simeq k \log n$ rows and…

In practice symmetries of combinatorial structures are computed by transforming the structure into an annotated graph whose automorphisms correspond exactly to the desired symmetries. An automorphism solver is then employed to compute the…

A map on a group into itself is called a local automorphism if at any two points of the group, it can be interpolated by an automorphism of that group. In this paper we investigate the question of how local automorphisms of some classical…

Using a group-theoretic approach, a method for determining the equivalence classes (also called orbits) of the set of rules of one-dimensional cellular automata induced by the symmetry operations of reflection and permutation and their…

The question whether there exists an integral solution to the system of linear equations with non-negative constraints, $A\x = \b, \, \x \ge 0$, where $A \in \Z^{m\times n}$ and ${\mathbf b} \in \Z^m$, finds its applications in many areas,…

A polynomial-time algorithm is produced which, given generators for a group of permutations on a finite set, returns a direct product decomposition of the group into directly indecomposable subgroups. The process uses bilinear maps and…

Permutation polynomials of finite fields have many applications in Coding Theory, Cryptography and Combinatorics. In the first part of this paper we present a new family of local permutation polynomials based on a class of symmetric…

In this article we study the automorphism groups of binary cyclic codes. In particular, we provide explicit constructions for codes whose automorphism groups can be described as (a) direct products of two symmetric groups or (b) iterated…