Related papers: Filled Julia sets with empty interior are computab…
We establish an invertibility criterion for free polynomials and free functions evaluated on some tuples of matrices. We show that if the derivative is nonsingular on some domain closed with respect to direct sums and similarity, the…
The injective polynomial modules for a general linear group $G$ of degree $n$ are labelled by the partitions with at most $n$ parts. Working over an algebraically closed field of characteristic $p$, we consider the question of which…
We present an open source computational framework geared towards the efficient numerical investigation of open quantum systems written in the Julia programming language. Built exclusively in Julia and based on standard quantum optics…
If M is a Drinfeld module over a local function field L, we may view M as a dynamical system, and consider its filled Julia set J. If J^0 is the connected component of the identity, relative to the Berkovich topology, we give a…
We partially answer to a question of Vidaux and Videla by constructing an infinite family of rings of algebraic integers of totally real subfields of Q whose Julia Robinson's Number is distinct from 4 and +$\infty$. Moreover the set of the…
The concepts of differentiation and integration for matrices are known. As far as each matrix is differentiable, it is not clear a priori whether a given matrix is integrable or not. Recently some progress was obtained for diagonalizable…
We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…
It is shown that a polynomial with a Cremer periodic point has a non-accessible critical point in its Julia set provided that the Cremer periodic point is approximated by small cycles.
The Fatou-Julia iteration theory of rational and transcendental entire functions has recently been extended to quasiregular maps in more than two real dimensions. Our goal in this paper is similar; we extend the iteration theory of analytic…
We show that the common theory of all modules over a tubular algebra (over a recursive algebraically closed field) is decidable. This result supports a long standing conjecture of Mike Prest which says that a finite-dimensional algebra…
In this article we address the following question, whose interest was recently renewed by problems arising in arithmetic dynamics: under which conditions does there exist a local biholomorphism between the Julia sets of two given…
We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…
We present a substantial generalisation of a classical result by Lie on integrability by quadratures. Namely, we prove that all vector fields in a finite-dimensional transitive and solvable Lie algebra of vector fields on a manifold can be…
In this paper, we have investigated the Bungee set of composition of two transcendental entire functions. We have provided a class of permutable entire functions for which their Bungee sets are equal. Moreover, we have obtained a result on…
We provide an internal characterization of those finite algebras (i.e., algebraic structures) $\mathbf A$ such that the number of homomorphisms from any finite algebra $\mathbf X$ to $\mathbf A$ is bounded from above by a polynomial in the…
Geometric computing with chain complexes allows for the computation of the whole chain of linear spaces and (co)boundary operators generated by a space decomposition into a cell complex. The space decomposition is stored and handled with…
As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms. It is natural to ask whether there is a…
It is well-known that the Julia set of a hyperbolic rational map is quasisymmetrically equivalent to the standard Cantor set. Using the uniformization theorem of David and Semmes, this result comes down to the fact that such a Julia set is…
For polynomials, local connectivity of Julia sets is a much-studied and important property. Indeed, when the Julia set of a polynomial of degree $d\geq 2$ is locally connected, the topological dynamics can be completely described as a…
Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…