A practical method is described for deciding whether or not a finite-dimensional module for a group over a finite field is reducible or not. In the reducible case, an explicit submodule is found. The method is a generalisation of the Parker-Norton 'Meataxe' algorithm, but it does not depend for its efficiency on the field being small. The principal tools involved are the calculation of the nullspace and the characteristic polynomial of a matrix over a finite field, and the factorisation of the latter. Related algorithms to determine absolute irreducibility and module isomorphism for irreducibles are also described. Details of an implementation in the GAP system, together with some performance analyses are included.
We prove that any Artin group of large type is shortlex automatic with respect to its standard generating set, and that the set of all geodesic words over the same generating set satisfies the Falsification by Fellow‐Traveller Property (FFTP) and hence is regular.
The class of co-context-free groups is studied. A co-context-free group is defined as one whose coword problem (the complement of its word problem) is context-free. This class is larger than the subclass of context-free groups, being closed under the taking of finite direct products, restricted standard wreath products with context-free top groups, and passing to finitely generated subgroups and finite index overgroups. No other examples of co-context-free groups are known. It is proved that the only examples amongst polycyclic groups or the Baumslag-Solitar groups are virtually abelian. This is done by proving that languages with certain purely arithmetical properties cannot be context-free; this result may be of independent interest.
Fascinating connections exist between group theory and automata theory, and a wide variety of them are discussed in this text. Automata can be used in group theory to encode complexity, to represent aspects of underlying geometry on a space on which a group acts, and to provide efficient algorithms for practical computation. There are also many applications in geometric group theory. The authors provide background material in each of these related areas, as well as exploring the connections along a number of strands that lead to the forefront of current research in geometric group theory. Examples studied in detail include hyperbolic groups, Euclidean groups, braid groups, Coxeter groups, Artin groups, and automata groups such as the Grigorchuk group. This book will be a convenient reference point for established mathematicians who need to understand background material for applications, and can serve as a textbook for research students in (geometric) group theory.
We study the regularity of several languages derived from conjugacy classes in a finitely generated group G for a variety of examples including word hyperbolic, virtually abelian, Artin, and Garside groups. We also determine the rationality of the growth series of the shortlex conjugacy language in virtually cyclic groups, proving one direction of a conjecture of Rivin.
Finitely generated Z-modules have canonical decompositions. When such modules are given in a finitely presented form there is a classical algorithm for computing a canonical decomposition. This is the algorithm for computing the Smith normal form of an integer matrix. We discuss algorithms for Smith normal form computation, and present practical algorithms which give excellent performance for modules arising from badly presented abelian groups.We investigate such issues as congruential techniques, sparsity considerations, pivoting strategies for Gauss-Jordan elimination, lattice basis reduction and computational complexity. Our results, which are primarily empirical, show dramatically improved performance on previous methods.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.