相关论文: Computability properties of hyperbolic complex H\'…
The basic notions of quantum mechanics are formulated in terms of separable infinite dimensional Hilbert space $\mathcal{H}$. In terms of the Hilbert lattice $\mathcal{L}$ of closed linear subspaces of $\mathcal{H}$ the notions of state and…
We explore in the framework of Quantum Computation the notion of computability, which holds a central position in Mathematics and Theoretical Computer Science. A quantum algorithm that exploits the quantum adiabatic processes is considered…
We consider complex Henon maps which are quasi-hyperbolic. We show that a quasi-hyperbolic map is uniformly hyperbolic if and only if there are no tangencies between stable and unstable manifolds.
Elliptic curves have a well-known and explicit theory for the construction and application of endomorphisms, which can be applied to improve performance in scalar multiplication. Recent work has extended these techniques to hyperelliptic…
We introduce a notion of algorithmic randomness for algebraic fields. We prove the existence of a continuum of algebraic extensions of $\mathbb{Q}$ that are random according to our definition. We show that there are noncomputable algebraic…
We investigate conditions under which a co-computably enumerable set in a computable metric space is computable. Using higher-dimensional chains and spherical chains we prove that in each computable metric space which is locally computable…
Deep Learning is mostly responsible for the surge of interest in Artificial Intelligence in the last decade. So far, deep learning researchers have been particularly successful in the domain of image processing, where Convolutional Neural…
We investigate the computability of the isomorphism set $\operatorname{Iso}(G_A,G_B)$ between $G_A$ and $G_B$, where $G_A$ is a subgroup of $\mathbb{Q}^n$ generated by columns of integer powers of a non-singular $n \times n$-matrix $A$ with…
For Cantor circle Julia sets of hyperbolic rational maps, we prove that they are quasisymmetrically equivalent to standard Cantor circles (i.e., connected components are round circles). This gives a quasisymmetric uniformization of all…
It is well-known that the Julia set of a hyperbolic rational map is quasisymmetrically equivalent to the standard Cantor set. Using the uniformization theorem of David and Semmes, this result comes down to the fact that such a Julia set is…
We establish necessary and sufficient conditions for the realization of mapping schemata as post-critically finite polynomials, or more generally, as post-critically finite polynomial maps from a finite union of copies of the complex…
Consider polynomial maps $f:\C\to\C$ of degree $d\ge 2$, or more generally polynomial maps from a finite union of copies of $\C$ to itself. In the space of suitably normalized maps of this type, the hyperbolic maps form an open set called…
We describe a collection of computer scripts written in PARI/GP to compute, for reflection groups determined by finite-volume polyhedra in $\mathbb{H}^3$, the commensurability invariants known as the invariant trace field and invariant…
A semi-computable set S in a computable metric space need not be computable. However, in some cases, if S has certain topological properties, we can conclude that S is computable. It is known that if a semi-computable set S is a compact…
We describe an essential improvement of our recent algorithm for computing cohomology of Lie (super)algebra based on partition of the whole cochain complex into minimal subcomplexes. We replace the arithmetic of rational numbers or integers…
This paper is an introduction to the hyperbolic geometry of noncommutative polyballs B_n of bounded linear operators on Hilbert spaces. We use the theory of free pluriharmonic functions on polyballs and noncommutative Poisson kernels on…
We study quasiconformal deformations and mixing properties of hyperbolic sets in the family of holomorphic correspondences z^r +c, where r >1 is rational. Julia sets in this family are projections of Julia sets of holomorphic maps on C^2,…
When can a model of a physical system be regarded as computable? We provide the definition of a computable physical model to answer this question. The connection between our definition and Kreisel's notion of a mechanistic theory is…
We call a log variety (X, D) algebraically hyperbolic if there exists a positive number e such that 2g(C) - 2 + i(C, D) >= e deg(C) for all curves C on X, where i(C, D) is the number of the intersections between D and the normalization of…
Hyperbolicity is a graph parameter related to how much a graph resembles a tree with respect to distances. Its computation is challenging as the main approaches consist in scanning all quadruples of the graph or using fast matrix…