相关论文: Filled Julia sets with empty interior are computab…
For a set $S$ of quadratic polynomials over a finite field, let $C$ be the (infinite) set of arbitrary compositions of elements in $S$. In this paper we show that there are examples with arbitrarily large $S$ such that every polynomial in…
We give a sufficient condition for an algebraic structure to have a computable presentation with a computable basis and a computable presentation with no computable basis. We apply the condition to differentially closed, real closed, and…
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…
In this paper, we give a family of rational maps whose Julia sets are Cantor circles and show that every rational map whose Julia set is a Cantor set of circles must be topologically conjugate to one map in this family on their…
The study of dynamical systems involves analyzing how functions behave under iteration in different mathematical spaces. In the context of complex dynamics, tools such as Julia sets and filled Julia sets are used to understand the long-term…
Let $K$ be a global field and $n > 1$ an integer. We show $n$ is composite if and only if there is an irreducible polynomial $f(x) \in K[x]$ of degree $n$ which is reducible $q$-adically for all the primes $q$ of $K$.
It is well-known that the Julia set J(f) of a rational map is uniformly perfect; that is, every ring domain which separates J(f) has bounded modulus, with the bound depending only on f. In this article we prove that an analogous result is…
Let $T_1,\ldots, T_m$ be a family of $d\times d$ invertible real matrices with $\|T_i\| <1/2$ for $1\leq i\leq m$. We provide some sufficient conditions on these matrices such that the self-affine set generated by the iterated function…
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…
We are concerned with the behavior of the polynomial maps $F=(P,Q)$ of $\mathbb{C}^2$ with finite fibres and satisfying the condition that all of the curves $aP+bQ=0$, $(a:b)\in \mathbb{P}^1$, are irreducible rational curves. The obtained…
A completely stable multicurve of a post-critically finite rational map induces a combinatorial decomposition. The projections of the small Julia sets are immersed within the original Julia set. We prove that two small Julia sets are…
In this paper, we define a realizability semantics for the simply typed $\lambda\mu$-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. This result serves to give characterizations of the…
The aim of this short note is to draw attention to a method by which the partition function and marginal probabilities for a certain class of random fields on complete graphs can be computed in polynomial time. This class includes Ising…
It is proved that any polynomial vector field in two complex variables which is complete on a non-algebraic trajectory is complete.
A set of integers $A$ is computably encodable if every infinite set of integers has an infinite subset computing $A$. By a result of Solovay, the computably encodable sets are exactly the hyperarithmetic ones. In this paper, we extend this…
We examine categoricity issues for computable algebraic fields. We give a structural criterion for relative computable categoricity of these fields, and use it to construct a field that is computably categorical, but not relatively…
Computations over the rational numbers often suffer from intermediate coefficient swell. One solution to this problem is to apply the given algorithm modulo a number of primes and then lift the modular results to the rationals. This method…
We determine the solvable complete Lie algebras whose nilradical is isomorphic to a filiform Lie algebra. Moreover we show that for any positive integer $n$ there exists a solvable complete Lie algebras whose second cohomology group with…
We introduce a new algorithm computing the characteristic polynomials of hyperplane arrangements which exploits their underlying symmetry groups. Our algorithm counts the chambers of an arrangement as a byproduct of computing its…
We give algorithms to compute isomorphism classes of ordinary abelian varieties defined over a finite field $\mathbb{F}_q$ whose characteristic polynomial (of Frobenius) is square-free and of abelian varieties defined over the prime field…