相关论文: Computability of Julia sets
We prove a Julia inequality for bounded non-commutative functions on polynomial polyhedra. We use this to deduce a Julia inequality for holomorphic functions on classical domains in $\mathbb{C}^d$. We look at differentiability at a boundary…
Does a given a set of polyominoes tile some rectangle? We show that this problem is undecidable. In a different direction, we also consider tiling a cofinite subset of the plane. The tileability is undecidable for many variants of this…
We give two natural definitions of polynomial-time computability for L2 functions; and we show them incomparable (unless complexity class FP_1 includes #P_1).
An algorithm is described to compute the canonical basis of an irreducible module over a quantized enveloping algebra of a finite-dimensional semisimple Lie algebra. The algorithm works for modules that are constructed as a submodule of a…
A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…
For a sequence $(\lambda_n)$ of positive real numbers we consider the exponential functions $f_{\lambda_n} (z) = \lambda_n e^z$ and the compositions $F_n = f_{\lambda_n} \circ f_{\lambda_{n-1}} \circ ... \circ f_{\lambda_1}$. For such a…
We discuss what is special about the reproducibility of workflows in computer algebra. It is emphasized how the programming language Julia and the new computer algebra system OSCAR support such a reproducibility, and how users can benefit…
We extend results by Barnsley et al. about orthogonal polynomials on Julia sets to the case of generalized Julia sets. The equilibrium measure is considered. In addition, we discuss optimal smoothness of Green functions and Parreau-Widom…
Inspired from a joint work by A. Beckmann, S. Buss and S. Friedman, we propose a class of set-theoretic functions, predicatively computable functions. Each function in this class is polynomial time computable when we restrict to finite…
We introduce the Scheduling.jl Julia package, which is intended for collaboratively conducting scheduling research and for sharing implementations of algorithms. It provides the fundamental building blocks for implementing scheduling…
We show that the iterative logarithm of each non-linear entire function is differentially transcendental over the ring of entire functions, and we give a sufficient criterion for such an iterative logarithm to be differentially…
In this paper I prove that for a polynomial of degree $d$ with a Cantor Julia set $J$, the Julia set can be understood as the simplest possible quotiont of the one sided shift space $\Sigma_d$ with dynamics given by the shift. Here simplest…
The classification of separable operator spaces and systems is commonly believed to be intractable. We analyze this belief from the point of view of Borel complexity theory. On one hand we confirm that the classification problems for…
We present BSeries.jl, a Julia package for the computation and manipulation of B-series, which are a versatile theoretical tool for understanding and designing discretizations of differential equations. We give a short introduction to the…
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…
Classical approach of solvability problem has shed much light on what we can solve and what we cannot solve mathematically. Starting with quadratic equation, we know that we can solve it by the quadratic formula which uses square root.…
We prove that Julia components of polynomials are generally small in diameter. For polynomials without irrationally neutral cycles, Fatou components are also typically small, even when the Julia set is not locally connected.
The notion of hidden symmetry algebra used in the context of exactly solvable systems is re-examined from the purely algebraic way, analyzing subspaces of commuting polynomials that generate finite-dimensional quadratic algebras. By…
We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…
For a family of holomorphic functions on an arbitrary domain, we introduce Fatou and Julia like sets, and establish some of their interesting properties.