相关论文: Three-generator Artin groups of large type are bia…
We prove Artin's axioms satisfy a compatibility for composition of 1-morphisms of stacks in groupoids. Consequently, some natural stacks in groupoids are algebraic, including a common generalization of Vistoli's Hilbert stack and the stack…
We linearize the Artin representation of the braid group given by (right) automorphisms of a free group providing a linear faithful representation of the braid group. This result is generalized to obtain linear representations for the…
We place conditions on the presentation graph of a right-angled Artin group that guarantee the standard CAT(0) cube complex on which the group acts geometrically has non-path-connected boundary.
We find a condition on the underlying graph of an Artin group that fully determines if it is subgroup separable. As a consequence, an Artin group is subgroup separable if and only if it can be obtained from Artin groups of ranks at most 2…
We compute the automorphism group of the intersection graph of many large-type Artin groups. This graph is an analogue of the curve graph of mapping class groups but in the context of Artin groups. As an application, we deduce a number of…
We observe an inductive structure in a large class of Artin groups and exploit this information to deduce the Farrell-Jones isomorphism conjecture for several classes of Artin groups of finite real, complex and affine types.
Define a Garside monoid to be a cancellative monoid where right and left lcm's exist and that satisfy additional finiteness assumptions, and a Garside group to be the group of fractions of a Garside monoid. The family of Garside groups…
For any right-angled Artin group, we show that its outer automorphism group contains either a finite-index nilpotent subgroup or a nonabelian free subgroup. This is a weak Tits alternative theorem. We find a criterion on the defining graph…
In this paper, we initiate the study of palindromic automorphisms of groups that are free in some variety. More specifically, we define palindromic automorphisms of free nilpotent groups and show that the set of such automorphisms is a…
We prove that most Artin groups of large and hyperbolic type are Hopfian, meaning that every self-epimorphism is an isomorphism. The class covered by our result is generic, in the sense of Goldsborough-Vaskou. Moreover, assuming the…
In this paper, we define the 2-complete Artin complex and show that it is systolic for locally reducible Artin groups. The stabilizers of simplices in this complex are exactly the proper parabolic subgroups which are "2-complete." We use…
We present a finite set of generators of the automorphism group of a supersingular K3 surface with Artin invariant 1 in characteristic 3.
We show that Artin groups of extra-large type, and more generally Artin groups of large and hyperbolic type, are hierarchically hyperbolic. This implies in particular that these groups have finite asymptotic dimension and uniform…
The quotient of a biautomatic group by a subgroup of the center is shown to be biautomatic. The main tool used is the Neumann-Shapiro triangulation of $S^{n-1}$, associated to a biautomatic structure on ${\Bbb Z}^n$. As an application,…
We study automaton structures, i.e. groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, we…
An integral framed, closed pure n-braid B' in the 3-sphere describes a positive Artin presentation, if the braid B can be put on a disk with holes such that each relation describes a positive path and these paths are disjoint. In the…
We give a complete characterization of the graph products of cyclic groups admitting a Polish group topology, and show that they are all realizable as the group of automorphisms of a countable structure. In particular, we characterize the…
We prove that the triangle Artin group $\mathrm{Art}_{23M}$ splits as a graph of free groups if and only if $M$ is greater than $5$ and even. This answers two questions of Jankiewicz \cite[Question 2.2, Question 2.3]{Jan21} in the negative.…
A group is self-simulable if all its computable actions admit SFT covers, which means roughly that they can be implemented with finitely many tiling constraints. We prove that a graph product of infinite finitely-generated groups is…
We prove that the group of reversible cellular automata (RCA), on any alphabet $A$, contains a subgroup generated by three involutions which contains an isomorphic copy of every finitely generated group of RCA on any alphabet $B$. This…