English
Related papers

Related papers: Zappa-Sz\'ep products of Garside monoids

200 papers

A Garside monoid is a cancellative monoid with a finite lattice generating set; a Garside group is the group of fractions of a Garside monoid. The family of Garside groups contains the Artin-Tits groups of spherical type. We generalise the…

Group Theory · Mathematics 2007-05-23 Eddy Godelle

Divisibility monoids (resp. Garside monoids) are a natural algebraic generalization of Mazurkiewicz trace monoids (resp. spherical Artin monoids), namely monoids in which the distributivity of the underlying lattices (resp. the existence of…

Group Theory · Mathematics 2007-07-06 Matthieu Picantin

We use the lens of Zappa--Sz\'ep decomposition to examine the relationship between directed graph products and $k$-graph products. There are many examples of higher-rank graphs, or $k$-graphs, whose underlying directed graph may be factored…

Operator Algebras · Mathematics 2025-03-12 Adlin Abell-Ball , Elizabeth Gillaspy , George Glidden-Handgis , S. Joseph Lippert

Garside calculus is the common mechanism that underlies a certain type of normal form for the elements of a monoid, a group, or a category. Originating from Garside's approach to Artin's braid groups, it has been extended to more and more…

Group Theory · Mathematics 2014-02-25 Patrick Dehornoy , Volker Gebhardt

We describe a simple scheme for constructing finitely generated monoids in which left-divisibility is a linear ordering and for practically investigating these monoids. The approach is based on subword reversing, a general method of…

Group Theory · Mathematics 2012-05-09 Patrick Dehornoy

In factoring matrices into the product of two matrices operations are typically performed with elements restricted to matrix subspaces. Such modest structural assumptions are realistic, for example, in large scale computations. This paper…

Functional Analysis · Mathematics 2011-12-01 Marko Huhtanen

We describe how an Ore category with a Garside family can be used to construct a classifying space for its fundamental group(s). The construction simultaneously generalizes Brady's classifying space for braid groups and the Stein--Farley…

Group Theory · Mathematics 2019-05-29 Stefan Witzel

The Garside group, as a generalization of braid groups and Artin groups of finite types, is defined as the group of fractions of a Garside monoid. We show that the semidirect product of Garside monoids is a Garside monoid. We use the…

Geometric Topology · Mathematics 2010-06-03 Sang Jin Lee

Let $M$ be a cancellative and commutative monoid. A submonoid $N$ of $M$ is called an undermonoid if the Grothendieck groups of $M$ and $N$ coincide. For a given property $\mathfrak{p}$, we are interested in providing an answer to the…

Commutative Algebra · Mathematics 2024-12-17 Felix Gotti , Bangzheng Li

Let $G$ be a group and $X$ be a product system over a semigroup $P$. Suppose $G$ has a left action on $P$ and $P$ has a right action on $G$, so that one can form a Zappa-Sz\'ep product $P\bowtie G$. We define a Zappa-Sz\'ep action of $G$ on…

Operator Algebras · Mathematics 2020-12-02 Boyu Li , Dilian Yang

For a monoid $M$, we denote by $\mathbb G(M)$ the group of units, $\mathbb E(M)$ the submonoid generated by the idempotents, and $\mathbb G_L(M)$ and $\mathbb G_R(M)$ the submonoids consisting of all left or right units. Writing $\mathcal…

Group Theory · Mathematics 2020-06-08 James East

We define and study the external and the internal Zappa-Sz\'{e}p product of twists over groupoids. We determine when a pair $(\Sigma_{1},\Sigma_{2})$ of twists over a matched pair $(\mathcal{G}_{1},\mathcal{G}_{2})$ of groupoids gives rise…

Operator Algebras · Mathematics 2024-06-04 Anna Duwenig , Boyu Li

We construct certain monoids, called tied monoids. These monoids result to be semidirect products finitely presented and commonly built from braid groups and their relatives acting on monoids of set partitions. The nature of our monoids…

Representation Theory · Mathematics 2023-01-05 Diego Arcis , Jesús Juyumaya

Let $A$ be a not necessarily commutative monoid with zero such that projective $A$-acts are free. This paper shows that the algebraic K-groups of $A$ can be defined using the +-construction and the Q-construction. It is shown that these two…

K-Theory and Homology · Mathematics 2010-09-17 Chenghao Chu , Jack Morava

A Garside group is a group admitting a finite lattice generating set D. Using techniques developed by Bestvina for Artin groups of finite type, we construct K(\pi,1)s for Garside groups. This construction shows that the (co)homology of any…

Group Theory · Mathematics 2007-05-23 Ruth Charney , John Meier , Kim Whittlesey

A factorization of an element $x$ in a monoid $(M, \cdot)$ is an expression of the form $x = u_1^{z_1} \cdots u_k^{z_k}$ for irreducible elements $u_1, \ldots, u_k \in M$, and the length of such a factorization is $z_1 + \cdots + z_k$. We…

We show the intimate connection between various mathematical notions that are currently under active investigation: a class of Garside monoids, with a "nice" Garside element, certain monoids $S$ with quadratic relations, whose monoidal…

Quantum Algebra · Mathematics 2009-09-28 Tatiana Gateva-Ivanova

We study arithmetic properties of factorizations of elements into products of generators, in monoids given with explicit presentations. After relating and comparing this perspective to the more usual approach of factoring into products of…

Group Theory · Mathematics 2026-03-10 Alfred Geroldinger , Zachary Mesyan

The aim of this paper is sketch a theory of divisibility and factorisation in topological monoids, where finite products are replaced by convergent products. The algebraic case can then be viewed as the special case of discretely…

General Topology · Mathematics 2007-05-23 Jan Snellman

We study the variety ZG of monoids where the elements that belong to a group are central, i.e., commute with all other elements. We show that ZG is local, that is, the semidirect product ZG * D of ZG by definite semigroups is equal to LZG,…

Formal Languages and Automata Theory · Computer Science 2024-02-14 Antoine Amarilli , Charles Paperman
‹ Prev 1 2 3 10 Next ›