On Decidability of Hyperbolicity
نویسندگان
چکیده
We prove that a wide range of coloring problems for graphs on surfaces can be resolved by inspecting finite number configurations.
منابع مشابه
Semi-hyperbolicity and Hyperbolicity
We prove that for C1-diffeomorfisms semi-hyperbolicity of an invariant set implies its hyperbolicity. Moreover, we provide some exact estimations of hyperbolicity constants by semi-hyperbolicity ones, which can be useful in strict numerical computations.
متن کاملNotes on Hyperbolicity Cones
minimize cx such that Ax = b and x ∈ Λ+, where c ∈ R, Ax = b is a system of linear equations and Λ+ is the closure of a so called hyperbolicity cone. Hyperbolic programming generalizes semidefinite programming, but it is not known to what extent since it is not known how general the hyperbolicity cones are. The rich algebraic structure of hyperbolicity cones makes hyperbolic programming an inte...
متن کاملPointwise Hyperbolicity Implies Uniform Hyperbolicity
We provide a general mechanism for obtaining uniform information from pointwise data. A sample result is that if a diffeomorphism of a compact Riemannian manifold has pointwise expanding and contracting continuous invariant cone families, then the diffeomorphism is an Anosov diffeomorphism, i.e., the entire manifold is uniformly hyperbolic.
متن کاملOn the Decidability of Process
We present general results for showing process equivalences applied to the nite control fragment of the -calculus decidable. Firstly a Finite Reachability Theorem states that up to nite name spaces and up to a static normalisation procedure, the set of reachable agent expressions is nite. Secondly a Boundedness Lemma shows that no potential computations are missed when name spaces are chosen la...
متن کاملOn Decidability of Persistence Notions
Persistence is a widely investigated fundamental property of concurrent systems, which was extended in many ways. We propose a unified characterisation of several notions considered in the literature. The main result of the paper is a detailed description of a general and extendable framework that allows to state decision problems for different persistence notions (well known as well as newly f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2022
ISSN: ['0209-9683', '1439-6912']
DOI: https://doi.org/10.1007/s00493-022-4891-8