Related papers: Conjugacy in Garside groups I: Cyclings, powers, a…
We generalize the enhanced power graph by replacing elements with conjugacy classes. The main result of this paper is to determine when this graph is triangle-free.
A group G is almost cyclic if there is an element x in G, such that for all g in G, there is an element y in G and an integer n with ygy^{-1} = x^n (that is, every element is conjugate to some power of x). W. Ziller asked whether there are…
This paper initiates the study of effective twisted conjugacy separability for finitely generated groups, which measures the complexity of separating distinct twisted conjugacy classes via finite quotients. The focus is on nilpotent groups,…
Let $\Gamma$ be an undirected and simple graph. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components containing cycles. If $\Gamma$ has a cyclic…
We develop a rigidity theory for frameworks in $\mathbb{R}^3$ which have two coincident points but are otherwise generic and only infinitesimal motions which are tangential to a family of cylinders induced by the realisation are considered.…
On the model of simple braids, defined to be the left divisors of Garside's elements $\Delta\_n$ in the monoid $B\_\infty^+$ , we investigate simple elements in Thompson's monoid $F^+$ and in a larger monoid $H^+$ that is a hybrid of…
Let $G$ be a group endowed with a solution to the conjugacy problem and with an algorithm which computes the centralizer in $G$ of any element of $G$. Let $H$ be a subgroup of $G$. We give some conditions on $H$, under which we provide a…
In this paper, the cyclic codes of length $n$, where $n$ is odd with certain restrictions, over a finite chain ring $R$, have been studied using the structure of group algebra approach. The primitive idempotents of $RG$ of a finite cyclic…
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…
Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R^d in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity…
In a group $G$, elements $a$ and $b$ are conjugate if there exists $g\in G$ such that $g^{-1} ag=b$. This conjugacy relation, which plays an important role in group theory, can be extended in a natural way to inverse semigroups: for…
A left brace is a triple $(\mathcal{B},+,\cdot)$, where $(\mathcal{B},+)$ is an abelian group, $(\mathcal{B},\cdot)$ is a group, and there is a left-distributivity-like axiom that relates between the two operations in $\mathcal{B}$. In…
The cyclic shift graph of a monoid is the graph whose vertices are the elements of the monoid and whose edges connect elements that are cyclic shift related. The Patience Sorting algorithm admits two generalizations to words, from which two…
Machine learning and pattern recognition techniques have been successfully applied to algorithmic problems in free groups. In this paper, we seek to extend these techniques to finitely presented non-free groups, with a particular emphasis…
We establish faithfulness of braid group actions generated by twists along an ADE configuration of $2$-spherical objects in a derived category. Our major tool is the Garside structure on braid groups of type ADE. This faithfulness result…
We give a computational algorithm which decides if a braid is quasipositive or not. A braid is quasipositive if it's a product of conjuguates of generators. For this, we use the theory of Garside and the combinatorials properties of the…
In this paper we discuss some connections between measurable dynamics and rigidity aspects of group representations and group actions. A new ergodic feature of familiar group boundaries is introduced, and is used to obtain rigidity results…
This is the first in a series of papers on geometric mapping theory in Carnot groups -- and more generally equiregular manifolds -- in which we prove a number of new structural results for Sobolev (in particular quasisymmetric) mappings,…
An important piece of information in the theory of the arithmetic Galois action on the geometric fundamental groups of schemes is that divisorial inertia is acted on cyclotomically. We detail in this note the content of this fact in the…
We construct an extension $E(A,G)$ of a given group $G$ by infinite non-Archimedean words over an discretely ordered abelian group like $Z^n$. This yields an effective and uniform method to study various groups that "behave like $G$". We…