English
Related papers

Related papers: Localization, metabelian groups, and the isomorphi…

200 papers

Given a finitely generated (fg) group G, the set R(G) of homomorphisms from G to SL(2,C) inherits the structure of an algebraic variety known as the "representation variety" of G. This algebraic variety is an invariant of fg presentations…

Group Theory · Mathematics 2007-05-23 S. Liriano

We describe various classes of infinitely presented groups that are condensation points in the space of marked groups. A well-known class of such groups consists of finitely generated groups admitting an infinite minimal presentation. We…

Group Theory · Mathematics 2019-02-20 Robert Bieri , Yves de Cornulier , Luc Guyot , Ralph Strebel

We show that the isomorphism problem is solvable in the class of central extensions of word-hyperbolic groups, and that the isomorphism problem for biautomatic groups reduces to that for biautomatic groups with finite centre. We describe an…

Geometric Topology · Mathematics 2015-05-27 Martin R. Bridson , Lawrence Reeves

We study the realization problem of finite groups as the group of homotopy classes of self-homotopy equivalences of finite spaces. Let $G$ be a finite group. Using an infinite family of pairwise non weakly homotopic asymmetric spaces we…

Algebraic Topology · Mathematics 2025-02-27 Juan Felipe Celis-Rojas

Let $\mathcal P(S)$ be the semigroup obtained by equipping the family of all non-empty subsets of a (multiplicatively written) semigroup $S$ with the operation of setwise multiplication induced by $S$ itself. We call a subsemigroup $P$ of…

Rings and Algebras · Mathematics 2024-08-19 Salvatore Tringali

The concept of a C-approximable group, for a class of finite groups C, is a common generalization of the concepts of a sofic, weakly sofic, and linear sofic group. Glebsky raised the question whether all groups are approximable by finite…

Group Theory · Mathematics 2017-05-25 Nikolay Nikolov , Jakob Schneider , Andreas Thom

Let $G$ be a unitriangular matrix group of nilpotency class at most ten. We show that the Identity Problem (does a semigroup contain the identity matrix?) and the Group Problem (is a semigroup a group?) are decidable in polynomial time for…

Discrete Mathematics · Computer Science 2023-09-12 Ruiwen Dong

We prove that groups that are mod-p-homology equivalent are isomorphic modulo any term of their derived p-series, in precise analogy to Stallings' 1963 result for the lower-central p-series. Similarly spaces that are mod-p-homology…

Geometric Topology · Mathematics 2008-11-26 Tim D. Cochran , Shelly Harvey

We study finitely generated models of countable theories, having at most countably many nonisomorphic finitely generated models. We intro- duce a notion of rank of finitely generated models and we prove, when T has at most countably many…

Logic · Mathematics 2008-04-21 Abderezak Ould Houcine

Elder, Kambites, and Ostheimer showed that if the word problem of a finitely generated group $H$ is accepted by a $G$-automaton for an abelian group $G$, then $H$ is virtually abelian. We give a new, elementary, and purely combinatorial…

Group Theory · Mathematics 2022-11-01 Takao Yuyama

We classify all finite-dimensional connected Hopf algebras with large abelian primitive spaces. We show that they are Hopf algebra extensions of restricted enveloping algebras of certain restricted Lie algebras. For any abelian matched pair…

Rings and Algebras · Mathematics 2015-07-02 Xingting Wang

We prove the following theorem. Let $G$ be a finite group generated by unitary reflections in a complex Hermitian space $V=\mathbb{C}^\ell$ and let $G'$ be any reflection subgroup of $G$. Let $\mathcal{H}(G)$ be the space of $G$-harmonic…

Representation Theory · Mathematics 2020-01-10 G. I. Lehrer

This is the first of a sequence of papers devoted to studying the link between the complexity of the Word Problem for a finitely generated recursively presented group $G$ and the isoperimetric functions of the finitely presented groups in…

Group Theory · Mathematics 2025-09-23 Francis Wagner

It is well known that if two finite groups have the same symmetric tensor categories of representations over C, then they are isomorphic. We study the following question: when do two finite groups G1,G2 have the same tensor categories of…

Quantum Algebra · Mathematics 2007-05-23 Pavel Etingof , Shlomo Gelaki

An approach to representations of finite groups is presented without recourse to character theory. Considering the group algebra C[G] as an algebra of linear maps on C[G] (by left multiplication), we derive the primitive central idempotents…

Representation Theory · Mathematics 2008-03-31 Robin Endelman , Manash Mukherjee

In this paper, we show that the class of representable residuated semigroups has the finite representation property. That is, every finite representable residuated semigroup is isomorphic to some algebra over a finite base. This result…

Logic · Mathematics 2020-12-11 Daniel Rogozin

We study the Modular Isomorphism Problem applying a combination of existing and new techniques. We make use of the small group algebra to give a positive answer for two classes of groups of nilpotency class 3. We also introduce a new…

Rings and Algebras · Mathematics 2023-09-25 L. Margolis , M. Stanojkovski

A natural question for groups $H$ is which data can be detected in its finite quotients. A subset $X \subset H$ is called separable if for all $h\in H \setminus X$, there exists an epimorphism $\varphi$ to a finite group $Q$ such that…

Group Theory · Mathematics 2024-07-22 Jonas Deré , Lukas Vandeputte

We establish a general criterion for the finite presentability of subdirect products of groups and use this to characterize finitely presented residually free groups. We prove that, for all $n\in\mathbb{N}$, a residually free group is of…

Group Theory · Mathematics 2008-09-23 Martin R. Bridson , James Howie , Charles F. Miller , Hamish Short

In this paper, we investigate the computational complexity of isomorphism testing for finite groups and quasigroups, given by their multiplication tables. We crucially take advantage of their various decompositions to show the following: -…

Data Structures and Algorithms · Computer Science 2026-02-05 Dan Johnson , Michael Levet , Petr Vojtěchovský , Brett Widholm