Related papers: Real quadratic Julia sets can have arbitrarily hig…

The polylogarithm function is one of the constellation of important mathematical functions. It has a long history, and many connections to other special functions and series, and many applications, for instance in statistical physics.…

We make an experimental comparison of methods for computing the numerical radius of an $n\times n$ complex matrix, based on two well-known characterizations, the first a nonconvex optimization problem in one real variable and the second a…

In this article, we combine complex-analytic and arithmetic tools to study the preperiodic points of one-dimensional complex dynamical systems. We show that for any fixed complex numbers a and b, and any integer d at least 2, the set of…

This paper begins with a class of convex quadratic programs (QPs) with bounded variables solvable by the parametric principal pivoting algorithm with $\mathcal{O}(n^3)$ strongly polynomial complexity, where $n$ is the number of variables of…

We seek to determine a real algebraic variety from a fixed finite subset of points. Existing methods are studied and new methods are developed. Our focus lies on aspects of topology and algebraic geometry, such as dimension and defining…

We prove a non-abelian arboreal Galois group result for certain maps with non-real Julia set at an archimedean place. We investigate the question of determining which polynomials defined over $\mathbb{R}$ have real Julia set. Finally we…

TopologicalNumbers.jl is an open-source Julia package designed to calculate topological invariants, mathematical quantities that characterize the properties of materials in condensed matter physics. These invariants, such as the Chern…

Special exotic class of dynamical systems~ -- the implicit maps~ -- is considered. Such maps, particularly, can appear as a result of using of implicit and semi-implicit iterative numerical methods. In the present work we propose the…

We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…

In this work we study the backward filled Julia sets of a class of $p$-adic polynomial maps $f:\mathbb{Q}_p^2\longrightarrow \mathbb{Q}_p^2$ defined by $f(x,y)=(xy+c,x)$, where $c\in\mathbb{Q}_p$ is a $p$-adic number. In particular, if…

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.

We study connections between classical asymptotic density and c.e. sets. We prove that a c.e. Turing degree d is not low if and only if d contains a c.e. set A of density 1 which has no computable subsets of density 1, giving a natural…

We consider complex projective schemes $X\subset\Bbb{P}^{r}$ defined by quadratic equations and satisfying a technical hypothesis on the fibres of the rational map associated to the linear system of quadrics defining $X$. Our assumption is…

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 obtain a sufficient condition for the convexity of quaternionic numerical range for complex matrices in terms of its complex numerical range. It is also shown that the Bild coincides with complex numerical range for real matrices. From…

Hyperbolic Julia sets of complex polynomials are known to be computable in polynomial time due to pioneering work of Braverman in 2005 (10.1016/j.entcs.2004.06.031). In this paper, we present an alternative method for establishing poly-time…

We give examples of infinitely renormalizable quadratic polynomials $F_c: z\maps to z^2+c$ with stationary combinatorics whose Julia sets have Hausdorff dimension arbitrar y close to 1. The combinatorics of the renormalization involved is…

We prove that several dynamically defined fractals in $\mathbb{C}$ and $\mathbb{C}^2$ which arise from different type of polynomial dynamical systems can not be the same objects. One of our main results is that the closure of Misiurewicz…

Iterative methods with certified convergence for the computation of Gauss--Jacobi quadratures are described. The methods do not require a priori estimations of the nodes to guarantee its fourth-order convergence. They are shown to be…

JuMP is an open-source modeling language that allows users to express a wide range of optimization problems (linear, mixed-integer, quadratic, conic-quadratic, semidefinite, and nonlinear) in a high-level, algebraic syntax. JuMP takes…