Rose Morris-Wright

• Doctor of Philosophy
• Visiting Assistant Professor at Middlebury College

We prove that the word problem in an Artin group G based on a diagram without A_3 or B_3 subdiagrams can be solved using a system of length preserving rewrite rules which, together with free reduction, can be used to reduce any word over the standard generators of G to a geodesic word in G in quadratic time. This result builds on work of Holt and R...

In this paper, we investigate properties of the Artin monoid Cayley graph. This is the Cayley graph of an Artin group A_{\Gamma} with respect to the (infinite) generating set given by the associated Artin monoid A^+_{\Gamma} . In a previous paper, the first three authors introduced a monoid Deligne complex and showed that this complex is contractib...

In this paper we investigate properties of the Artin monoid Cayley graph. This is the Cayley graph of an Artin group $A_\Gamma$ with respect to the (infinite) generating set given by the associated Artin monoid $A^+_\Gamma$. In a previous paper, the first three authors introduced a monoid Deligne complex and showed that this complex is contractible...

We give an algorithm to solve the word problem for Artin groups that do not contain any relations of length 3. Furthermore, we prove that, given two geodesic words representing the same element, one can obtain one from the other by using a set of homogeneous relations that never increase the word length.

In this paper we introduce and study some geometric objects associated to Artin monoids. The Deligne complex for an Artin group is a cube complex that was introduced by the second author and Davis [CD95a] to study the K(π,1) conjecture for these groups. Using a notion of Artin monoid cosets, we construct a version of the Deligne complex for Artin m...

In this paper we introduce and study some geometric objects associated to Artin monoids. The Deligne complex for an Artin group is a cube complex that was introduced by the second author and Davis (1995) to study the K(\pi,1) conjecture for these groups. Using a notion of Artin monoid cosets introduced by the first author (2020), we construct a ver...

Parabolic subgroups are the building blocks of Artin groups. This paper extends previous results of Cumplido, Gebhardt, Gonzales-Meneses and Wiest, known only for parabolic subgroups of finite type Artin groups, to parabolic subgroups of FC-type Artin groups. We show that the class of finite type parabolic subgroups is closed under intersection. We...

Parabolic subgroups are the building blocks of Artin groups. This paper extends previous results, known only for parabolic subgroups of finite type Artin groups, to parabolic subgroups of FC type Artin groups. We show that the class of finite type parabolic subgroups is closed under intersection. We also study an analog of the curve complex for map...

We investigate algorithmic control of a large swarm of mobile particles (such as robots, sensors, or building material) that move in a 2D workspace using a global input signal (such as gravity or a magnetic field). We show that a maze of obstacles to the environment can be used to create complex systems. We provide a wide range of results for a wid...

While finite type Artin groups and right-angled Artin groups are well understood, little is known about more general Artin groups. In this paper we use the action of an infinite type Artin group A Γ A_{\Gamma } on a CAT(0) cube complex to prove that A Γ A_{\Gamma } has trivial center providing Γ \Gamma is not the star of a single vertex, and is acy...

While finite type Artin groups and right-angled Artin groups are well-understood, little is known about more general Artin groups. In this paper we use the action of an infinite type Artin group $A_\Gamma$ on a CAT(0) cube complex to prove that $A_\Gamma$ has trivial center providing the graph $\Gamma$ is not the star of a single vertex, and is acy...

We investigate algorithmic control of a large swarm of mobile particles (such as robots, sensors, or building material) that move in a 2D workspace using a global input signal (such as gravity or a magnetic field). We show that a maze of obstacles to the environment can be used to create complex systems. We provide a wide range of results for a wid...

We present fundamental progress on the computational universality of swarms of micro- or nano-scale robots in complex environments, controlled not by individual navigation, but by a uniform global, external force. Consider a 2D grid world, in which all obstacles and robots are unit squares, and for each actuation, robots move maximally until they c...

We present fundamental progress on the computational universality of swarms of micro- or nanoscale robots in complex environments, controlled not by individual navigation, but by a uniform global, external force. More specifically, we consider a 2D grid world, in which all obstacles and robots are unit squares, and for each actuation, robots move m...