English
Related papers

Related papers: Computability properties of hyperbolic complex H\'…

200 papers

We consider the family of entire maps given by $f_{\ell,c}(z)=\ell+c-(\ell-1)\log c-e^z$, where $c\in D(\ell,1)$ and $\ell\in\mathbb N$, $\ell\geq2$. By using the property of $f_{\ell,c}$ to be dynamically projected to an infinite cylinder…

Dynamical Systems · Mathematics 2024-04-29 Adrián Esparza-Amador

We prove, for stably computably enumerable formal systems, direct analogues of the first and second incompleteness theorems of G\"odel. A typical stably computably enumerable set is the set of Diophantine equations with no integer…

Logic · Mathematics 2024-12-19 Yasha Savelyev

We prove that topologically conjugate non-renormalizable polynomials are quasi-conformally conjugate. From this we derive that each such polynomial can be approximated by a hyperbolic polynomial. As a by product we prove that the Julia set…

Dynamical Systems · Mathematics 2014-02-26 Oleg Kozlovski , Sebastian van Strien

We analyze a real one-parameter family of quasiconformal deformations of a hyperbolic rational map known as {\em spinning}. We show that under fairly general hypotheses, the limit of spinning either exists and is unique, or else converges…

Dynamical Systems · Mathematics 2016-09-07 Kevin M. Pilgrim , Tan Lei

Practical identifiability is a critical concern in data-driven modeling of mathematical systems. In this paper, we propose a novel framework for practical identifiability analysis to evaluate parameter identifiability in mathematical models…

Quantitative Methods · Quantitative Biology 2026-01-06 Shun Wang , Wenrui Hao

In this article, the decidability and computability issues of dynamic probability logic (DPL) are addressed. Firstly, a proof system $\mathcal{H}_{DPL}$ is introduced for DPL and shown that it is weakly complete. Furthermore, this logic has…

Logic in Computer Science · Computer Science 2024-06-25 Somayeh Chopoghloo , Mahdi Heidarpoor , Massoud Pourmahdian

The notion of the characteristic Lie algebra of the discrete hyperbolic type equation is introduced. An effective algorithm to compute the algebra for the equation given is suggested. Examples and further applications are discussed.

Exactly Solvable and Integrable Systems · Physics 2008-04-24 Ismagil Habibullin

Real-world visual data exhibit intrinsic hierarchical structures that can be represented effectively in hyperbolic spaces. Hyperbolic neural networks (HNNs) are a promising approach for learning feature representations in such spaces.…

Computer Vision and Pattern Recognition · Computer Science 2024-02-08 Ahmad Bdeir , Kristian Schwethelm , Niels Landwehr

Rational maps on the Riemann sphere occupy a distinguished niche in the general theory of smooth dynamical systems. First, rational maps are complex-analytic, so a broad spectrum of techniques can contribute to their study (quasiconformal…

Dynamical Systems · Mathematics 2016-09-06 Curtis T. McMullen

Some new Hamiltonian systems of quasi-Painlev\'e type are presented and the analogue of Okamoto's space of initial conditions computed. Using the geometric approach that was introduced originally for the identification problem of Painlev\'e…

Classical Analysis and ODEs · Mathematics 2025-12-10 Marta Dell'Atti , Thomas Kecker

To enable the study of open sets in computational approaches to mathematics, lots of extra data and structure on these sets is assumed. For both foundational and mathematical reasons, it is then a natural question, and the subject of this…

Logic · Mathematics 2020-10-02 Dag Normann , Sam Sanders

H-holomorphic maps are a parameter version of J-holomorphic maps into contact manifolds. They have arisen in efforts to prove the existence of higher--genus holomorphic open book decompositions and efforts to prove the existence of finite…

Symplectic Geometry · Mathematics 2009-07-23 Jens von Bergmann

Suppose $H$ is a finite dimensional reproducing kernel Hilbert space of functions on $X.$ If $H$ has the complete Pick property then there is an isometric map, $\Phi,$ from $X,$ with the metric induced by $H,$ into complex hyperbolic space,…

Functional Analysis · Mathematics 2018-03-08 Richard Rochberg

We prove that Collet-Eckmann rational maps have poly-time computable Julia sets. As a consequence, almost all real quadratic Julia sets are poly-time.

Dynamical Systems · Mathematics 2017-08-11 Artem Dudko , Michael Yampolsky

We present the results of computation of cohomology for some Lie (super)algebras of Hamiltonian vector fields and related algebras. At present, the full cohomology rings for these algebras are not known even for the low dimensional vector…

Numerical Analysis · Mathematics 2007-05-23 Vladimir V. Kornyak

This is a book about computational aspects of modular forms and the Galois representations attached to them. The main result is the following: Galois representations over finite fields attached to modular forms of level one can, in almost…

Number Theory · Mathematics 2010-03-23 Bas Edixhoven , Jean-Marc Couveignes , Robin de Jong , Franz Merkl , Johan Bosman

We investigate the connections between computability theory and Nonstandard Analysis. In particular, we investigate the two following topics and show that they are intimately related. (T.1) A basic property of Cantor space $2^{\mathbb{N}}$…

Logic · Mathematics 2020-02-19 Dag Normann , Sam Sanders

Holomorphic functions are amazing because their values in an ever so small disk in the complex plane completely determine the function values at arbitrary points in their maximum possible domain. The process of extending such a function…

Complex Variables · Mathematics 2015-05-15 Stefan Kranich

Let $X$ be an algebraic scheme over an algebraically closed field and $\ell$ a prime number invertible on $X$. According to classical results (due essentially to A. Grothendieck, M. Artin and P. Deligne), the \'etale cohomology groups…

Algebraic Geometry · Mathematics 2016-01-20 David A. Madore , Fabrice Orgogozo

We consider the question as to whether the exponent of a computably presentable Lebesgue space whose dimension is at least 2 must be computable. We show this very natural conjecture is true when the exponent is at least 2 or when the space…

Logic · Mathematics 2020-01-01 Timothy H. McNicholl
‹ Prev 1 8 9 10 Next ›