×

Found 78 Documents (Results 1–78)

Topological complexity of subgroups of Artin’s braid groups. (English) Zbl 1392.55009

Grant, Mark (ed.) et al., Topological complexity and related topics. Mini-workshop on topological complexity and related topics, Mathematisches Forschungsinstitut Oberwolfach, Oberwolfach, Germany, February 28 – March 5, 2016. Proceedings. Providence, RI: American Mathematical Society (AMS) (ISBN 978-1-4704-3436-6/pbk; 978-1-4704-4405-1/ebook). Contemporary Mathematics 702, 165-176 (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Generic properties of subgroups of free groups and finite presentations. (English) Zbl 1392.20017

Kahrobaei, Delaram (ed.) et al., Algebra and computer science. Joint AMS-EMS-SPM meeting algebra and computer science, Porto, Portugal, June 10–13, 2015. Joint mathematics meetings groups, algorithms, and cryptography, San Antonio, TX, USA, January 10–13, 2015. Joint AMS-Israel Mathematical Union meeting applications of algebra to cryptography, Tel-Aviv, Israel, June 16–19, 2014. Proceedings. Providence, RI: American Mathematical Society (AMS) (ISBN 978-1-4704-2303-2/pbk; 978-1-4704-3587-5/ebook). Contemporary Mathematics 677, 1-43 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Compressed word problems in HNN-extensions and amalgamated products. (English) Zbl 1190.20018

Frid, Anna (ed.) et al., Computer science – theory and applications. Fourth international computer science symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03350-6/pbk). Lecture Notes in Computer Science 5675, 237-249 (2009).
MSC:  20E06 20F10 68Q17
PDFBibTeX XMLCite
Full Text: DOI

PSPACE-completeness of certain algorithmic problems on the subgroups of free groups. (English) Zbl 1418.68098

Abiteboul, Serge (ed.) et al., Automata, languages and programming. 21st international colloquium, ICALP ’94, Jerusalem, Israel, July 11–14, 1994. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 820, 274-285 (1994).
MSC:  68Q17 20E05 68Q45
PDFBibTeX XMLCite
Full Text: DOI

An effective version of Stallings’ theorem in the case of context-free groups. (English) Zbl 1422.20010

Lingas, Andrzej (ed.) et al., Automata, languages and programming. 20th international colloquium, ICALP 93, Lund, Sweden, July 5–9, 1993. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 700, 478-495 (1993).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field