相关论文: Tricomplex Distance Estimation for Filled-in Julia…

Using computer graphics and visualization algorithms, we extend in this work the results obtained analytically in [1], on the connectivity domains of alternated Julia sets, defined by switching the dynamics of two quadratic Julia sets. As…

We prove that a nonempty, proper subset $S$ of the complex plane can be approximated in a strong sense by polynomial filled Julia sets if and only if $S$ is bounded and $\hat{\mathbb{C}} \setminus \textrm{int}(S)$ is connected. The proof…

In this work we consider a class of endomorphisms of $\mathbb{R}^2$ defined by $f(x,y)=(xy+c,x)$, where $c\in\mathbb{R}$ is a real number and we prove that when $-1<c<0$, the forward filled Julia set of $f$ is the union of stable manifolds…

In this paper it is shown analytically and computationally that the Mandelbrot set of integer order are particular cases of Julia sets of Caputo s like fractional order. Also the differences between the fractional-order Mandelbrot set and…

In this paper, the numbers of rational curves on general complete intersection Calabi-Yau threefolds in complex projective spaces are computed up to degree six. The results are all in agreement with the predictions made from mirror…

Several methods of triclustering of three dimensional data require the specification of the cluster size in each dimension. This introduces a certain degree of arbitrariness. To address this issue, we propose a new method, namely the…

An ordinal-valued metric taking its values in the set of all countable ordinals can be assigned to a metrizable set of nodes in a transfinite graph. Then, a variety of results concerning nodal eccentricities, radii, diameters, centers,…

We study the problem of finding, in a real algebraic matrix group, the matrix closest to a given data matrix. We do so from the algebro-geometric perspective of Euclidean distance degrees. We recover several classical results; and among the…

We define "fat" train tracks and use them to give a combinatorial criterion for the Hempel distance of Heegaard splittings for closed orientable 3-manifolds. We apply this criterion to 3-manifolds obtained from surgery on knots in the three…

We prove that for every polynomial of one complex variable of degree at least 2 and Julia set not being totally disconnected nor a circle, nor interval, Hausdorff dimension of this Julia set is larger than 1. Till now this was known only in…

Let T be a weighted tree with n leaves. Let D_{i,j} be the distance between the leaves i and j. Let D_{i,j,k}= (D_{i,j} + D_{j,k} +D_{i,k})/2. We will call such numbers "triple weights" of the tree. In this paper, we give a…

In this paper, we study metric completions of triangulated categories in a representation-theoretic context. We provide a concrete description of completions of bounded derived categories of hereditary finite dimensional algebras of finite…

For a unital $C^*$-algebra $\mathcal A$ and a subspace $\mathcal B$ of $\mathcal A$, a characterization for a best approximation to an element of $\mathcal A$ in $\mathcal B$ is obtained. As an application, a formula for the distance of an…

In this paper, we discuss an efficient algorithm for computing the growth distance between two compact convex sets with representable support functions. The growth distance between two sets is the minimum scaling factor such that the sets…

We discuss computability and computational complexity of conformal mappings and their boundary extensions. As applications, we review the state of the art regarding computability and complexity of Julia sets, their invariant measures and…

Minimizing the Euclidean distance to a set arises frequently in applications. When the set is algebraic, a measure of complexity of this optimization problem is its number of critical points. In this paper we provide a general framework to…

In our previous paper, Real Polynomials with a Complex Twist [see http://archives.math.utk.edu/ICTCM/VOL28/A040/paper.pdf], we used advancements in computer graphics that allow us to easily illustrate more complete graphs of polynomial…

Estimates for the Carath\'eodory metric on the symmetrized polydisc are obtained. It is also shown that the Carath\'eodory and Kobayashi distances of the symmetrized three-disc do not coincide.

We study sets $V$ in the tridisc that are relatively polynomially convex and have the polynomial extension property. If $V$ is one-dimensional, and is either algebraic, or has polynomially convex projections, we show that it is a retract.…

We adapt Schaback's error doubling trick [R. Schaback. Improved error bounds for scattered data interpolation by radial basis functions. Math. Comp., 68(225):201--216, 1999.] to give error estimates for radial interpolation of functions…