LLMpediaThe first transparent, open encyclopedia generated by LLMs

Garside structures

Generated by GPT-5-mini
Note: This article was automatically generated by a large language model (LLM) from purely parametric knowledge (no retrieval). It may contain inaccuracies or hallucinations. This encyclopedia is part of a research project currently under review.
Article Genealogy
Parent: braid group Hop 4
Expansion Funnel Raw 93 → Dedup 0 → NER 0 → Enqueued 0
1. Extracted93
2. After dedup0 (None)
3. After NER0 ()
4. Enqueued0 ()
Garside structures
NameGarside structures
FieldAlgebra
Introduced1969
Introduced byF. A. Garside

Garside structures are algebraic frameworks that generalize combinatorial and order-theoretic features of certain monoids and groups, providing tools for solving word and conjugacy problems and for constructing normal forms. They connect with several notable subjects in algebra and topology through combinatorial lattices, partially ordered sets, and divisibility relations. Developed from work on braid groups, they have influenced research linked to various institutions and contributors.

Definition and basic concepts

A Garside structure consists of a cancellative monoid with finite lattice properties, a distinguished element acting as a Garside element, and associated notions of left and right divisibility, simple elements, and lattice operations; these ideas relate to concepts studied at University of Cambridge, Université Paris-Sud, University of Oxford, Harvard University, and Massachusetts Institute of Technology. Fundamental definitions draw on work connected to scholars at University of Manchester, University of Warwick, University of Tokyo, Princeton University, and University of California, Berkeley. Core terms include simple elements, atoms, lcm and gcd structures, and complemented presentations, with formalism employed in seminars at Institut des Hautes Études Scientifiques, École Normale Supérieure, Max Planck Institute for Mathematics, Clay Mathematics Institute, and American Mathematical Society meetings.

Examples and classes of Garside structures

Classic examples of Garside-type structures come from braid monoids and their groups, Artin-Tits monoids of spherical type, finite-type Coxeter groups, and dual braid monoids; these families have been studied in contexts involving University of Geneva, ETH Zurich, University of Bonn, University of Sydney, and Seoul National University. Specific classes include spherical Artin groups, affine-type generalizations, complex reflection groups, and FC-type Artin groups; investigations appear in collaborations with researchers affiliated to University of Utrecht, University of Paris-Saclay, University of Hamburg, Weizmann Institute of Science, and University of Illinois at Urbana–Champaign. Further constructions produce Garside families in small-cancellation groups, mapping class group submonoids, and certain HNN extensions, themes that have been part of programs at Brown University, Columbia University, University of Chicago, Yale University, and Cornell University.

Algebraic properties and consequences

Garside structures yield lattice-theoretic properties, existence of finite complete sets of simples, cancellativity, and noetherianity, with consequences studied in papers circulated through Society for Industrial and Applied Mathematics, European Mathematical Society, Royal Society, National Academy of Sciences, and conferences at Institute for Advanced Study. Algebraic consequences include solvability of the word problem, conjugacy separability in certain cases, torsion considerations, and embedding criteria linking to Royal Holloway, University of London, Université de Montréal, Imperial College London, University of Leeds, and University of Bath. Structural theorems connect to centralizer calculations, growth functions, homological finiteness properties, and cohomological dimension analyses that have been topics at International Congress of Mathematicians, European Congress of Mathematics, Society for Industrial and Applied Mathematics Annual Meeting, Association for Symbolic Logic, and International Centre for Theoretical Physics workshops.

Normal forms and algorithmic aspects

Garside structures provide normal forms—left normal form, right normal form, greedy normal form—enabling algorithms for word reduction, conjugacy search, and root extraction; algorithmic development has been pursued at Microsoft Research, Google Research, IBM Research, Amazon Web Services, and NVIDIA Research collaborations on computational group theory. Complexity analyses, automaticity results, and biautomaticity connections have been presented in venues affiliated with SIAM, ACM, European Symposium on Algorithms, International Symposium on Symbolic and Algebraic Computation, and North American Meetings of the AMS. Implementations and computational experiments are reported from groups at University of Warwick, Université de Bordeaux, Technical University of Denmark, Politecnico di Milano, and Rijksuniversiteit Groningen.

Connections to braid groups and Artin groups

The prototypical example is the braid monoid leading to braid groups, with seminal influence from work on the Braid group by studies held at University of Cambridge, University of Oxford, University of California, Los Angeles, University of Utah, and University of Massachusetts Amherst. Relationships to Artin groups of finite type, dual presentations, and complex reflection groups link to research programs at University of Strasbourg, University of Lyon, University of Barcelona, University of Padua, and University of Ljubljana. The interplay with mapping class groups, knot theory, and contact topology has been emphasized in collaborations involving Princeton University, Caltech, Rutgers University, University of Pennsylvania, and Duke University.

Applications in group theory and topology

Applications include solutions to the word and conjugacy problems in various groups, structural insights into mapping class groups, implications for fibered links, and contributions to 3-manifold theory; these applications have been developed in projects at University of Cambridge, University of Edinburgh, King's College London, University of Manchester, and University of Glasgow. Garside-based techniques inform study of orderable groups, Dehn fillings, and automorphism groups of free groups, with links to workshops at Max-Planck-Institut für Mathematik, Centre de Recerca Matemàtica, Institut Mittag-Leffler, Kavli Institute for Theoretical Physics, and Fields Institute.

Historical development and key contributors

The concept traces to foundational work on the braid group by F. A. Garside (Liverpool), with further development by researchers such as Patrick Dehornoy, Jean Michel, Eddy Godelle, François Digne, Luis Paris, and Maria Chlouveraki; influential contributions came from collaborations associated with University of Liverpool, Université Paris 13, University of Marseille, Université de Provence, Université catholique de Louvain, University of Rome La Sapienza, and University of Bonn. Subsequent extensions and duality theories were advanced in projects at Université Grenoble Alpes, University of Copenhagen, University of Helsinki, University of Helsinki Department of Mathematics and Statistics, and University of Kyoto, with community-wide dissemination via meetings of the London Mathematical Society, American Mathematical Society, European Mathematical Society, International Congress of Mathematicians, and specialized workshops on algebraic and geometric group theory.

Category:Algebra