Related papers: Computer Generated Images for Quadratic Rational M…
We study complex one-dimensional parameter slices in a three-parameter family of rational maps with two free critical points, obtained by imposing the existence of periodic orbits with prescribed multipliers. Using explicit…
We study the parameter space ${\mathcal S}_p$ for cubic polynomial maps with a marked critical point of period $p$. We will outline a fairly complete theory as to how the dynamics of the map $F$ changes as we move around the parameter space…
For a quadratic endomorphism of the affine line defined over the rationals we consider the problem of bounding the number of rational points that eventually land at a given constant after iteration, called pre-images of the constant. In the…
We study critical orbits and bifurcations within the moduli space of quadratic rational maps on $\mathbb{P}^1$. We focus on the family of curves, $Per_1(\lambda)$ for $\lambda$ in $\mathbb{C}$, defined by the condition that each $f\in…
A new robust algorithm for the numerical computation of biarcs, i.e. $G^1$ curves composed of two arcs of circle, is presented. Many algorithms exist but are based on geometric constructions, which must consider many geometrical…
We classify weakly complete constant Gaussian curvature $-1<K<0$ surfaces in the hyperbolic three-space in terms of holomorphic quadratic differentials. For this purpose, we first establish a loop group method for constant Gaussian…
In this paper we propose an elementary topological approach which unifies and extends various different results concerning fixed points and periodic points for maps defined on sets homeomorphic to rectangles embedded in euclidean spaces. We…
In the Selective Coloring problem, we are given an integer $k$, a graph $G$, and a partition of $V(G)$ into $p$ parts, and the goal is to decide whether or not we can pick exactly one vertex of each part and obtain a $k$-colorable induced…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
We study the problem of counting $k$-hypergraphlets, an interesting but surprisingly ignored primitive, with the aim of understanding whether efficient algorithms exist. To this end, we consider color coding, a well-known technique for…
We give a sufficient condition under which the fundamental group of a reglued graph of surfaces is hyperbolic. A reglued graph of surfaces is constructed by cutting a fixed graph of surfaces along the edge surfaces, then regluing by…
In this paper the complex dynamical analysis of the parametric fourth-order Kim's iterative family is made on quadratic polynomials, showing the Matlab codes generated to draw the fractal images necessary to complete the study. The…
We introduce the separating semigroup of a real algebraic curve of dividing type. The elements of this semigroup record the possible degrees of the covering maps obtained by restricting separating morphisms to the real part of the curve. We…
We consider the problem of representing the fraction $5/P$ as a sum of three distinct unit fractions $1/A+1/B+1/C$ with $A<B<C$ and $A,B,C\in\mathbb{N}$. The case of primes $P\equiv 1 \pmod{5}$ is analyzed, where two constructive types of…
Given two graphs $H_1$ and $H_2$, a graph is $(H_1,H_2)$-free if it contains no induced subgraph isomorphic to $H_1$ nor $H_2$. A graph $G$ is $k$-vertex-critical if every proper induced subgraph of $G$ has chromatic number less than $k$,…
A topological mating is a map defined by gluing together the filled Julia sets of two quadratic polynomials. The identifications are visualized and understood by pinching ray-equivalence classes of the formal mating. For postcritically…
Recent advances in representation learning have shown that hyperbolic geometry can offer a more expressive alternative to the Euclidean embeddings used in CLIP models, capturing hierarchical structures and leading to better-organized…
Virtual representations of physical critical infrastructures, such as water or energy plants, are used for simulations and digital twins to ensure resilience and continuity of their services. These models usually require 3D point clouds…
The VC-dimension is a well-studied and fundamental complexity measure of a set system (or hypergraph) that is central to many areas of machine learning. We establish several new results on the complexity of computing the VC-dimension. In…
We study coarse separation in one-ended hyperbolic groups from a quantitative point of view, focusing on the volume growth of separating subsets. We prove that a one-ended hyperbolic group that is not virtually a surface group is coarsely…