Related papers: Artin groups of large type are shortlex automatic …
The article defines and studies the genus of finite state deterministic automata (FSA) and regular languages. Indeed, a FSA can be seen as a graph for which the notion of genus arises. At the same time, a FSA has a semantics via its…
We propose the systematic study of presentations that can be generalised over a continuous open group monomorphism. Presentations with this property can turn well-known presentations such as those for as orientable surface groups, Artin…
For surface groups and right-angled Artin groups, we prove lower bounds on the shortest word in the generators representing a nontrivial element of the kth term of the lower central series.
We define a functorial "Artin map" attached to any small $\bf{Z}$-linear stable $\infty$-category, which in the case of perfect complexes over a global field recovers the usual Artin map from the idele class group to the abelianized…
We extend previous results by Cumplido, Martin and Vaskou on parabolic subgroups of large-type Artin groups to a broader family of two-dimensional Artin groups. In particular, we prove that an arbitrary intersection of parabolic subgroups…
In this paper we construct a gathering process by the means of which we obtain new normal forms in braid groups. The new normal forms generalise Artin-Markoff normal forms and possess an extremely natural geometric description. In the two…
We prove that the natural homomorphism from an Artin monoid to its associated Artin group is always injective
Hereditarily finite (HF) set theory provides a standard universe of sets, but with no infinite sets. Its utility is demonstrated through a formalisation of the theory of regular languages and finite automata, including the Myhill-Nerode…
The action of the mapping class group of the thrice-punctured projective plane on its $\mathrm{GL}(2,\mathbb{C})$ character variety produces an algorithm for generating the simple length spectra of quasi-Fuchsian thrice-punctured projective…
The twin group $T_n$ is a right angled Coxeter group generated by $n- 1$ involutions and having only far commutativity relations. These groups can be thought of as planar analogues of Artin braid groups. In this note, we study some…
We study the dilatation of outer automorphisms of right-angled Artin groups. Given a right-angled Artin group defined on a simplicial graph: $A(\Gamma) = \langle V | E \rangle$ and an automorphism $\phi \in Out(A(\Gamma))$ there is a…
This paper is a short survey on four basic questions on Artin-Tits groups: the torsion, the center, the word problem, and the cohomology ($K(\pi,1)$ problem). It is also an opportunity to prove three new results concerning these questions:…
We consider faithful actions of simple algebraic groups on self-dual irreducible modules, and on the associated varieties of totally singular subspaces, under the assumption that the dimension of the group is at least as large as the…
Let $n\ge2$. In this note we give a short uniform proof of property $R_\infty$ for the Artin-Tits groups of spherical types $A_n$, $B_n$, $D_4$, $I_2(m)$ ($m\ge3$), their pure subgroups, and for the Artin-Tits groups of affine types…
We prove that an Artin group splits over infinite cyclic subgroups if and only if its defining graph has a separating vertex, and explicitly construct a JSJ decomposition over infinite cyclic subgroups for all Artin groups. We then use…
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…
Automated Theorem Proving (ATP) is an established branch of Artificial Intelligence. The purpose of ATP is to design a system which can automatically figure out an algorithm either to prove or disprove a mathematical claim, on the basis of…
Computing normal forms in groups (or monoids) is in general harder than solving the word problem (equality testing). However, normal form computation has a much wider range of applications. It is therefore interesting to investigate the…
For a formation $\mathfrak{F}$ of finite groups consider a graph whose vertices are elements of a finite group and two vertices are connected by an edge if and only if they generates non-$\mathfrak{F}$-group as elements of a group. A…
We characterize convex cocompact subgroups of mapping class groups that arise as subgroups of specially embedded right-angled Artin groups. That is, if the right-angled Artin group G in Mod(S) satisfies certain conditions that imply G is…