English
Related papers

Related papers: Tricomplex Distance Estimation for Filled-in Julia…

200 papers

We discuss a method to estimate the measure of a compact set which is approximated using the Hausdorff distance by a sequence of compact sets. We do this by considering corresponding fattenings of the sequence of compact sets and showing…

Spectral Theory · Mathematics 2025-12-01 Lior Tenenbaum

Through classical modularity conjectures, the period integrals of a holomorphic $3$-form on a rigid Calabi-Yau threefold are interesting from the perspective of number theory. Although the (approximate) values of these integrals would be…

Algebraic Geometry · Mathematics 2025-05-30 Azur Đonlagić

This paper presents a slight improvement of the estimate of sumsets of convex sets with negative discrete third derivative. The proposed method is based on some previous works in incidence geometry and use of spectrum method developed…

Combinatorics · Mathematics 2025-08-07 Jun Ikeda

A model for the Mandelbrot set is due to Thurston and is stated in the language of geodesic laminations. The conjecture that the Mandelbrot set is actually homeomorphic to this model is equivalent to the celebrated MLC conjecture stating…

Dynamical Systems · Mathematics 2015-03-03 Alexander Blokh , Lex Oversteegen , Ross Ptacek , Vladlen Timorin

Albeit the recent progress in single image 3D human pose estimation due to the convolutional neural network, it is still challenging to handle real scenarios such as highly occluded scenes. In this paper, we propose to address the problem…

Computer Vision and Pattern Recognition · Computer Science 2018-07-31 Xiang Guo , Yuchao Dai

We discuss computability of impressions of prime ends of compact sets. In particular, we construct quadratic Julia sets which possess explicitly described non-computable impressions.

Dynamical Systems · Mathematics 2015-06-18 Ilia Binder , Cristobal Rojas , Michael Yampolsky

Computing the Fr\'{e}chet distance for surfaces is a surprisingly hard problem and the only known algorithm is limited to computing it between flat surfaces. We adapt this algorithm to create one for computing the Fr\'{e}chet distance for a…

Computational Geometry · Computer Science 2011-03-16 Atlas F. Cook , Anne Driemel , Sariel Har-Peled , Jessica Sherette , Carola Wenk

In this paper we introduce the notion of dynamical systems over the class of the normed real nonassociative algebras not necessarily finite-dimensional, generalize the classical filled Julia and Mandelbrot sets over the complex numbers,…

Dynamical Systems · Mathematics 2020-09-22 João Carlos da Motta Ferreira , Maria das Graças Bruno Marietto

By a symmetry of the Julia set of a polynomial, also referred as polynomial Julia set, we mean an Euclidean isometry preserving the Julia set. Each such symmetry is in fact a rotation about the centroid of the polynomial. In this article, a…

Dynamical Systems · Mathematics 2024-02-13 Tarakanta Nayak , Soumen Pal

Fractals offer the ability to generate fascinating geometric shapes with all sorts of unique characteristics (for instance, fractal geometry provides a basis for modelling infinite detail found in nature). While fractals are non-euclidean…

Computational Geometry · Computer Science 2023-03-28 Ben Kenwright

Using parabolic enrichment, it is shown that Gronwall area formula for the filled Julia set along the boundary of the main cardioid of the Mandelbrot set cannot be well approximated by replacing it by a finite sum. A revised version of this…

Dynamical Systems · Mathematics 2017-05-17 Alexandre Dezotti

Methods were developed in Ref. [1] for constructing reference metrics (and from them differentiable structures) on three-dimensional manifolds with topologies specified by suitable triangulations. This note generalizes those methods by…

General Relativity and Quantum Cosmology · Physics 2024-01-03 Lee Lindblom , Oliver Rinne

In this paper we mainly investigate the radial distribution of Julia set of derivatives of entire solutions of some complex linear differential equations. Under certain conditions, we find the lower bound of it which improve some recent…

Complex Variables · Mathematics 2017-05-24 Guowei Zhang , Jie Ding , Lianzhong Yang

A dual approach to defining the triangle sequence (a type of multidimensional continued fraction algorithm, initially developed in NT/9906016) for a pair of real numbers is presented, providing a new, clean geometric interpretation of the…

Number Theory · Mathematics 2007-05-23 S. Assaf , L. Chen , T. Cheslack-Postava , B. Cooper , A. Diesl , T. Garrity , M. Lepinski , A. Schuyler

In this paper we settle most of the open questions on algorithmic computability of Julia sets. In particular, we present an algorithm for constructing quadratics whose Julia sets are uncomputable. We also show that a filled Julia set of a…

Dynamical Systems · Mathematics 2007-09-30 Mark Braverman , Michael Yampolsky

We show that there exist real parameters $c$ for which the Julia set $J_c$ of the quadratic map $z^2+c$ has arbitrarily high computational complexity. More precisely, we show that for any given complexity threshold $T(n)$, there exist a…

Dynamical Systems · Mathematics 2020-03-23 Cristobal Rojas , Michael Yampolsky

For each closed oriented 3-manifold $M$ in Thurston's picture, the set of degrees of self-maps on $M$ is given.

Geometric Topology · Mathematics 2017-06-30 Hongbin Sun , Shicheng Wang , Jianchun Wu , Hao Zheng

An explicit upper bound is derived for the modulus of divided difference for a smooth(not necessarily analytic) function defined on a smooth Jordan arc (or a smooth Jordan curve) in the complex plane. As an immediate application, an error…

Numerical Analysis · Mathematics 2016-04-06 Difeng Cai

The one-dimensional pseudo Leja sequences introduced in \cite{bialas2012pseudo}, as an alternative to Leja sequences, provides us with good interpolation nodes for the approximation of holomorphic functions. We propose a definition of…

Complex Variables · Mathematics 2023-12-06 Dimitri Jordan Kenne

We show that the number of unit distances determined by n points in R^3 is O(n^{3/2}), slightly improving the bound of Clarkson et al. established in 1990. The new proof uses the recently introduced polynomial partitioning technique of Guth…

Combinatorics · Mathematics 2011-07-07 Haim Kaplan , Jiri Matousek , Zuzana Safernova , Micha Sharir