Related papers: Filled Julia sets with empty interior are computab…
Let $P$ be a polynomial of degree $d$ with a Cremer point $p$ and no repelling or parabolic periodic bi-accessible points. We show that there are two types of such Julia sets $J_P$. The \emph{red dwarf} $J_P$ are nowhere connected im…
In this paper we give elementary conditions completely characterising when the theory of modules of a Pr\"ufer domain is decidable. Using these results, we show that the theory of modules of the ring of integer valued polynomials is…
We show that every polynomial overring of the ring ${\rm Int}(\mathbb Z)$ of polynomials which are integer-valued over $\mathbb Z$ may be considered as the ring of polynomials which are integer-valued over some subset of $\hat{\mathbb{Z}}$,…
A set $X \subseteq 2^\omega$ with positive measure contains a perfect subset. We study such perfect subsets from the viewpoint of computability and prove that these sets can have weak computational strength. Then we connect the existence of…
In this paper, we present sufficient conditions to guarantee the invertibility of rational circulant matrices with any given size. These sufficient conditions consist of linear combinations of the entries in the first row with integer…
We study representation of square-free polynomials in the polynomial ring F[t] over a finite field F by polynomials in F[t][x]. This is a function field version of the well-studied problem of representing squarefree integers by integer…
We present an algorithmic equivalent statement to the Jacobian conjecture. Given a polynomial map F on an affine space of dimension n, our algorithm constructs n sequences of polynomials such that F is invertible if and only if the zero…
In this article, we completely describe the control sets of one-input linear control systems on solvable, nonnilpotent 3D Lie groups. We show that, if the restriction of the associate derivation to the nilradical is nontrivial, the Lie…
In a recent paper, two multi-representations for the measurable sets in a computable measure space have been introduced, which prove to be topologically complete w.r.t. certain topological properties. In this contribution, we show them…
We show that there exists a transcendental entire function whose Julia set has positive finite Lebesgue measure.
Existence of superdecomposable pure-injective modules reflects complexity in the category of finite-dimensional representations over an algebra. Such an existence occurs when an algebra is non-domestic; a conjecture due to M. Prest. G.…
Let L be a finite-dimensional Lie algebra over a field of non-zero characteristic. By a theorem of Jacobson, L has a finite-dimensional faithful module which is completely reducible. We show that if the field is not algebraically closed,…
In this paper we characterize $\w$-limit sets of dendritic Julia sets for quadratic maps. We use Baldwin's symbolic representation of these spaces as a non-Hausdorff itinerary space and prove that quadratic maps with dendritic Julia sets…
In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…
We study the possible Hausdorff limits of the Julia sets and filled Julia sets of subsequences of the sequence of dual Chebyshev polynomials of a non-polar compact set K in C and compare such limits to K. Moreover, we prove that the…
It is well known, that if polynomial with rational coefficients of degree $n$ takes integer values in points $0,1,...,n$ then it takes integer values in all integer points. Are there sets of $n+1$ points with the same property in other…
In this paper we explore a class of quadratic polynomials having Siegel disks with unbounded type rotation numbers. We prove that any boundary point of Siegel disks of these polynomials is a Lebesgue density point of their filled-in Julia…
The Fatou-Julia decomposition is significant in the study of iterations of holomorphic mappings. Such a decomposition can be also considered for foliations in a unified manner. Although the decomposition will be fundamental in the study, it…
We exhibit a sound and complete implicit-complexity formalism for functions feasibly computable by structural recursions over inductively defined data structures. Feasibly computable here means that the structural-recursive definition runs…
We give a sheaf theoretic interpretation of Potts models with external magnetic field, in terms of constructible sheaves and their Euler characteristics. We show that the polynomial countability question for the hypersurfaces defined by the…