Office of Academic Resources
Chulalongkorn University
Chulalongkorn University

Home / Help

TitleAlgorithmic Problems in Groups and Semigroups [electronic resource] / edited by Jean-Camille Birget, Stuart Margolis, John Meakin, Mark Sapir
ImprintBoston, MA : Birkhรคuser Boston : Imprint: Birkhรคuser, 2000
Connect tohttp://dx.doi.org/10.1007/978-1-4612-1388-8
Descript X, 309 p. online resource

SUMMARY

This volume contains papers which are based primarily on talks given at an interยญ national conference on Algorithmic Problems in Groups and Semigroups held at the University of Nebraska-Lincoln from May ll-May 16, 1998. The conference coincided with the Centennial Celebration of the Department of Mathematics and Statistics at the University of Nebraska-Lincoln on the occasion of the one hunยญ dredth anniversary of the granting of the first Ph.D. by the department. Funding was provided by the US National Science Foundation, the Department of Mathยญ ematics and Statistics, and the College of Arts and Sciences at the University of Nebraska-Lincoln, through the College's focus program in Discrete, Experimental and Applied Mathematics. The purpose of the conference was to bring together researchers with interests in algorithmic problems in group theory, semigroup theory and computer science. A particularly useful feature of this conference was that it provided a framework for exchange of ideas between the research communities in semigroup theory and group theory, and several of the papers collected here reflect this interacยญ tion of ideas. The papers collected in this volume represent a cross section of some of the results and ideas that were discussed in the conference. They reflect a synthesis of overlapping ideas and techniques stimulated by problems concerning finite monoids, finitely presented mono ids, finitely presented groups and free groups


CONTENT

Syntactic and Global Semigroup Theory: A Synthesis Approach -- Semigroups with Central Idempotents -- Algebraic Geometry over Groups -- Aspects of the Theory of Free Groups -- Polynomial Isoperimetric Inequalities for Richard Thompsonโ{128}{153}s Groups F, T,and V -- Ordered Monoids and J-Trivial Monoids -- A Remark on Finitely Generated Subgroups of Free Groups -- Homotopy Reduction Systems for Monoid Presentations II:The Gubaโ{128}{148}Sapir Reduction and Homotopy Modules -- Algorithmic Problems for Finite Groups and Finite Semigroups -- A Survey on the Computational Power of Some Classes of Finite Monoid Presentations -- Rewriting Systems, Finiteness Conditions, and Associated Functions -- Multiparty Communication Complexity of Finite Monoids -- Presentations for Monoids, Their Maximal Subgroups, and Schรผtzenberger Groups -- On the Growth of Relatively Free Semigroups -- When Can One Finite Monoid Simulate Another? -- Computing Closures of Finitely Generated Subgroups of the Free Group


Mathematics Algorithms Group theory Mathematical logic Combinatorics Mathematics Group Theory and Generalizations Algorithm Analysis and Problem Complexity Combinatorics Mathematical Logic and Foundations



Location



Office of Academic Resources, Chulalongkorn University, Phayathai Rd. Pathumwan Bangkok 10330 Thailand

Contact Us

Tel. 0-2218-2929,
0-2218-2927 (Library Service)
0-2218-2903 (Administrative Division)
Fax. 0-2215-3617, 0-2218-2907

Social Network

  line

facebook   instragram