5 papers
Persistence of periodic billiard orbits under domain deformation
Samuel Everett
We prove that if a polygon admits a periodic billiard orbit satisfying a certain combinatorial criterion, then there are paths of polygons in parameter space for which every polygo…
Random tensor isomorphism under orthogonal and unitary actions
Jeremy Chizewer, Samuel Everett, Deven Mithal +1
We study the problem of testing whether two tensors in are isomorphic under the natural action of orthogonal groups $\text…
Correspondences in computational and dynamical complexity II: forcing complex reductions
Samuel Everett
An algebraic telic problem is a decision problem in formalizing finite-time reachability questions for one-dimensional dynamical systems. We prove that the…
Correspondences in computational and dynamical complexity I
Samuel Everett
We begin development of a method for studying dynamical systems using concepts from computational complexity theory. We associate families of decision problems, called telic proble…
Deciding subspace reachability problems with application to Skolem's Problem
Samuel Everett
The higher-dimensional version of Kannan and Lipton's Orbit Problem asks whether it is decidable if a target subspace can be reached from a starting point under repeated applicatio…