English
Related papers

Related papers: On the algorithmic construction of classifying spa…

200 papers

A group $\Gamma$ is defined to be cofinitely Hopfian if every homomorphism $\Gamma\to\Gamma$ whose image is of finite index is an automorphism. Geometrically significant groups enjoying this property include certain relatively hyperbolic…

Group Theory · Mathematics 2010-12-09 Martin R. Bridson , Daniel Groves , Jonathan A. Hillman , Gaven J. Martin

Let us be given two graphs $\Gamma_1$, $\Gamma_2$ of $n$ vertices. Are they isomorphic? If they are, the set of isomorphisms from $\Gamma_1$ to $\Gamma_2$ can be identified with a coset $H\cdot\pi$ inside the symmetric group on $n$…

Group Theory · Mathematics 2017-10-13 Harald Andrés Helfgott , Jitendra Bajpai , Daniele Dona

In this paper we introduce a homotopy theoretic technique for proving that the $K$-theoretic assembly map is an equivalence. It is an extension of the methods used to prove split injectivity of the assembly and applies to any geometrically…

Algebraic Topology · Mathematics 2026-01-19 Gunnar Carlsson , Boris Goldfarb

Let $\Gamma$ be a finite subgroup of $\SL_2(\C)$. We consider $\Gamma$-fixed point sets in Hilbert schemes of points on the affine plane $\C^2$. The direct sum of homology groups of components has a structure of a representation of the…

Quantum Algebra · Mathematics 2007-05-23 Hiraku Nakajima

A group $\Gamma$ has separable cohomology if the profinite completion map $\iota \colon \Gamma \to \widehat{\Gamma}$ induces an isomorphism on cohomology with finite coefficient modules. In this article, cohomological separability is…

Group Theory · Mathematics 2024-06-07 William D. Cohen , Julian Wykowski

The recently introduced A-homotopy groups for graphs are investigated. The main concern of the present article is the construction of an infinite cell complex, the homotopy groups of which are isomorphic to the A-homotopy groups of the…

Combinatorics · Mathematics 2007-05-23 E. Babson , H. Barcelo , M. de Longueville , R. Laubenbacher

Viewing Dehn's algorithm as a rewriting system, we generalise to allow an alphabet containing letters which do not necessarily represent group elements. This extends the class of groups for which the algorithm solves the word problem to…

Group Theory · Mathematics 2008-01-16 Oliver Goodman , Michael Shapiro

We address the question of determining which mapping class groups of infinite-type surfaces admit nonelementary continuous actions on hyperbolic spaces. More precisely, let $\Sigma$ be a connected, orientable surface of infinite type with…

Geometric Topology · Mathematics 2020-05-19 Camille Horbez , Yulan Qing , Kasra Rafi

We study cocycles of countable groups $\Gamma$ of Borel automorphisms of a standard Borel space $(X, \mathcal{B})$ taking values in a locally compact second countable group $G$. We prove that for a hyperfinite group $\Gamma$ the subgroup of…

Dynamical Systems · Mathematics 2021-08-16 Sergey Bezuglyi , Shrey Sanadhya

We prove that the isomorphism problem for group algebras reduces to group algebras over finite extensions of the prime field. In particular, the modular isomorphism problem reduces to finite modular group algebras.

Representation Theory · Mathematics 2023-07-11 Diego García-Lucas , Ángel del Río

We consider blind, deterministic, finite automata equipped with a register which stores an element of a given monoid, and which is modified by right multiplication by monoid elements. We show that, for monoids M drawn from a large class…

Group Theory · Mathematics 2007-05-23 Mark Kambites

We prove that the topological complexity of a finite index subgroup of a hyperbolic group is linear in its index. This follows from a more general result relating the size of the quotient of a free cocompact action of hyperbolic group on a…

Group Theory · Mathematics 2024-10-15 Nir Lazarovich

We propose an algorithm for solving of the graph isomorphism problem. Also, we introduce the new class of graphs for which the graph isomorphism problem can be solved polynomially using the algorithm.

Combinatorics · Mathematics 2007-05-23 Rashit T. Faizullin , Alexander V. Prolubnikov

The paper examines machines of the type of the $\Gamma$-spaces of Segal which describe homotopy structures on topological spaces. The main result of the paper shows that for any such machine one can find an algebraic theory characterizing…

Algebraic Topology · Mathematics 2007-05-23 Bernard Badzioch

The end compactification |\Gamma| of the locally finite graph \Gamma is the union of the graph and its ends, endowed with a suitable topology. We show that \pi_1(|\Gamma|) embeds into a nonstandard free group with hyperfinitely many…

Geometric Topology · Mathematics 2012-03-30 Isaac Goldbring , Alessandro Sisto

We study finitely generated groups whose word problems are accepted by counter automata. We show that a group has word problem accepted by a blind n-counter automaton in the sense of Greibach if and only if it is virtually free abelian of…

Group Theory · Mathematics 2012-05-16 Murray Elder , Mark Kambites , Gretchen Ostheimer

We present a new algorithm to decide isomorphism between finite graded algebras. For a broad class of nilpotent Lie algebras, we demonstrate that it runs in time polynomial in the order of the input algebras. We introduce heuristics that…

Rings and Algebras · Mathematics 2019-05-06 Peter A. Brooksbank , E. A. O'Brien , James B. Wilson

Given a variety of universal algebras. A method is suggested for describing automorphisms of a category of free algebras of this variety. Applying this general method all automorphisms of such categories are found in two cases: 1) for the…

Rings and Algebras · Mathematics 2007-05-23 Boris Plotkin , Grigori Zhitomirski

We exhibit examples of finitely presented subgroups $P$ of direct products of hyperbolic groups for which there is no algorithm that detects whether a finitely presented group has a quotient isomorphic to $P$. For any torsion-free, linear,…

Group Theory · Mathematics 2025-12-30 Konstantinos Tsouvalas

We construct a polynomial-time algorithm which given a graph $\Gamma$ finds the full set of non-equivalent Cayley representations of $\Gamma$ over the group $D\cong C_p\times C_{p^k}$, where $p\in\{2,3\}$ and $k\geq 1$. This result implies…

Combinatorics · Mathematics 2021-11-04 Grigory Ryabov