Related papers: Deciding finiteness of matrix groups in positive c…
We provide algorithms to decide whether a finitely generated subgroup of $\mathrm{SL}_2(\mathbb{R})$ is discrete, solve the constructive membership problem for finitely generated discrete subgroups of $\mathrm{SL}_2(\mathbb{R})$, and…
Algorithms typically come with tunable parameters that have a considerable impact on the computational resources they consume. Too often, practitioners must hand-tune the parameters, a tedious and error-prone task. A recent line of research…
The spectrum $\omega(G)$ of a finite group $G$ is the set of orders of elements of $G$. We present a polynomial-time algorithm that, given a finite set $\mathcal M$ of positive integers, outputs either an empty set or a finite simple group…
Let $F$ be a free group of finite rank. We say that the monomorphism problem in $F$ is decidable if for any two elements $u$ and $v$ in $F$, there is an algorithm that determines whether there exists a monomorphism of $F$ that sends $u$ to…
We consider grammar-restricted exact learning of formulas and terms in finite variable logics. We propose a novel and versatile automata-theoretic technique for solving such problems. We first show results for learning formulas that…
Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. In the present paper we employ the…
We investigate the saturation rank of a finite group scheme, defined over an algebraically closed field $\Bk$ of positive characteristic $p$. We begin by exploring the saturation rank for finite groups and infinitesimal group schemes.…
We present an algorithm for computing the integral closure of a reduced ring that is finitely generated over a finite field.
We introduce a new constructive recognition algorithm for finite special linear groups in their natural representation. Given a group $G$ generated by a set of $d\times d$ matrices over a finite field $\mathbb{F}_q$, known to be isomorphic…
The groups whose orders factorise into at most four primes have been described (up to isomorphism) in various papers. Given such an order n, this paper exhibits a new explicit and compact determination of the isomorphism types of the groups…
In this article we give an elementary introduction to the representation theory of finite magnetic groups from a purely mathematical point of view. -- En este art\'iculo damos una introducci\'on elemental a la teor\'ia de representaciones…
We consider deformations of bounded complexes of modules for a profinite group G over a field of positive characteristic. We prove a finiteness theorem which provides some sufficient conditions for the versal deformation of such a complex…
We estimate the proportion of several classes of elements in finite classical groups which are readily recognised algorithmically, and for which some power has a large fixed point subspace and acts irreducibly on a complement of it. The…
We classify the matrices M which correspond to finite categories
We show that certain representations over fields with positive characteristic of groups having CAT(0) fixed point property ${\rm F}\mathcal{B}_{\widetilde{A}_n}$ have finite image. In particular, we obtain rigidity results for…
We describe a new approach towards the systematic construction of finite groups up to isomorphism. This approach yields a practical algorithm for the construction of finite solvable groups up to isomorphism. We report on a GAP…
This work deals with the definability problem by quantifier-free first-order formulas over a finite algebraic structure. We show the problem to be coNP-complete and present two decision algorithms based on a semantical characterization of…
We consider two matrix completion problems, in which we are given a matrix with missing entries and the task is to complete the matrix in a way that (1) minimizes the rank, or (2) minimizes the number of distinct rows. We study the…
In this note, we first discuss some properties of generated $\sigma$-fields and a simple approach to the construction of finite $\sigma$-fields. It is shown that the $\sigma$-field generated by a finite class of $\sigma$-distinct sets which…
We obtain the formula computing the number of isomorphic classes of element systems with characters over finite commutative group $G$.