activity
20152026
most citedTwo-Step and Three-Step Nilpotent Lie Algebras Constructed from Schreier Graphs

4 citations · 5 across the 3 of their papers we have counts for

collaborators

5 papers

math.CO2026

Maximizing the discrepancy between zero forcing parameters relative to graph order

Andrew McKay, Allie Ray, Jonathan Valliere

Zero forcing is a process described by a color change rule on the vertices of a graph. In this paper, we maximize the discrepancy between various zero forcing parameters relative t…

math.SP2023

Applications of possibly hidden symmetry to Steklov and mixed Steklov problems on surfaces

Teresa Arias-Marco, Emily B. Dryden, Carolyn S. Gordon +3

We consider three different questions related to the Steklov and mixed Steklov problems on surfaces. These questions are connected by the techniques that we use to study them, whic…

math.DG2022★ 1 cited

Abelian Factor in 2-step Nilpotent Lie Algebras Constructed from Graphs

Rachelle DeCoste, Lisa DeMeyer, Meera Mainkar +1

We consider real 2-step metric nilpotent Lie algebras associated to graphs with possibly repeated edge labels as constructed by Ray in 2016. We determine how the structure of the e…

math.SP2016

Spectral geometry of the Steklov problem on orbifolds

Teresa Arias-Marco, Emily B. Dryden, Carolyn S. Gordon +3

We consider how the geometry and topology of a compact -dimensional Riemannian orbifold with boundary relates to its Steklov spectrum. In two dimensions, motivated by work of A.…

math.DG2015★ 4 cited

Two-Step and Three-Step Nilpotent Lie Algebras Constructed from Schreier Graphs

Allie Ray

We associate a two-step nilpotent Lie algebra to an arbitrary Schreier graph. We then use properties of the Schreier graph to determine necessary and sufficient conditions for this…