Related papers: Computer Generated Images for Quadratic Rational M…
It is well known that an irreducible algebraic curve is rational (i.e. parametric) if and only if its genus is zero. In this paper, given a tolerance $\epsilon>0$ and an $\epsilon$-irreducible algebraic affine plane curve $\mathcal C$ of…
Among all the dynamical modular curves associated to quadratic polynomial maps, we determine which curves have infinitely many quadratic points. This yields a classification statement on preperiodic points for quadratic polynomials over…
We develop a Thurston-like theory to characterize geometrically finite rational maps, then apply it to study pinching and plumbing deformations of rational maps. We show that in certain conditions the pinching path converges uniformly and…
Geometric problem solving has always been a long-standing challenge in the fields of mathematical reasoning and artificial intelligence. We built a neural-symbolic system, called FGeo-HyperGNet, to automatically perform human-like geometric…
We give the first example of a quadratic map having a phase transition after the first zero of the geometric pressure function. This implies that several dimension spectra and large deviation rate functions associated to this map are not…
Computer algebra algorithms are developed for evaluating the coefficients in Airy-type asymptotic expansions that are obtained from integrals with a large parameter. The coefficients are defined from recursive schemes obtained from…
We present an algorithm to construct the JSJ decomposition of one-ended hyperbolic groups which are fundamental groups of graphs of free groups with cyclic edge groups. Our algorithm runs in double exponential time, and is the first…
Let V $\subset$ C n be an equidimensional algebraic set and g be an n-variate polynomial with rational coefficients. Computing the critical points of the map that evaluates g at the points of V is a cornerstone of several algorithms in real…
We give a new, stronger proof that there are only finitely many $k$-vertex-critical ($P_5$,~gem)-free graphs for all $k$. Our proof further refines the structure of these graphs and allows for the implementation of a simple exhaustive…
We produce a decomposition of the parameter space of the $A$-hypergeometric system associated to a projective monomial curve as a union of an arrangement of lines and its complement, in such a way that the analytic behavior of the solutions…
Complex networks have become increasingly popular for modeling various real-world phenomena. Realistic generative network models are important in this context as they avoid privacy concerns of real data and simplify complex network research…
Many problems in computational geometry are not stated in graph-theoretic terms, but can be solved efficiently by constructing an auxiliary graph and performing a graph-theoretic algorithm on it. Often, the efficiency of the algorithm…
We analyse the performance of simple distributed colouring algorithms under the assumption that the input graph is a hyperbolic random graph (HRG), a generative model capturing key properties of real-world networks such as power-law degree…
Real-world networks, like social networks or the internet infrastructure, have structural properties such as large clustering coefficients that can best be described in terms of an underlying geometry. This is why the focus of the…
The classifying space of inertial reference frames in special relativity is naturally hyperbolic. There is a remarkable interplay between central elements of hyperbolic geometry and those of special relativity -- which, to a certain extent,…
A multi-cube method is developed for solving systems of elliptic and hyperbolic partial differential equations numerically on manifolds with arbitrary spatial topologies. It is shown that any three-dimensional manifold can be represented as…
We consider the problem of learning the canonical parameters specifying an undirected graphical model (Markov random field) from the mean parameters. For graphical models representing a minimal exponential family, the canonical parameters…
We prove that there is no algorithm that can determine whether or not a finitely presented group has a non-trivial finite quotient; indeed, this remains undecidable among the fundamental groups of compact, non-positively curved square…
Given any rational map $f$, there is a lamination by Riemann surfaces associated to $f$. Such laminations were constructed in general by Lyubich and Minsky. In this paper, we classify laminations associated to quadratic polynomials with…
We give explicit computational algorithms to construct minimal degree (always $\le 4$) ramified covers of $\Prj^1$ for algebraic curves of genus 5 and 6. This completes the work of Schicho and Sevilla (who dealt with the $g \le 4$ case) on…