9 citations · 20 across the 11 of their papers we have counts for
14 papers
Computability of topological pressure on compact shift spaces beyond finite type
Michael Burr, Suddhasattwa Das, Christian Wolf +1
We investigate the computability (in the sense of computable analysis) of the topological pressure on compact shift spaces for continuous potentials $ϕ:X\to {\…
Numerical homotopies from Khovanskii bases
Michael Burr, Frank Sottile, Elise Walker
We present numerical homotopy continuation algorithms for solving systems of equations on a variety in the presence of a finite Khovanskii basis. These take advantage of Anderson's…
Computability at zero temperature
Michael Burr, Christian Wolf
In this paper, we investigate the computability of thermodynamic invariants at zero temperature for one-dimensional subshifts of finite type. In particular, we prove that the resid…
Optimal Bounds for Johnson-Lindenstrauss Transformations
Michael Burr, Shuhong Gao, Fiona Knoll
In 1984, Johnson and Lindenstrauss proved that any finite set of data in a high-dimensional space can be projected to a lower-dimensional space while preserving the pairwise Euclid…
The Complexity of Subdivision for Diameter-Distance Tests
Michael Burr, Shuhong Gao, Elias Tsigaridas
We present a general framework for analyzing the complexity of subdivision-based algorithms whose tests are based on the sizes of regions and their distance to certain sets (often…
Serre's Properties for Quadratic Generated Domains from Graphs
Drew J. Lipman, Michael A. Burr
For any graph, one can construct a ring, called the edge ring, which is a quadratic-monomial generated subring of the Laurent polynomial ring . In…