Algorithmic Problems in Groups and Semigroups by Jorge Almeida, Benjamin Steinberg (auth.), Jean-Camille

By Jorge Almeida, Benjamin Steinberg (auth.), Jean-Camille Birget, Stuart Margolis, John Meakin, Mark Sapir (eds.)

This quantity includes papers that are established totally on talks given at an inter­ nationwide convention on Algorithmic difficulties in teams and Semigroups held on the collage of Nebraska-Lincoln from may perhaps ll-May sixteen, 1998. The convention coincided with the Centennial social gathering of the dep. of arithmetic and facts on the collage of Nebraska-Lincoln at the celebration of the only hun­ dredth anniversary of the granting of the 1st Ph.D. by way of the dep.. investment used to be supplied through the U.S. nationwide technological know-how origin, the dep. of Math­ ematics and facts, and the school of Arts and Sciences on the collage of Nebraska-Lincoln, during the College's concentration software in Discrete, Experimental and utilized arithmetic. the aim of the convention used to be to assemble researchers with pursuits in algorithmic difficulties in team thought, semigroup idea and laptop technology. a very important characteristic of this convention was once that it supplied a framework for alternate of principles among the learn groups in semigroup thought and staff conception, and a number of other of the papers accrued the following mirror this interac­ tion of rules. The papers gathered during this quantity signify a go component to a number of the effects and ideas that have been mentioned within the convention. They replicate a synthesis of overlapping rules and strategies prompted through difficulties bearing on finite monoids, finitely offered mono ids, finitely offered teams and loose groups.