First Page | Document Content | |
---|---|---|
![]() Date: 2009-11-24 09:24:11Order theory Algebraic structures Semigroup theory Partially ordered set Lattice Ideal Monoid Semigroup Completeness Inverse semigroup Graded poset | Source URL: www-users.york.ac.ukDownload Document from Source WebsiteFile Size: 208,40 KBShare Document on Facebook |
![]() | PDF DocumentDocID: 1iMIs - View Document |
![]() | Easy Categories For Programmers With Java Implementation Vlad Patryshev[removed]DocID: ZCuq - View Document |
![]() | SIAM J. COMPUI. Vol. 4. No. 3. September I97S INTERACTIVE COMPUTATION OF HOMOLOGY OF FINITE PARTIALLY ORDERED SETS* R. BUMBY.t E. COOPER} AND D. LATCH}DocID: cXQs - View Document |
![]() | Non-crossing partitions for arbitrary Coxeter groupsDocID: 5Tul - View Document |
![]() | AN INTRODUCTION TO GARSIDE STRUCTURES JON MCCAMMOND 1 Abstract. Geometric combinatorialists often study partially ordered sets inDocID: 5Tu9 - View Document |