Related papers: Logspace Computations in Coxeter Groups and Graph …
We provide geometric conditions on a pair of hyperplanes of a CAT(0) cube complex that imply divergence bounds for the cube complex. As an application, we classify all right-angled Coxeter groups with quadratic divergence and show…
A class of topological spaces is topologically rigid if any two spaces with the same fundamental group are also homeomorphic. Topological rigidity, in addition to its intrinsic interest, has been useful for solving abstract commensurability…
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…
Planarity Testing is the problem of determining whether a given graph is planar while planar embedding is the corresponding construction problem. The bounded space complexity of these problems has been determined to be exactly Logspace by…
In recent papers we have refined a conjecture of Lehrer and Solomon expressing the character of a finite Coxeter group $W$ acting on the $p$th graded component of its Orlik-Solomon algebra as a sum of characters induced from linear…
Many isomorphism problems for tensors, groups, algebras, and polynomials were recently shown to be equivalent to one another under polynomial-time reductions, prompting the introduction of the complexity class TI (Grochow & Qiao, ITCS '21;…
We give an algebraic proof of the independence of Coxeter moves involved in the construction of positive representations of split-real quantum groups, thus completing a gap in the original construction. To do this, we propose a new…
In this paper, we deal with stable homology computations with twisted coefficients for mapping class groups of surfaces and of 3-manifolds, automorphism groups of free groups with boundaries and automorphism groups of certain right-angled…
We construct complex root spaces remaining invariant under antilinear involutions related to all Coxeter groups. We provide two alternative constructions: One is based on deformations of factors of the Coxeter element and the other based on…
For right-angled Coxeter groups $W_{\Gamma}$, we obtain a condition on $\Gamma$ that is necessary and sufficient to ensure that $W_{\Gamma}$ is thick and thus not relatively hyperbolic. We show that Coxeter groups which are not thick all…
We describe a practical algorithm for computing normal forms for semigroups and monoids with finite presentations satisfying so-called small overlap conditions. Small overlap conditions are natural conditions on the relations in a…
In this paper we solve the isomorphism problem for all large-type Artin groups. Our strategy involves reconstructing the Coxeter groups associated with large-type Artin groups in a purely algebraic way. This answers several questions raised…
We describe an algorithm to find the virtual cohomological dimension of the automorphism group of a right-angled Artin group. The algorithm works in the relative setting; in particular it also applies to untwisted automorphism groups and…
We present an algebraic view on logic programming, related to proof theory and more specifically linear logic and geometry of interaction. Within this construction, a characterization of logspace (deterministic and non-deterministic)…
Artin groups are a natural generalization of braid groups and are well-understood in certain cases. Artin groups are closely related to Coxeter groups. There is a faithful representation of a Coxeter group $W$ as a linear reflection group…
We study the computational complexity of the Word Problem (WP) in free solvable groups $S_{r,d}$, where $r \geq 2$ is the rank and $d \geq 2$ is the solvability class of the group. It is known that the Magnus embedding of $S_{r,d}$ into…
For every fixed class of regular languages, there is a natural hierarchy of increasingly more general problems: Firstly, the membership problem asks whether a given language belongs to the fixed class of languages. Secondly, the separation…
We study the complexity of isomorphism problems for d-way arrays, or tensors, under natural actions by classical groups such as orthogonal, unitary, and symplectic groups. Such problems arise naturally in statistical data analysis and…
We define the logarithmic tautological rings of the moduli spaces of Deligne-Mumford stable curves (together with a set of additive generators lifting the decorated strata classes of the standard tautological rings). While these algebras…
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…