This text is a monograph on algebra, with connections to geometry and low-dimensional topology. It mainly involves groups, monoids, and categories, and aims to provide a unified treatment for those situations in which one can find distinguished decompositions by iteratively extracting a maximal fragment lying in a prescribed family. Initiated in 1969 by F. A. Garside in the case of Artin's braid groups, this approach led to interesting results in a number of cases, the central notion being what the authors call a Garside family. The study is far from complete, and the purpose of this book is to present the current state of the theory and to invite further research. The book has two parts: In Part A, the bases of a general theory, including many easy examples, are developed. In Part B, various more sophisticated examples are specifically addressed. To make the content accessible to a wide audience of nonspecialists, the book's exposition is essentially self-contained and very few prerequisites are needed. In particular, it should be easy to use this as a textbook both for Garside theory and for the more specialized topics investigated in Part B: Artin-Tits groups, Deligne-Lusztig varieties, groups of algebraic laws, ordered groups, and structure groups of set-theoretic solutions of the Yang-Baxter equation. The first part of the book can be used as the basis for a graduate or advanced undergraduate course.

This book constitutes the proceedings of the 24th International Symposium on Fundamentals of Computation Theory, FCT 2023, held in Trier, Germany, in September 2023. The __ full papers included in this volume were carefully reviewed and selected from __ submissions. In addition, the book contains ____ invited talks. The papers cover topics of all aspects of theoretical computer science, in particular algorithms, complexity, formal and logical methods.

Surveys the state of the art in geometric and cohomological group theory. Ideal entry point for young researchers.

This book constitutes the proceedings of the 19th International Conference on Developments in Language Theory, DLT 2015, held in Liverpool, UK. The 31 papers presented together with 5 invited talks were carefully reviewed and selected from 54 submissions. Its scope is very general and includes, among others, the following topics and areas: combinatorial and algebraic properties of words and languages, grammars, acceptors and transducers for strings, trees, graphs, arrays, algebraic theories for automata and languages, codes, efficient text algorithms, symbolic dynamics, decision problems, relationships to complexity theory and logic, picture description and analysis, polyominoes and bidimensional patterns, cryptography, concurrency, cellular automata, bio-inspired computing, and quantum computing.

This collaborative book presents recent trends on the study of sequences, including combinatorics on words and symbolic dynamics, and new interdisciplinary links to group theory and number theory. Other chapters branch out from those areas into subfields of theoretical computer science, such as complexity theory and theory of automata. The book is built around four general themes: number theory and sequences, word combinatorics, normal numbers, and group theory. Those topics are rounded out by investigations into automatic and regular sequences, tilings and theory of computation, discrete dynamical systems, ergodic theory, numeration systems, automaton semigroups, and amenable groups. This volume is intended for use by graduate students or research mathematicians, as well as computer scientists who are working in automata theory and formal language theory. With its organization around unified themes, it would also be appropriate as a supplemental text for graduate level courses.

Cryptography lies at the heart of most technologies deployed today for secure communications. At the same time, mathematics lies at the heart of cryptography, as cryptographic constructions are based on algebraic scenarios ruled by group or number theoretical laws. Understanding the involved algebraic structures is, thus, essential to design robust cryptographic schemes. This Special Issue is concerned with the interplay between group theory, symmetry and cryptography. The book highlights four exciting areas of research in which these fields intertwine: post-quantum cryptography, coding theory, computational group theory and symmetric cryptography. The articles presented demonstrate the relevance of rigorously analyzing the computational hardness of the mathematical problems used as a base for cryptographic constructions. For instance, decoding problems related to algebraic codes and rewriting problems in non-abelian groups are explored with cryptographic applications in mind. New results on the algebraic properties or symmetric cryptographic tools are also presented, moving ahead in the understanding of their security properties. In addition, post-quantum constructions for digital signatures and key exchange are explored in this Special Issue, exemplifying how (and how not) group theory may be used for developing robust cryptographic tools to withstand quantum attacks.

Lie theory is a mathematical framework for encoding the concept of symmetries of a problem, and was the central theme of an INdAM intensive research period at the Centro de Giorgi in Pisa, Italy, in the academic year 2014-2015. This book gathers the key outcomes of this period, addressing topics such as: structure and representation theory of vertex algebras, Lie algebras and superalgebras, as well as hyperplane arrangements with different approaches, ranging from geometry and topology to combinatorics.