相关论文: Rational functions with linear relations

Let $\Delta_x f(x,y)=f(x+1,y)-f(x,y)$ and $\Delta_y f(x,y)=f(x,y+1)-f(x,y)$ be the difference operators with respect to $x$ and $y$. A rational function $f(x,y)$ is called summable if there exist rational functions $g(x,y)$ and $h(x,y)$…

Working over the split octonions over an algebraically closed field, we solve all polynomial equations in which all the coefficients but the constant term are scalar. As a consequence, we calculate the n-th roots of an octonion.

Let h be a complex meromorphic function decomposed in two different ways P(f) and Q(g), where f, g are meromorphic functions and P, Q are rational functions. We follow an approach due to C.-C. Yang, P. Li and K. H. Ha who handle similar…

If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…

For a subgroup of $PGL(2,q)$ we show how some irreducible polynomials over $\mathbb{F}_q$ arise from the field of invariant rational functions. The proofs rely on two actions of $PGL(2,F)$, one on the projective line over a field $F$ and…

We consider the rational linear relations between real numbers whose squared trigonometric functions have rational values, angles we call ``geodetic''. We construct a convenient basis for the vector space over Q generated by these angles.…

We consider the problem of defining polynomials over function fields of positive characteristic. Among other results, we show that the following assertions are true. 1. Let $\G_p$ be an algebraic extension of a field of $p$ elements and…

Given a univariate polynomial f(x) over a ring R, we examine when we can write f(x) as g(h(x)) where g and h are polynomials of degree at least 2. We answer two questions of Gusic regarding when the existence of such g and h over an…

We generalize both the notion of polynomial functions on Lie groups and the notion of horizontally affine maps on Carnot groups. We fix a subset $S$ of the algebra $\mathfrak g$ of left-invariant vector fields on a Lie group $\mathbb G$ and…

Let $f\in K(t)$ be a univariate rational function. It is well known that any non-trivial decomposition $g \circ h$, with $g,h\in K(t)$, corresponds to a non-trivial subfield $K(f(t))\subsetneq L \subsetneq K(t)$ and vice-versa. In this…

The so-called generalized associativity functional equation G(J(x,y),z) = H(x,K(y,z)) has been investigated under various assumptions, for instance when the unknown functions G, H, J, and K are real, continuous, and strictly monotonic in…

Finite families of biorthogonal rational functions and orthogonal polynomials of Racah-type are studied within a unified algebraic framework based on the meta Racah algebra and its finite-dimensional representations. These functions are…

Orthogonal rational functions (ORF) on the unit circle generalize orthogonal polynomials (poles at infinity) and Laurent polynomials (poles at zero and infinity). In this paper we investigate the properties of and the relation between these…

We determine all F,G in C[X] of degree at least 2 for which the semigroup generated by F and G under composition is not the free semigroup on the letters F and G. We also solve the same problem for F,G in X^2 C[[X]], and prove partial…

In this note we describe solutions of the equation: $F(A(z))=G(B(z)),$ where $A,B$ are polynomials and $F,G$ are continuous functions on the Riemann sphere.

In this paper we present an algorithm to compute all unirational fields of transcendence degree one containing a given finite set of multivariate rational functions. In particular, we provide an algorithm to decompose a multivariate…

It is known that if $f\colon {\mathbb R}^2 \to {\mathbb R}$ is a polynomial in each variable, then $f$ is a polynomial. We present generalizations of this fact, when ${\mathbb R}^2$ is replaced by $G\times H$, where $G$ and $H$ are…

In the 1920's, Ritt studied the operation of functional composition g o h(x) = g(h(x)) on complex rational functions. In the case of polynomials, he described all the ways in which a polynomial can have multiple `prime factorizations' with…

We consider simple rational functions $R_{mn}(x)=P_m(x)/Q_n(x)$, with $P_m$ and $Q_n$ polynomials of degree $m$ and $n$ respectively. We look for "nice" functions, which we define to be ones where as many as possible of the roots, poles,…

Let K be a global field and f in K[X] be a polynomial. We present an efficient algorithm which factors f in polynomial time.