Related papers: Recognizing finite matrix groups over infinite fie…

We give a complete complexity classification for the problem of finding a solution to a given system of equations over a fixed finite monoid, given that a solution over a more restricted monoid exists. As a corollary, we obtain a complexity…

We prove that generating subspaces of matrix rings over finite fields are counted by polynomials. We use this result to define and study two-variable versions of polynomials counting isomorphism classes of absolutely irreducible…

We present a new algorithm deciding if the intersection of a quasiconvex subgroup of a negatively curved group with a conjugate is finite. We also give a short proof of decidability of the membership problem for quasiconvex subgroups of…

In this paper we determine the representation type of some algebras of infinite matrices continuously controlled at infinity by a compact metrizable space. We explicitly classify their finitely presented modules in the finite and tame…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

We make a list of finite simple groups whose group rings over a given field are serial.

In this paper we determine automorphism groups of cyclic algebraic curves defined over finite fields of any characteristic.

We prove:(1) the existence, for every integer n > 3, of a noncompact smooth n-dimensional topological manifold whose diffeomorphism group contains an isomorphic copy of every finitely presented group; (2) a finiteness theorem on finite…

The cohomology ring of a finite group, with coefficients in a finite field, can be computed by a machine, as Carlson has showed. Here "compute" means to find a presentation in terms of generators and relations, and involves only the…

We propose an algorithm which for any recursive group $G$, given by its effectively enumerable generators and recursively enumerable relations, outputs an explicit embedding of $G$ into a finitely presented group directly written by its…

We show that the pure mapping class group is uniformly perfect for a certain class of infinite type surfaces with noncompact boundary components. We then combine this result with recent work in the remaining cases to give a complete…

We survey several notions of Mackey functors and biset functors found in the literature and prove some old and new theorems comparing them. While little here will surprise the experts, we draw a conceptual and unified picture by making…

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 consider one-plaquette unitary matrix model at finite $N$ using exact expression of the partition function for both SU($N$) and U($N$) groups.

A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…

We introduce a model for random chain complexes over a finite field. The randomness in our complex comes from choosing the entries in the matrices that represent the boundary maps uniformly over $\mathbb{F}_q$, conditioned on ensuring that…

We begin by defining general hypergeometric functions over finite fields and obtaining a finite field analogue of a classical symmetry in their complex counterparts. We give a geometric proof for the symmetry by constructing isomorphisms…

Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg's…

In this paper we define a pair of faithful functors that map isomorphic and isotopic finite-dimensional algebras over finite fields to isomorphic graphs. These functors reduce the cost of computation that is usually required to determine…

We present algorithms for classification of linear codes over finite fields, based on canonical augmentation and on lattice point enumeration. We apply these algorithms to obtain classification results over fields with 2, 3 and 4 elements.…