We show that the membership problem for the modular group is decidable in polynomial time. To this end, we develop a new syllable-based version of the known ...
The modular group plays an important role in many branches of mathematics. We show that the membership problem for the modular group is decidable in ...
PDF | The modular group plays an important role in many branches of mathematics. We show that the membership problem for the modular group is decidable.
Membership Problem for the Modular Group - Microsoft Research
www.microsoft.com › en-us › publication
Jul 1, 2005 · We also show that the membership problem for a free group remains polynomial time when elements are written in a normal form with exponents.
The modular group occupies a central position in many branches of mathematical sciences. In this paper we give average polynomial-time algorithms for the ...
Apr 3, 2016 · Note that the membership problem is decidable for SL(2,C), but this problem is much easier than finding an algorithm for that general case.
May 7, 2020 · Actually, since GL2(Z) is virtually free there are algorithms due to Markus-Epstein and others for the membership problem for f.g. subgroups.
Missing: Modular | Show results with:Modular
The modular group plays an important role in many branches of mathematics. We show that the membership problem for the modular group is decidable in polynomial ...
Evaluating the SLP in a free group of rank n expresses h as a word in the n generators of H. This solves the constructive membership problem. Here is an example ...
[PDF] E cient Average-Case Algorithms for the Modular Group* - Cornell CS
www.cs.cornell.edu › Papers
In this paper we give average polynomial-time algorithms for the un- bounded and bounded membership problems for nitely generated subgroups of the modular group ...