A counterexample to the strong real Jocobian conjecture.
Let and be polynomials in one variable with complex coefficients and let be a natural number. Suppose that is not constant and has only simple roots. Then there is a rational function with if and only if the Wronskian of the functions is divisible by .
In this article we formalize rational functions as pairs of polynomials and define some basic notions including the degree and evaluation of rational functions [8]. The main goal of the article is to provide properties of rational functions necessary to prove a theorem on the stability of networks
Introduction. The problem of determining the formula for , the number of partitions of an integer into elements of a finite set S, that is, the number of solutions in non-negative integers, , of the equation hs₁ s₁ + ... + hsk sk = n, was solved in the nineteenth century (see Sylvester [4] and Glaisher [3] for detailed accounts). The solution is the coefficient of[(1-xs₁)... (1-xsk)]-1, expressions for which they derived. Wright [5] indicated a simpler method by which to find part of the solution...
Let f(x) be a complex rational function. We study conditions under which f(x) cannot be written as the composition of two rational functions which are not units under the operation of function composition. In this case, we say that f(x) is prime. We give sufficient conditions for complex rational functions to be prime in terms of their degrees and their critical values, and we also derive some conditions for the case of complex polynomials.