Vladimir Shpilrain – författare

This book is about three seemingly independent areas of mathematics: combinatorial group theory, the theory of Lie algebras and affine algebraic geometry. Indeed, for many years these areas were being developed fairly independently. Combinatorial group theory, the oldest of the three, was born in the beginning of the 20th century as a branch of low-dimensional topology. Very soon, it became an important area of mathematics with its own powerful techniques. In the 1950s, combinatorial group theory started to influence, rather substantially, the theory of Lie algebrasj thus combinatorial theory of Lie algebras was shaped, although the origins of the theory can be traced back to the 1930s. In the 1960s, B. Buchberger introduced what is now known as Gröbner bases. This marked the beginning of a new, "combinatorial", era in commu­ tative algebra. It is not very likely that Buchberger was directly influenced by ideas from combinatorial group theory, but his famous algorithm bears resemblance to Nielsen''s method, although in a more sophisticated form.

This book is about three seemingly independent areas of mathematics: combinatorial group theory, the theory of Lie algebras and affine algebraic geometry. Indeed, for many years these areas were being developed fairly independently. Combinatorial group theory, the oldest of the three, was born in the beginning of the 20th century as a branch of low-dimensional topology. Very soon, it became an important area of mathematics with its own powerful techniques. In the 1950s, combinatorial group theory started to influence, rather substantially, the theory of Lie algebrasj thus combinatorial theory of Lie algebras was shaped, although the origins of the theory can be traced back to the 1930s. In the 1960s, B. Buchberger introduced what is now known as Gröbner bases. This marked the beginning of a new, "combinatorial", era in commu­ tative algebra. It is not very likely that Buchberger was directly influenced by ideas from combinatorial group theory, but his famous algorithm bears resemblance to Nielsen's method, although in a more sophisticated form.

The book consists of contributions related mostly to public-key cryptography, including the design of new cryptographic primitives as well as cryptanalysis of previously suggested schemes. Most papers are original research papers in the area that can be loosely defined as 'non-commutative cryptography', this means that groups (or other algebraic structures) which are used as platforms are non-commutative.

This book is about relations between three different areas of mathematics and theoretical computer science: combinatorial group theory, cryptography, and complexity theory. It explores how non-commutative (infinite) groups, which are typically studied in combinatorial group theory, can be used in public key cryptography. It also shows that there is remarkable feedback from cryptography to combinatorial group theory because some of the problems motivated by cryptography appear to be new to group theory, and they open many interesting research avenues within group theory. In particular, a lot of emphasis in the book is put on studying search problems, as compared to decision problems traditionally studied in combinatorial group theory. Then, complexity theory, notably generic-case complexity of algorithms, is employed for cryptanalysis of various cryptographic protocols based on infinite groups, and the ideas and machinery from the theory of generic-case complexity are used to study asymptotically dominant properties of some infinite groups that have been applied in public key cryptography so far. This book also describes new interesting developments in the algorithmic theory of solvable groups and another spectacular new development related to complexity of group-theoretic problems, which is based on the ideas of compressed words and straight-line programs coming from computer science.

This book is about three seemingly independent areas of mathematics: combinatorial group theory, the theory of Lie algebras and affine algebraic geometry. Indeed, for many years these areas were being developed fairly independently. Combinatorial group theory, the oldest of the three, was born in the beginning of the 20th century as a branch of low-dimensional topology. Very soon, it became an important area of mathematics with its own powerful techniques. In the 1950s, combinatorial group theory started to influence, rather substantially, the theory of Lie algebrasj thus combinatorial theory of Lie algebras was shaped, although the origins of the theory can be traced back to the 1930s. In the 1960s, B. Buchberger introduced what is now known as Gröbner bases. This marked the beginning of a new, "combinatorial", era in commu­ tative algebra. It is not very likely that Buchberger was directly influenced by ideas from combinatorial group theory, but his famous algorithm bears resemblance to Nielsen's method, although in a more sophisticated form.

This proceedings volume documents the contributions presented at the conference held at Fairfield University and at the Graduate Center, CUNY in 2018 celebrating the New York Group Theory Seminar, in memoriam Gilbert Baumslag, and to honor Benjamin Fine and Anthony Gaglione. It includes several expert contributions by leading figures in the group theory community and provides a valuable source of information on recent research developments.

This proceedings volume documents the contributions presented at the conference held at Fairfield University and at the Graduate Center, CUNY in 2018 celebrating the New York Group Theory Seminar, in memoriam Gilbert Baumslag, and to honor Benjamin Fine and Anthony Gaglione. It includes several expert contributions by leading figures in the group theory community and provides a valuable source of information on recent research developments.

This proceedings volume documents the contributions presented at the conference held at Fairfield University and at the Graduate Center, CUNY in 2018 celebrating the New York Group Theory Seminar, in memoriam Gilbert Baumslag, and to honor Benjamin Fine and Anthony Gaglione. It includes several expert contributions by leading figures in the group theory community and provides a valuable source of information on recent research developments.

Detailed Description

Detailed Description

Detailed Description

This is an annotated collection of over 200 open problems in combinatorial group theory. One can say that most of the problems are closer in spirit to the "purely combinatorial" group theory. However, the authors included several problems with geometric flavor where they felt this was natural. Approximately 20 years ago, a new direction in group theory began to emerge at the interface with theoretical computer science. In recognition of this, the given collection includes problems that are not only significant in combinatorial group theory but also have direct relevance to this emerging area, such as the Post correspondence problem for groups, which is gaining momentum in contemporary research. The “flagship” section includes problems about free groups; these have been at the center of combinatorial group theory for over a century, and they are getting ever more popular due to newly discovered connections with the theoretical computer science mentioned above.Other classes of groups that the authors cover include hyperbolic groups, solvable groups, groups of matrices, and others. The target audience of the book is very broad: from PhD students to senior researchers.

This book is about relations between three di?erent areas of mathematics and theoreticalcomputer science: combinatorialgroup theory, cryptography,and c- plexity theory. We explorehownon-commutative(in?nite) groups,which arety- callystudiedincombinatorialgrouptheory,canbeusedinpublickeycryptography. We also show that there is a remarkable feedback from cryptography to com- natorial group theory because some of the problems motivated by cryptography appear to be new to group theory, and they open many interesting research - enues within group theory. Then, we employ complexity theory, notably generic case complexity of algorithms,for cryptanalysisof various cryptographicprotocols based on in?nite groups. We also use the ideas and machinery from the theory of generic case complexity to study asymptotically dominant properties of some in?nite groups that have been used in public key cryptography so far. It turns out that for a relevant cryptographic scheme to be secure, it is essential that keys are selected from a "very small" (relative to the whole group, say) subset rather than from the whole group.Detecting these subsets ("black holes") for a part- ular cryptographic scheme is usually a very challenging problem, but it holds the keyto creatingsecurecryptographicprimitives basedonin?nite non-commutative groups. The book isbased onlecture notesfor the Advanced Courseon Group-Based CryptographyheldattheCRM,BarcelonainMay2007. Itisagreatpleasureforus to thank Manuel Castellet, the HonoraryDirector of the CRM, for supporting the idea of this Advanced Course. We are also grateful to the current CRM Director, JoaquimBruna,and to the friendly CRM sta?,especially Mrs. N. PortetandMrs. N. Hern' andez, for their help in running the Advanced Course and in preparing the lecture notes.