Algorithmic Problems in Groups and Semigroups

Algorithmic Problems in Groups and Semigroups PDF Author: Jean-Camille Birget
Publisher: Springer Science & Business Media
ISBN: 1461213886
Category : Mathematics
Languages : en
Pages : 312

Get Book Here

Book Description
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.

Algorithmic Problems in Groups and Semigroups

Algorithmic Problems in Groups and Semigroups PDF Author: Jean-Camille Birget
Publisher: Springer Science & Business Media
ISBN: 1461213886
Category : Mathematics
Languages : en
Pages : 312

Get Book Here

Book Description
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.

Matemati?eskaja Logika, Teorija Algoritmov i Teorija Množestv

Matemati?eskaja Logika, Teorija Algoritmov i Teorija Množestv PDF Author: S. I. Adi︠a︡n
Publisher: American Mathematical Soc.
ISBN: 9780821830338
Category : Mathematics
Languages : en
Pages : 284

Get Book Here

Book Description
Papers celebrating Petr Sergeevič Novikov and his work in descriptive set theory and algorithmic problems of algebra.

Selected Works of A.I. Shirshov

Selected Works of A.I. Shirshov PDF Author: Leonid A. Bokut
Publisher: Springer Science & Business Media
ISBN: 3764388587
Category : Mathematics
Languages : en
Pages : 235

Get Book Here

Book Description
Anatolii Illarionovich Shirshov (1921–1981) was an outstanding Russian mat- maticianwhoseworksessentiallyin?uenced thetheoriesofassociative,Lie,Jordan and alternative rings. Many Shirshov’s students and students of his students had a successful research career in mathematics. AnatoliiShirshovwasbornonthe8thofAugustof1921inthevillageKolyvan near Novosibirsk. Before the II World War he started to study mathematics at Tomsk university but then went to the front to ?ght as a volunteer. In 1946 he continued his study at Voroshilovgrad (now Lugansk) Pedagogical Institute and at the same time taught mathematics at a secondary school. In 1950 Shirshov was accepted as a graduate student at the Moscow State University under the supervision of A. G. Kurosh. In 1953 he has successfully defended his Candidate of Science thesis (analog of a Ph. D. ) “Some problems in the theory of nonassociative rings and algebras” and joined the Department of Higher Algebra at the Moscow State University. In 1958 Shirshov was awarded the Doctor of Science degree for the thesis “On some classes of rings that are nearly associative”. In 1960 Shirshov moved to Novosibirsk (at the invitations of S. L. Sobolev and A. I. Malcev) to become one of the founders of the new mathematical institute of the Academy of Sciences (now Sobolev Institute of Mathematics) and to help the formation of the new Novosibirsk State University. From 1960 to 1973 he was a deputy director of the Institute and till his last days he led the research in the theory of algebras at the Institute.

Essays in Group Theory

Essays in Group Theory PDF Author: S.M. Gersten
Publisher: Springer Science & Business Media
ISBN: 1461395860
Category : Mathematics
Languages : en
Pages : 346

Get Book Here

Book Description
Essays in Group Theory contains five papers on topics of current interest which were presented in a seminar at MSRI, Berkeley in June, 1985. Special mention should be given to Gromov`s paper, one of the most significant in the field in the last decade. It develops the theory of hyperbolic groups to include a version of small cancellation theory sufficiently powerful to recover deep results of Ol'shanskii and Rips. Each of the remaining papers, by Baumslag and Shalen, Gersten, Shalen, and Stallings contains gems. For example, the reader will delight in Stallings' explicit construction of free actions of orientable surface groups on R-trees. Gersten's paper lays the foundations for a theory of equations over groups and contains a very quick solution to conjugacy problem for a class of hyperbolic groups. Shalen's article reviews the rapidly expanding theory of group actions on R-trees and the Baumslag-Shalen article uses modular representation theory to establish properties of presentations whose relators are pth-powers.

Encyclopaedia of Mathematics

Encyclopaedia of Mathematics PDF Author: M. Hazewinkel
Publisher: Springer
ISBN: 1489937978
Category : Mathematics
Languages : en
Pages : 927

Get Book Here

Book Description


Combinatorial and Geometric Group Theory, Edinburgh 1993

Combinatorial and Geometric Group Theory, Edinburgh 1993 PDF Author: Andrew J. Duncan
Publisher: Cambridge University Press
ISBN: 9780521465953
Category : Mathematics
Languages : en
Pages : 340

Get Book Here

Book Description
Authoritative collection of surveys and papers that will be indispensable to all research workers in the area.

The Concise Handbook of Algebra

The Concise Handbook of Algebra PDF Author: Alexander V. Mikhalev
Publisher: Springer Science & Business Media
ISBN: 9401732671
Category : Mathematics
Languages : en
Pages : 629

Get Book Here

Book Description
It is by no means clear what comprises the "heart" or "core" of algebra, the part of algebra which every algebraist should know. Hence we feel that a book on "our heart" might be useful. We have tried to catch this heart in a collection of about 150 short sections, written by leading algebraists in these areas. These sections are organized in 9 chapters A, B, . . . , I. Of course, the selection is partly based on personal preferences, and we ask you for your understanding if some selections do not meet your taste (for unknown reasons, we only had problems in the chapter "Groups" to get enough articles in time). We hope that this book sets up a standard of what all algebraists are supposed to know in "their" chapters; interested people from other areas should be able to get a quick idea about the area. So the target group consists of anyone interested in algebra, from graduate students to established researchers, including those who want to obtain a quick overview or a better understanding of our selected topics. The prerequisites are something like the contents of standard textbooks on higher algebra. This book should also enable the reader to read the "big" Handbook (Hazewinkel 1999-) and other handbooks. In case of multiple authors, the authors are listed alphabetically; so their order has nothing to do with the amounts of their contributions.

Language and Automata Theory and Applications

Language and Automata Theory and Applications PDF Author: Adrian-Horia Dediu
Publisher: Springer
ISBN: 3319300008
Category : Computers
Languages : en
Pages : 618

Get Book Here

Book Description
This book constitutes the refereed proceedings of the 10th International Conference on Language and Automata Theory and Applications, LATA 2016, held in Prague, Czech Republic, in March 2016. The 42 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 119 submissions. The papers cover the following topics: algebraic language theory; algorithms for semi-structured data mining, algorithms on automata and words; automata and logic; automata for system analysis and program verification; automata networks, concurrency and Petri nets; automatic structures; cellular automata, codes, combinatorics on words; computational complexity; data and image compression; descriptional complexity; digital libraries and document engineering; foundations of finite state technology; foundations of XML; fuzzy and rough languages; grammatical inference and algorithmic learning; graphs and graph transformation; language varieties and semigroups; parallel and regulated rewriting; parsing; patterns; string and combinatorial issues in computational biology and bioinformatics; string processing algorithms; symbolic dynamics; term rewriting; transducers; trees, tree languages and tree automata; weighted automata.

Algorithmic Problems of Group Theory, Their Complexity, and Applications to Cryptography

Algorithmic Problems of Group Theory, Their Complexity, and Applications to Cryptography PDF Author: Delaram Kahrobaei
Publisher: American Mathematical Soc.
ISBN: 0821898590
Category : Business & Economics
Languages : en
Pages : 136

Get Book Here

Book Description
This volume contains the proceedings of the AMS Special Session on Algorithmic Problems of Group Theory and Their Complexity, held January 9-10, 2013 in San Diego, CA and the AMS Special Session on Algorithmic Problems of Group Theory and Applications to Information Security, held April 6-7, 2013 at Boston College, Chestnut Hill, MA. Over the past few years the field of group-based cryptography has attracted attention from both group theorists and cryptographers. The new techniques inspired by algorithmic problems in non-commutative group theory and their complexity have offered promising ideas for developing new cryptographic protocols. The papers in this volume cover algorithmic group theory and applications to cryptography.

Mathematical Foundations of Computer Science 2011

Mathematical Foundations of Computer Science 2011 PDF Author: Filip Murlak
Publisher: Springer Science & Business Media
ISBN: 3642229921
Category : Computers
Languages : en
Pages : 630

Get Book Here

Book Description
This volume constitutes the refereed proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science, MFCS 2011, held in Warsaw, Poland, in August 2011. The 48 revised full papers presented together with 6 invited talks were carefully reviewed and selected from 129 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, grammars and formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, cryptography and security, databases and knowledge-based systems, formal specifications and program development, foundations of computing, logic in computer science, mobile computing, models of computation, networks, parallel and distributed computing, quantum computing, semantics and verification of programs, and theoretical issues in artificial intelligence.