Related papers: General cycling operations in Garside groups
This paper provides a preparatory introduction to torsors, written with a view toward later applications in the author's work. Rather than aiming at a comprehensive survey, the exposition focuses on those aspects of torsors that are most…
In this paper we introduce a notion of {\it generalized operad} containing as special cases various kinds of operad--like objects: ordinary, cyclic, modular, properads etc. We then construct inner cohomomorphism objects in their categories…
A non-trivial element of a group is a generalized torsion element if some products of its conjugates is the identity. The minimum number of such conjugates is called a generalized torsion order. We provide several restrictions for…
Gracefully degrading algorithms [Biely \etal, TCS 2018] are designed to circumvent impossibility results in dynamic systems by adapting themselves to the dynamics. Indeed, such an algorithm solves a given problem under some dynamics and,…
Orbit harmonics is a tool in combinatorial representation theory which promotes the (ungraded) action of a linear group $G$ on a finite set $X$ to a graded action of $G$ on a polynomial ring quotient by viewing $X$ as a $G$-stable point…
We initiate the study of C*-algebras and groupoids arising from left regular representations of Garside categories, a notion which originated from the study of Braid groups. Every higher rank graph is a Garside category in a natural way. We…
We study a class of aggregate-join queries with multiple aggregation operators evaluated over annotated relations. We show that straightforward extensions of standard multiway join algorithms and generalized hypertree decompositions (GHDs)…
In this work, we address a question posed by Dehornoy et al. in the book "Foundations of Garside Theory" that asks for a theory of groups of $\mathrm{I}_G$-type when $G$ is a Garside group. In this article, we introduce a broader notion…
In the context of Higman embeddings of recursive groups into finitely presented groups we suggest an algorithm which uses Higman operations to explicitly constructs the specific recursively enumerable sets of integer sequences arising…
We describe a new presentation for the complex reflection groups of type $(e,e,r)$ and their braid groups. A diagram for this presentation is proposed. The presentation is a monoid presentation which is shown to give rise to a Garside…
In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…
In this paper, we introduce a kind of decomposition of a finite group called a uniform group factorization, as a generalization of exact factorizations of a finite group. A group $G$ is said to admit a uniform group factorization if there…
We prove two theorems of reduction of cocycles taking values in the group of diffeomorphisms of the circle. They generalise previous results obtained by the author concerning rigidity for smooth actions on the circle of Kazhdan's groups and…
This paper constructs a foundation to analyze semi-group actions, group actions, filtrations, and decompositions in a unified manner. In fact, though the studies of decomposition can be applied to foliated spaces and group actions, they can…
In this paper, we extend the classical theory of crossed $G$-sets and the crossed Burnside ring from a finite group $G$ to a finite groupoid $\mathcal{G}$. We introduce a natural monoidal structure on the category of crossed…
This paper is devoted to the proof of the property of order separability for free product of free groups with maximal cyclic amalgamated subgroups.
We make available some results about model theory cyclically ordered groups. We start with a classification of complete theories of divisible abelian cyclically ordered groups. Then we look at the cyclically ordered groups where the only…
It is known that Garside groups are strongly translation discrete. In this paper, we show that the translation numbers in a Garside group are rational with uniformly bounded denominators and can be computed in finite time. As an…
We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.
Motivated by recent activity in low-dimensional topology, we provide a new criterion for left-orderability of a group under the assumption that the group is circularly-orderable: A group $G$ is left-orderable if and only if $G \times…