Rose Morris-Wright
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Rose Morris-Wright has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Aaron T. Becker
University of Houston
2 shared publications - Erik D. Demaine
Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, MA, USA
2 shared publications - Sandor P. Fekete
Department of Computer Science, TU Braunschweig, Braunschweig, Germany
2 shared publications Jarrett Lonsford
University of Houston
1 shared publication- Jarrett Lonsforda
Department of Electrical and Computer Engineering University of Houston TX USA
1 shared publication - Ruth Charney
Brandeis University
1 shared publication
Latest Publications
- 14 June 2019
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 147 (9) , 3675-3689
Artin groups of infinite type: Trivial centers and acylindrical hyperbolicity
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 acylindrically hyperbolic providing Γ \Gamma is not a join.
- 14 June 2019
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 147 (9) , 3675-3689
Artin groups of infinite type: Trivial centers and acylindrical hyperbolicity
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 acylindrically hyperbolic providing Γ \Gamma is not a join.
- 8 December 2017
- Published by Springer Nature in Natural Computing
- Vol. 18 (1) , 181-201
Particle computation: complexity, algorithms, and logic
- 8 December 2017
- Published by Springer Nature in Natural Computing
- Vol. 18 (1) , 181-201
Particle computation: complexity, algorithms, and logic
- Open Access
Particle Computation: Complexity, Algorithms, and Logic
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 wide range of questions. These can be subdivided into external algorithmic problems, in which particle configurations serve as input for computations that are performed elsewhere, and internal logic problems, in which the particle configurations themselves are used for carrying out computations. For external algorithms, we give both negative and positive results. If we are given a set of stationary obstacles, we prove that it is NP-hard to decide whether a given initial configuration of unit-sized particles can be transformed into a desired target configuration. Moreover, we show that finding a control sequence of minimum length is PSPACE-complete. We also work on the inverse problem, providing constructive algorithms to design workspaces that efficiently implement arbitrary permutations between different configurations. For internal logic, we investigate how arbitrary computations can be implemented. We demonstrate how to encode dual-rail logic to build a universal logic gate that concurrently evaluates and, nand, nor, and or operations. Using many of these gates and appropriate interconnects, we can evaluate any logical expression. However, we establish that simulating the full range of complex interactions present in arbitrary digital circuits encounters a fundamental difficulty: a fan-out gate cannot be generated. We resolve this missing component with the help of 2x1 particles, which can create fan-out gates that produce multiple copies of the inputs. Using these gates we provide rules for replicating arbitrary digital circuits.
Open AccessParticle Computation: Complexity, Algorithms, and Logic
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 wide range of questions. These can be subdivided into external algorithmic problems, in which particle configurations serve as input for computations that are performed elsewhere, and internal logic problems, in which the particle configurations themselves are used for carrying out computations. For external algorithms, we give both negative and positive results. If we are given a set of stationary obstacles, we prove that it is NP-hard to decide whether a given initial configuration of unit-sized particles can be transformed into a desired target configuration. Moreover, we show that finding a control sequence of minimum length is PSPACE-complete. We also work on the inverse problem, providing constructive algorithms to design workspaces that efficiently implement arbitrary permutations between different configurations. For internal logic, we investigate how arbitrary computations can be implemented. We demonstrate how to encode dual-rail logic to build a universal logic gate that concurrently evaluates and, nand, nor, and or operations. Using many of these gates and appropriate interconnects, we can evaluate any logical expression. However, we establish that simulating the full range of complex interactions present in arbitrary digital circuits encounters a fundamental difficulty: a fan-out gate cannot be generated. We resolve this missing component with the help of 2x1 particles, which can create fan-out gates that produce multiple copies of the inputs. Using these gates we provide rules for replicating arbitrary digital circuits.