Related papers: Recognizing geometric 3-manifold groups using the …

In this survey we show how well known results about the Word Problem for finite group presentations can be generalized to the Word Problem and other decision problems for non-necessarily finite monoid and group presentations. This is done…

We describe a procedure which verifies that a group given by generators and relators is word-hyperbolic. This procedure always works with a group which is word-hyperbolic, provided there is sufficient memory and time devoted to the problem.…

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…

We provide a geometric characterization of manifolds of dimension 3 with fundamental groups of which all conjugacy classes except 1 are infinite, namely of which the von Neumann algebras are factors of type $II_1$: they are essentially the…

It is well known that a three dimensional (closed, connected and compact) manifold is obtained by identifying boundary faces from a polyhedron P. The study of (\partial P)/~, the boundary \partial P with the polygonal faces identified in…

In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…

We show that the compressed word problem in a finitely-generated fully residually free group (F -group) is decidable in polynomial time, and use the result to show that the word problem in the automorphism group of such a group is decidable…

We show that every algebraic group scheme over a field with at least 8 elements can be realized as the group of automorphisms of a nonassociative algebra. This is only a modest improvement of the theorem of Gordeev and Popov (2003), but it…

(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…

We will show that, for any noncompact arithmetic hyperbolic $m$-manifold with $m> 3$, and any compact arithmetic hyperbolic $m$-manifold with $m> 4$ that is not a $7$-dimensional arithmetic hyperbolic manifold defined by octonions, its…

This paper initiates the study of circular orderability of $3$-manifold groups, motivated by the L-space conjecture. We show that a compact, connected, $\mathbb{P}^2$-irreducible $3$-manifold has a circularly orderable fundamental group if…

We classify $n$-dimensional geometric graph manifolds with nonnegative scalar curvature, and first show that if $n>3$, the universal cover splits off a codimension 3 Euclidean factor. We then proceed with the classification of the…

We determine which three-manifolds are dominated by products. The result is that a closed, oriented, connected three-manifold is dominated by a product if and only if it is finitely covered either by a product or by a connected sum of…

This is a survey on the state-of-the-art of the classification of finite-dimensional complex Hopf algebras. This general question is addressed through the consideration of different classes of such Hopf algebras. Pointed Hopf algebras…

In this paper we provide an algorithm to classify groups of points on abelian threefolds over finite fields. The classification is given in terms of the Weil polynomial of abelian varieties in a given $\mathbb{F}_q$-isogeny class. This work…

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…

We define basic notions in the category of conic representations of a topological group and prove elementary facts about them. We show that a conic representation determines an ordinary dynamical system of the group together with a…

We revisit the task of learning a Euclidean metric from data. We approach this problem from first principles and formulate it as a surprisingly simple optimization problem. Indeed, our formulation even admits a closed form solution. This…

We obtain a new classification of the finite metacyclic group in terms of group invariants. We present an algorithm to compute these invariants, and hence to decide if two given finite metacyclic groups are isomorphic, and another algorithm…

In this paper we show that certain special cases of the hidden subgroup problem can be solved in polynomial time by a quantum algorithm. These special cases involve finding hidden normal subgroups of solvable groups and permutation groups,…