Sciweavers

    COMBINATORICS
    2006
    115views more  COMBINATORICS 2006»
    Chains, Subwords, and Fillings: Strong Equivalence of Three Definitions of the Bruhat Order
    14 years 16 days ago
    Chains, Subwords, and Fillings: Strong Equivalence of Three Definitions of the Bruhat Order
    Download  www.math.umb.edu
    Let Sn be the group of permutations of [n] = {1, . . . , n}. The Bruhat order on Sn is a partial order relation, for which there are several equivalent definitions. Three well-kno...
    Catalin Zara
    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-2024, USA.