Related papers: Recomposing rational functions

The well-known theory of "rational canonical form of an operator" describes the invariant factors, or elementary divisors, as a complete set of invariants of a similarity class of an operator on a finite-dimensional vector space $\V$ over a…

We build a Shannon orbit equivalence between the universal odometer and a variety of rank-one systems. This is done in a unified manner, using what we call flexible classes of rank-one transformations. Our main result is that every flexible…

We prove several results on backward orbits of rational functions over number fields. First, we show that if $K$ is a number field, $\phi\in K(x)$ and $\alpha\in K$ then the extension of $K$ generated by the abelian points in the backward…

Reversibility is a key issue in the interface between computation and physics, and of growing importance as miniaturization progresses towards its physical limits. Most foundational work on reversible computing to date has focussed on…

We give an example of two rational functions with non-equal Julia sets that generate a rational semigroup whose completely invariant Julia set is a closed line segment. We also give an example of polynomials with unequal Julia sets that…

We study elliptic functions in quaternionic analysis, and prove some analogues of classical theorems from the complex case. The main result is a relation between the periods of closed differential 1-forms and 3-forms on H/L where L is a…

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…

J.Ritt has investigated the structure of complex polynomials with respect to superposition. In particular, he listed all the polynomials admitting different double decompositions into indecomposable polynomials. The analogues of Ritt theory…

This paper solves the rational noncommutative analog of Hilbert's 17th problem: if a noncommutative rational function is positive semidefinite on all tuples of hermitian matrices in its domain, then it is a sum of hermitian squares of…

Consider an algebraic function like $F(x) = \sqrt{x^3 - 1}$. If $p \in \mathbb{Q}$ is a rational number, how many iterates of $p$ under $F$ can also be rational? The dynamics of algebraic functions may be formalized in the language of…

The essential variables in a finite function $f$ are defined as variables which occur in $f$ and weigh with the values of that function. The number of essential variables is an important measure of complexity for discrete functions. When…

We show that the classical kernel and domain functions associated to an n-connected domain in the plane are all given by rational combinations of three or fewer holomorphic functions of one complex variable. We characterize those domains…

In this article we introduce a new matroid invariant, a combinatorial analog of the topological zeta function of a polynomial. More specifically we associate to any ranked, atomic meet-semilattice L a rational function Z(L,s), in such a way…

We realize a dynamical decomposition for a post-critically finite rational map which admits a combinatorial decomposition. We split the Riemann sphere into two completely invariant subsets. One is a subset of the Julia set consisting of…

In Chapter 3 of his Notes on constructive mathematics, Martin-L{\"o}f describes recursively constructed ordinals. He gives a constructively acceptable version of Kleene's computable ordinals. In fact, the Turing definition of computable…

We define a ring whose elements are rational functions, whose addition is polynomial multiplication, and whose multiplication is a convolution operation. It is then show that this ring's endomorphisms exhibit a strong classification.…

We describe the structure of all codimension-two lattice configurations $A$ which admit a stable rational $A$-hypergeometric function, that is a rational function $F$ all whose partial derivatives are non zero, and which is a solution of…

Based on Stokes' theorem we derive a non-holomorphic functional calculus for matrices, assuming sufficient smoothness near eigenvalues, corresponding to the size of related Jordan blocks. It is then applied to the complex conjugation…

Let $\Omega$ be a complex lattice which does not have complex multiplication and $\wp=\wp_\Omega$ the Weierstrass $\wp$-function associated to it. Let $D\subseteq\mathbb{C}$ be a disc and $I\subseteq\mathbb{R}$ be a bounded closed interval…

Let A be an arbitrary set. For any transformation T (self-map of A) let T(f)(x):=f(T(x)) (for all x in A) be the usual shift operator. A function g is called periodic, i.e., invariant mod T, if Tg=g (=Ig, where I is the identity operator).…