Related papers: Real quadratic Julia sets can have arbitrarily hig…
We show that the supremum for $c$ real of the Hausdorff dimension of the Julia set of the polynomial $z\mapsto z^d+c$ ($d$ is an even natural number) is greater than $2d/(d+1)$.
It was known that the Sierpi\'{n}ski carpets can appear as the Julia sets in the families of some rational maps. In this article we present a criterion that guarantees the existence of the carpet Julia sets in some rational maps having…
In this paper we investigate the support of the unique measure of maximal entropy of complex Henon maps, J^*. The main question is whether this set is the same as the analogue of the Julia set, J.
Calcium is a C library for real and complex numbers in a form suitable for exact algebraic and symbolic computation. Numbers are represented as elements of fields $\mathbb{Q}(a_1,\ldots,a_n)$ where the extensions numbers $a_k$ may be…
Complexity theory offers a variety of concise computational models for computing boolean functions - branching programs, circuits, decision trees and ordered binary decision diagrams to name a few. A natural question that arises in this…
Intrinsic complexity of a relation on a given computable structure is captured by the notion of its degree spectrum - the set of Turing degrees of images of the relation in all computable isomorphic copies of that structure. We investigate…
Structural graph parameters play an important role in parameterized complexity, including in kernelization. Notably, vertex cover, neighborhood diversity, twin-cover, and modular-width have been studied extensively in the last few years.…
In studying the complexity of iterative processes it is usually assumed that the arithmetic operations of addition, multiplication, and division can be performed in certain constant times. This assumption is invalid if the precision…
We prove the existence of a transcendental entire function whose Julia set is a "bouquet of pseudo-arcs". More precisely, the union of the Julia set with infinity is an uncountable union of pseudo-arcs, which are pairwise disjoint except at…
We show that an exponential map $f_c(z)=e^z+c$ whose singular value $c$ is combinatorially non-recurrent and non-escaping is uniquely determined by its combinatorics, i.e. the pattern in which its dynamic rays land together. We do this by…
Quantifying the complexity of systems consisting of many interacting parts has been an important challenge in the field of complex systems in both abstract and applied contexts. One approach, the complexity profile, is a measure of the…
The diameter of a graph is among its most basic parameters. Since a few years, it moreover became a key issue to compute it for massive graphs in the context of complex network analysis. However, known algorithms, including the ones…
Given a subset of $\mathbb C$ containing $x,y$, one can add $x + y,\,x - y,\,xy$ or (when $y\ne0$) $x/y$ or any $z$ such that $z^2=x$. Let $p$ be a prime Fermat number. We prove that it is possible to obtain from $\{1\}$ a set containing…
The quest for quantum computers is motivated by their potential for solving problems that defy existing, classical, computers. The theory of computational complexity, one of the crown jewels of computer science, provides a rigorous…
We present Trixi.jl, a Julia package for adaptive high-order numerical simulations of hyperbolic partial differential equations. Utilizing Julia's strengths, Trixi.jl is extensible, easy to use, and fast. We describe the main design choices…
Every real hyperbolic form in three variables can be realized as the determinant of a linear net of Hermitian matrices containing a positive definite matrix. Such representations are an algebraic certificate for the hyperbolicity of the…
Let $b \ge 2$ be an integer. We prove that the $b$-adic expansion of every irrational algebraic number cannot have low complexity. Furthermore, we establish that irrational morphic numbers are transcendental, for a wide class of morphisms.…
Let $${\mathbb P}^c=(\lfloor p^c\rfloor)_{p\in{\mathbb P}} \qquad (c>1,\ c\not\in {\mathbb N}), $$ where ${\mathbb P}$ is the set of prime numbers, and $\lfloor\cdot\rfloor$ is the floor function. We show that for every such $c$ there are…
A series of examples of computational models is provided, where the model aim is to interpret numerical results in terms of internal states of agents minds. Two opposite strategies or research can be distinguished in the literature. First…
The dynamics of the family of maps $\displaystyle{f_{\alpha, \beta, \gamma, \delta}(z)=\frac{\alpha z + \beta}{\gamma z^2 +\delta z}}$ in complex plane is investigated computationally. This dynamical system $z_{n+1}=f_{\alpha, \beta,…