Related papers: Computer Generated Images for Quadratic Rational M…
A dominant rational self-map on a projective variety is called $p$-cohomologically hyperbolic if the $p$-th dynamical degree is strictly larger than other dynamical degrees. For such a map defined over $\overline{\mathbb{Q}}$, we study…
The moduli space of smooth real plane quartic curves consists of six connected components. We prove that each of these components admits a real hyperbolic structure. These connected components correspond to the six real forms of a certain…
We use our new type of bounded locally homeomorphic quasiregular mappings in the unit 3-ball to address long standing problems for such mappings. The construction of such mappings comes from our construction of non-trivial compact…
It is a classical result that there are $12$ (irreducible) rational cubic curves through $8$ generic points in $\mathbb{P}_{\mathbb{C}}^2$, but little is known about the non-generic cases. The space of $8$-point configurations is…
In a recent paper Jorge and Mercuri proved that the image of Gauss map of a complete non flat minimal surfaces in R3 with finite total curvature omits at most 2 points. In this work we follow their idea and prove 3a similar result for CMC-1…
Many artificial intelligence (AI) problems naturally map to NP-hard optimization problems. This has the interesting consequence that enabling human-level capability in machines often requires systems that can handle formally intractable…
We establish certain uniform a priori bounds for hyperbolic components of disjoint type. As an application, we will prove that Sierpinski carpet hyperbolic components of disjoint type are bounded. Furthermore, we show that for each map $f$…
Quantum error correction codes defined on hyperbolic lattices leverage the unique geometric properties of the hyperbolic space to enhance the performance of quantum error correction. By embedding qubits in hyperbolic lattices, these codes…
Let $C$ be a non-hyperelliptic algebraic curve. It is known that its canonical image is the intersection of the quadrics that contain it, except when $C$ is trigonal (that is, it has a linear system of degree 3 and dimension 1) or…
Quadratic points of a surface in the projective 3-space are the points which can be exceptionally well approximated by a quadric. They are also singularities of a 3-web in the elliptic part and of a line field in the hyperbolic part of the…
Nielsen, et al. [1, 2] proposed a view of quantum computation where determining optimal algorithms is equivalent to extremizing a geodesic length or cost functional. This view of optimization is highly suggestive of an action principle of…
We discuss how non-commutative fundamental groups could eventually contribute to algorithms for finding rational points on hyperbolic curves.
Chemical graph theory is commonly used to analyse and comprehend chemical structures and networks, as well as their features. The resolvability parameters for graph $G$= $(V,E)$ are a relatively new advanced field in which the complete…
We provide a simple, combinatorial criteria for a hierarchically hyperbolic space to be relatively hyperbolic by proving a new formulation of relative hyperbolicity in terms of hierarchy structures. In the case of clean hierarchically…
Let X be a non-singular projective hypersurface of degree 4, which is defined over the rational numbers. Assume that X has dimension 39 or more, and that X contains a real point and p-adic points for every prime p. Then X is shown to…
A study of real quadratic maps with real critical points, emphasizing the effective construction of critically finite maps with specified combinatorics. We discuss the behavior of the Thurston algorithm in obstructed cases, and in one…
We study arc graphs and curve graphs for surfaces of infinite topological type. First, we define an arc graph relative to a finite number of (isolated) punctures and prove that it is a connected, uniformly hyperbolic graph of infinite…
We establish some statistical properties of the hyperbolic times for a class of nonuniformly expanding dynamical systems. The maps arise as factors of area preserving maps of the unit square via a geometric Baker's map type construction,…
Hyperbolic programming is the problem of computing the infimum of a linear function when restricted to the hyperbolicity cone of a hyperbolic polynomial, a generalization of semidefinite programming. We propose an approach based on symbolic…
Given a rational projective parametrization $\cP(\ttt,\sss,\vvv)$ of a rational projective surface $\cS$ we present an algorithm such that, with the exception of a finite set (maybe empty) $\cB$ of projective base points of $\cP$,…