Related papers: Finiteness theorems for commuting and semiconjugat…
Let $\Lambda$ be a collection of partitions of a positive integer $d$ of the form $$(a_1,\cdots, a_p),\,(b_1,\cdots, b_q),\,(m_1+1,1,\cdots,1),\cdots, (m_l+1,1,\cdots,1),$$ where $(m_1,\cdots, m_l)$ is a partition of $p+q-2>0$. We prove…
We prove several conjectures made by Z.-W. Sun on the existence of permutations conditioned by certain rational functions. Furthermore, we fully characterize all integer values of the "inverse difference" rational function. Our proofs…
A recent refinement of Ker\'ekj\'art\'o's Theorem has shown that in $\mathbb R$ and $\mathbb R^2$ all $\mathcal C^l$-solutions of the functional equation $f^n =\textrm{Id}$ are $\mathcal C^l$-linearizable, where $l\in \{0,1,\dots \infty\}$.…
Using the theory of resolving classes, we show that if $X$ is a CW complex of finite type such that $\map_*(X, S^{2n+1})\sim *$ for all sufficiently large $n$, then $\map_*(X, K) \sim *$ for every simply-connected finite-dimensional CW…
Let $K$ be a number field and $S$ a fixed finite set of places of $K$ containing all the archimedean ones. Let $R_S$ be the ring of $S$-integers of $K$. In the present paper we study the cycles for rational maps of $\mathbb{P}_1(K)$ of…
It is well known that the composition of a D-finite function with an algebraic function is again D-finite. We give the first estimates for the orders and the degrees of annihilating operators for the compositions. We find that the analysis…
We study rational functions admitting a continuous extension to the real affine space. First of all, we focus on the regularity of such functions exhibiting some nice properties of their partial derivatives. Afterwards, since these…
Let $f$ be a rational map with degree at least two. We prove that $f$ has at least $2$ disjoint and infinite critical orbits in the Julia set if it has a Herman ring. This result is sharp in the following sense: there exists a cubic…
Let $r(z)$ be a rational function with at most $n$ poles, $a_1, a_2, \ldots, a_n,$ where $|a_j| > 1,$ $1\leq j\leq n.$ This paper investigates the estimate of the modulus of the derivative of a rational function $r(z)$ on the unit circle.…
A formal series in noncommuting variables $\Sigma$ over the rationals is a mapping $\Sigma^* \to \mathbb Q$. We say that a series is commutative if the value in the output does not depend on the order of the symbols in the input. The…
We establish effective elimination theorems for differential-difference equations. Specifically, we find a computable function $B(r,s)$ of the natural number parameters $r$ and $s$ so that for any system of algebraic differential-difference…
We prove an analog of the Tits alternative for rational functions. In particular, we show that if $S$ is a finitely generated semigroup of rational functions over the complex numbers, then either $S$ has polynomially bounded growth or $S$…
We study the rational dynamics of the map $\mathcal{T}(x)=\lfloor x\rfloor(1+\{x\})$, which appears in the recursive construction of the prime-representing constant of Fridman, Garbulsky, Glecer, Grime and Florentin. For a rational number…
We study the optimization of functions with $n>2$ arguments that have a representation as a sum of several functions that have only $2$ of the $n$ arguments each, termed sums of bivariates, on finite domains. The complexity of optimizing…
This paper investigates certain classes of entire functions in C^n that, together with their partial derivatives, share a finite set consisting of three elements. By employing normality criteria, we study the behaviour of such functions and…
Suppose $\{f_t\}$ is an analytic one-parameter family of rational maps defined over a non-Archimedean field $K$. We prove a finiteness theorem for the set of rescalings for $\{f_t\}$. This complements results of J. Kiwi.
Boyer and Moore have discussed a recursive function that puts conditional expressions into normal form [1]. It is difficult to prove that this function terminates on all inputs. Three termination proofs are compared: (1) using a measure…
Let $S(X,B)$ be a symmetric (``palindromic'') word in two letters $X$ and $B$. A theorem due to Hillar and Johnson states that for each pair of positive definite matrices $B$ and $P$, there is a positive definite solution $X$ to the word…
The problem of finding graph structure of functions commuting with a given function in terms of their functional graphs is considered. Structure of functional graphs of commuting functions is described. The problem is reduced to describing…
We look at spaces of infinite-by-infinite matrices, and consider closed subsets that are stable under simultaneous row and column operations. We prove that up to symmetry, any of these closed subsets is defined by finitely many equations.