相关论文: Computability properties of hyperbolic complex H\'…
Partial differential equations (PDEs) are central to computational electromagnetics (CEM) and photonic design, but classical solvers face high costs for large or complex structures. Quantum Hamiltonian simulation provides a framework to…
The TTE approach to Computable Analysis is the study of so-called representations (encodings for continuous objects such as reals, functions, and sets) with respect to the notions of computability they induce. A rich variety of such…
We give a sheaf theoretic interpretation of Potts models with external magnetic field, in terms of constructible sheaves and their Euler characteristics. We show that the polynomial countability question for the hypersurfaces defined by the…
By analogy with complex numbers, a system of hyperbolic numbers can be introduced in the same way: z=x+h*y with h*h=1 and x,y real numbers. As complex numbers are linked to the Euclidean geometry, so this system of numbers is linked to the…
We investigate what it means for a (Hausdorff, second-countable) topological group to be computable. We compare several potential definitions in the literature. We relate these notions with the well-established definitions of effective…
We introduce novel mathematical and computational tools to develop a complete algorithm for computing the set of non-properness of polynomials maps in the plane. In particular, this set, which we call \emph{the Jelonek set}, is a subset of…
The notion of graph covers (also referred to as locally bijective homomorphisms) plays an important role in topological graph theory and has found its computer science applications in models of local computation. For a fixed target graph…
This is the first of a series of papers in which we study deep computations (ultracomputations) and deep iterates, formalizing the ideas of "asymptotic limit" of computations and compositional iterates, respectively. In this first paper of…
This paper provides a methodology of verified computing for solutions to 1-dimensional advection equations with variable coefficients. The advection equation is typical partial differential equations (PDEs) of hyperbolic type. There are few…
We prove that a C2 Hamiltonian system H in M is globally hyperbolic if any of the following statements holds: H is robustly topologically stable; H is stably shadowable; H is stably expansive; and H has the stable weak specification…
Cylindrical algebraic decomposition (CAD) is an important tool for working with polynomial systems, particularly quantifier elimination. However, it has complexity doubly exponential in the number of variables. The base algorithm can be…
In the paper we define three new complexity classes for Turing Machine undecidable problems inspired by the famous Cook/Levin's NP-complete complexity class for intractable problems. These are U-complete (Universal complete), D-complete…
In this work, we study the computability of topological graphs, which are obtained by gluing arcs and rays together at their endpoints. We prove that every semicomputable graph in a computable metric space can be approximated, with…
The objective of this work is to examine the integrability of Hamiltonian systems in $2D$ spaces with variable curvature of certain types. Based on the differential Galois theory, we announce the necessary conditions of the integrability.…
We extend the Theory of Computation on real numbers, continuous real functions, and bounded closed Euclidean subsets, to compact metric spaces $(X,d)$: thereby generically including computational and optimization problems over higher types,…
We investigate the topological aspects of some algebraic computation models, in particular the BSS-model. Our results can be seen as bounds on how different BSS-computability and computability in the sense of computable analysis can be. The…
Let $\Lambda$ be a quasi-projective variety and assume that, either $\Lambda$ is a subvariety of the moduli space $\mathcal{M}_d$ of degree $d$ rational maps, or $\Lambda$ parametrizes an algebraic family $(f_\lambda)_{\lambda\in\Lambda}$…
We investigate the discontinuity of codings for the Julia set of a quadratic map. To each parameter ray, we associate a natural coding for Julia sets on the ray. Given a hyperbolic component $H$ of the Mandelbrot set, we consider the…
We study rational functions satisfying summability conditions - a family of weak conditions on the expansion along the critical orbits. Assuming their appropriate versions, we derive many nice properties: There exists a unique, ergodic, and…
Algorithmicists are well-aware that fast dynamic programming algorithms are very often the correct choice when computing on compositional (or even recursive) graphs. Here we initiate the study of how to generalize this folklore intuition to…