Related papers: Computer Generated Images for Quadratic Rational M…

In the recent years we have witnessed a rapid development of new algorithmic techniques for parameterized algorithms for graph separation problems. We present experimental evaluation of two cornerstone theoretical results in this area:…

We prove: If $f(z)$ is a critically finite rational map which has exactly two critical points and which is not conjugate to a polynomial, then the boundary of every Fatou component of $f$ is a Jordan curve. If $f(z)$ is a hyperbolic…

In many cases, analytic solutions of partial differential equations may not be possible. For practical problems, it is more reasonable to carry out computational solutions. However, the standard grid in the finite difference approximation…

A graph $G$ is $k$-vertex-critical if $G$ has chromatic number $k$ but every proper induced subgraph of $G$ has chromatic number less than $k$. The study of $k$-vertex-critical graphs for graph classes is an important topic in algorithmic…

In this work, we focus on an autocatalytic reaction-diffusion model and carry out multiple scale weakly nonlinear analysis. A cubic and a quadratic autocatalytic reaction system is analysed. We develop a framework to identify the critical…

For rational numbers $c$, we present a trichotomy of the set of totally real (totally $p$-adic, respectively) preperiodic points for maps in the quadratic unicritical family $f_c(x)=x^2+c$. As a consequence, we classify quadratic…

We consider random hyperbolic graphs in hyperbolic spaces of any dimension $d+1\geq 2$. We present a rescaling of model parameters that casts the random hyperbolic graph model of any dimension to a unified mathematical framework, leaving…

One of the conspicuous features of real slices of bicritical rational maps is the existence of Tricorn-type hyperbolic components. Such a hyperbolic component is called invisible if the non-bifurcating sub-arcs on its boundary do not…

We present a fixed point architecture (source VHDL code is provided) for powering computation. The fully customized architecture, based on the expanded hyperbolic CORDIC algorithm, allows for design space exploration to establish trade-offs…

Tilings of the hyperbolic plane are of significant interest among many branches of mathematics, physics and computer science. Yet, their construction remains a non-trivial task. Current approaches primarily use tree-based recursive…

We consider the class of quasiprojective varieties admitting a dominant morphism onto a curve with negative Euler characteristic. The existence of such a morphism is a property of the fundamental group. We show that for a variety in this…

We introduce the notion of radical parametrization of a surface, and we provide algorithms to compute such type of parametrizations for families of surfaces, like: Fermat surfaces, surfaces with a high multiplicity (at least the degree…

We introduce a simple algorithm which transforms every four-dimensional cubulation into a cusped finite-volume hyperbolic four-manifold. Combinatorially distinct cubulations give rise to topologically distinct manifolds. Using this…

We classify generic unfoldings of germs of antiholomorphic diffeomorphisms with a parabolic point of codimension 1 (i.e. a double fixed point) under conjugacy. These generic unfolding depend on one real parameter. The classification is done…

We study vector fields generating a local flow by automorphisms of a parabolic geometry with higher order fixed points. We develop general tools extending the techniques of [1], [2], and [3]. We apply these tools to almost Grassmannian,…

We define and compute hyperbolic coordinates and associated foliations which provide a new way to describe the geometry of the standard map. We also identify a uniformly hyperbolic region and a complementary 'critical' region containing a…

This paper presents an adaptation of recently developed algorithms for quadratic forms over number fields in arXiv:1304.0708 to global function fields of odd characteristics. First, we present algorithm for checking if a given…

In this paper we consider families of holomorphic maps defined on subsets of the complex plane, and show that the technique developed in \cite{LSvS1} to treat unfolding of critical relations can also be used to deal with cases where the…

This survey article describes the algorithmic approaches successfully used over the time to construct hyperbolic structures on 3-dimensional topological "objects" of various types, and to classify several classes of such objects using such…

Generative network models play an important role in algorithm development, scaling studies, network analysis, and realistic system benchmarks for graph data sets. A complex network model gaining considerable popularity builds random…