Sciweavers

    100
    Voted
    IJAC
    2010
    128views more  IJAC 2010»
    Compressed Words and Automorphisms in Fully Residually Free Groups
    14 years 11 months ago
    Compressed Words and Automorphisms in Fully Residually Free Groups
    Download  www.math.mcgill.ca
    We show that the compressed word problem in a finitely generated fully residually free group (F-group) is decidable in polynomial time, and use this result to show that the word ...
    Jeremy MacDonald
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.