相关论文: Tricomplex Distance Estimation for Filled-in Julia…
In this paper we explore by means of the method of Lagrangian descriptors the Julia sets arising from complex maps, and we analyze their underlying dynamics. In particular, we take a look at two classical examples: the quadratic mapping…
After defining convex near-polygons, a formula enumerating the number of triangulations of such configurations is derived in terms of edge-polynomials. The paper describes also a transfer-matrix approach for computing quantities related to…
A system of commutative hypercomplex numbers of the form w=x+hy+kz are introduced in 3 dimensions, the variables x, y and z being real numbers. The multiplication rules for the complex units h, k are h^2=k, k^2=h, hk=1. The operations of…
In this paper we give a unified proof of the fact that the Julia set of Newton's method applied to a holomorphic function of the complex plane (a polynomial of degree large than $1$ or an entire transcendental function) is connected. The…
Interferometers play an increasingly important role for spatially resolved observations. If employed at full potential, interferometry can probe an enormous dynamic range in spatial scale. Interpretation of the observed visibilities…
For maps of one complex variable, $f$, given as the sum of a degree $n$ power map and a degree $d$ polynomial, we provide necessary and sufficient conditions that the geometric limit as $n$ approaches infinity of the set of points that…
We describe a rigorous computer algorithm for attempting to construct an explicit, discretized metric for which a complex polynomial map is expansive on a given neighborhood of its Julia set. We show construction of such a metric proves the…
A. Sannami constructed an example of the differentiable Cantor set embedded in the real line whose difference set has a positive measure. In this paper, we generalize the definition of the difference sets for sets of the two dimensional…
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 obtain new upper and lower bounds on the number of unit perimeter triangles spanned by points in the plane. We also establish improved bounds in the special case where the point set is a section of the integer grid.
Any finite union of disjoint, mutually exterior Jordan curves in the complex plane can be approximated arbitrarily well in the Hausdorff topology by polynomial Julia sets. Furthermore, the proof is constructive.
We give formulas for calculating the interleaving distance between rectangle persistence modules that depend solely on the geometry of the underlying rectangles. Moreover, we extend our results to calculate the bottleneck distance for…
Multiview varieties are mathematical models for the set of image feature correspondences that can be produced by a given camera arrangement. They possess an invariant known as their Euclidean distance (ED) degree, which measures the…
In this paper, we use Breadth-first search algorithm to determine the distance matrix of multiplicative circulant graph of order power of two and three. As a consequence, the diameter of the graphs were determined. We also give their…
In this paper, we describe geometrical constructions to obtain triangulations of connected sums of closed orientable triangulated 3-manifolds. Using these constructions, we show that it takes time polynomial in the number of tetrahedra to…
Let $P, Q$ be Heegaard surfaces of a closed orientable 3-manifold. In this paper, we introduce a method for giving an upper bound of Hempel distance of $P$ by using the Reeb graph derived from a certain horizontal arc in the ambient space…
Finding the point in an algebraic variety that is closest to a given point is an optimization problem with many applications. We study the case when the variety is a Fermat hypersurface. Our formula for its Euclidean distance degree is a…
This paper presents a distance function between sets based on an average of distances between their elements. The distance function is a metric if the sets are non-empty finite subsets of a metric space. It can be applied to produce various…
In this paper, we study the large scaled geometric structure of Julia sets of entire and meromorphic functions. Roughly speaking, the structure gives us some asymptotic information about the Julia set near the essential singularity. We will…
For any integers $d\ge 3$ and $n\ge 1$, we construct a hyperbolic rational map of degree $d$ such that it has $n$ cycles of the connected components of its Julia set except single points and Jordan curves.