Related papers: Logspace Computations in Coxeter Groups and Graph …
We construct finite volume hyperbolic manifolds with large symmetry groups. The construction makes use of the presentations of finite Coxeter groups provided by Barot and Marsh and involves mutations of quivers and diagrams defined in the…
Geometric hitting set problems, in which we seek a smallest set of points that collectively hit a given set of ranges, are ubiquitous in computational geometry. Most often, the set is discrete and is given explicitly. We propose new…
We generalize the tensor product theory for modules for a vertex operator algebra previously developed in a series of papers by the first two authors to suitable module categories for a ''conformal vertex algebra'' or even more generally,…
We discuss a practical algorithm to compute parabolic Kazhdan-Lusztig polynomials. As an application we compute Kazhdan-Lusztig polynomials which are needed to evaluate a character formula for reductive groups due to Lusztig. Some…
In [5], Elnitsky constructed three elegant bijections between classes of reduced words for Type $\mathrm{A}$, $\mathrm{B}$ and $\mathrm{D}$ families of Coxeter groups and certain tilings of polygons. This paper offers a particular…
We prove the statement/conjecture of M. Kontsevich on the existence of the logarithmic formality morphism. This question was open since 1999, and the main obstacle was the presence of $dr/r$ type singularities near the boundary $r=0$ in the…
The complexity of algorithms solving the motion planning problem is measured by a homotopy invariant TC(X) of the configuration space X of the system. Previously known lower bounds for TC(X) use the structure of the cohomology algebra of X.…
We consider spaces of modular forms attached to definite orthogonal groups of low even rank and nontrivial level, equipped with Hecke operators defined by Kneser neighbours. After reviewing algorithms to compute with these spaces, we…
The study of automorphisms of computable and other structures connects computability theory with classical group theory. Among the noncomputable countable structures, computably enumerable structures are one of the most important objects of…
We introduce a new quasi-isometry invariant of 2-dimensional right-angled Coxeter groups, the hypergraph index, that partitions these groups into infinitely many quasi-isometry classes, each containing infinitely many groups. Furthermore,…
Recently, the authors of this paper introduced logarithmic Hochschild (co)homology of logarithmic spaces in a geometric way using formality of derived intersections. In this paper, the authors extend the decomposition theorem for the…
Right-reversing is an algorithm used to compute least common multiples in monoids that admit a right-complemented presentation. The algorithm can either terminate and find a result, fail, or run indefinitely. The correctness of the…
Recent work has explored methods for learning continuous vector space word representations reflecting the underlying semantics of words. Simple vector space arithmetic using cosine distances has been shown to capture certain types of…
For any right-angled Coxeter group $\Gamma$ on $k$ generators, we construct proper actions of $\Gamma$ on $\mathrm{O}(p,q+1)$ by right and left multiplication, and on the Lie algebra $\mathfrak{o}(p,q+1)$ by affine transformations, for some…
One exact and two heuristic algorithms for determining the generators, orbits and order of the graph automorphism group are presented. A basic tool of these algorithms is the well-known individualization and refinement procedure. A search…
We generalize the "facial weak order" of a finite Coxeter group to a partial order on a set of intervals in a complete lattice. We apply our construction to the lattice of torsion classes of a finite-dimensional algebra and consider its…
In this paper we consider several classical and novel algorithmic problems for right-angled Artin groups, some of which are closely related to graph theoretic problems, and study their computational complexity. We study these problems with…
A monoid $M$ generated by a set $S$ of symbols can be described as the set of equivalence classes of finite words in $S$ under some relations that specify when some contiguous sequence of symbols can be replaced by another. If $a,b\in S$, a…
Difficult, in particular NP-complete, optimization problems are traditionally solved approximately using search heuristics. These are usually slowed down by the rugged landscapes encountered, because local minima arrest the search process.…
A new family of groups, called trickle groups, is presented. These groups generalize right-angled Artin and Coxeter groups, as well as cactus groups. A trickle group is defined by a presentation with relations of the form $xy = zx$ and…