相关论文: Rational functions with linear relations
Permutation rational functions over finite fields have attracted much attention in recent years. In this paper, we introduce a class of permutation rational functions over $\mathbb F_{q^2}$, whose numerators are so-called $q$-quadratic…
Two polynomials, $f,g \in \mathbb{Z}[x]$ are evaluationally coprime at x if $\gcd(f(x),g(x))=1$. We give necessary and sufficient conditions for two such linear polynomials to have a positive proportion of evaluated coprime values.
The biorthogonal rational functions of the ${_3}F_2$ type on the uniform grid provide the simplest example of rational functions with bispectrality properties that are similar to those of classical orthogonal polynomials. These properties…
We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.
Let $K$ be a field, fix an algebraic closure $\overline{K}$, and let $G$ be a subgroup of $\overline{K}^\times$. We are able to give a closed formula for the ratio between the degree $[K(G):K]$ and the index $|GK^\times:K^\times|$, provided…
Over the split-octonion algebra defined over an arbitrary field, we solve all polynomial equations whose coefficients are scalar except for the constant term. As an application, we determine the square and cubic roots of an octonion.
We show that a linear functional equation with polynomial coefficients need not admit an arc-analytic solution even if it admits a continuous semialgebraic one. We also show that such an equation need not admit a Nash regulous solution even…
We prove that $\mathrm{deg}(f) \leq \widetilde{O}(\mathrm{rdeg}(f)^3)$ for every Boolean function $f$, where $\mathrm{deg}(f)$ is the degree of $f$ and $\mathrm{rdeg}(f)$ is the rational degree of $f$. This resolves the second of the three…
We reveal a complexity chasm, separating the trinomial and tetranomial cases, for solving univariate sparse polynomial equations over certain local fields. First, for any fixed field $K\in\{\mathbb{Q}_2,\mathbb{Q}_3,\mathbb{Q}_5,\ldots\}$,…
The paper proves sum-of-square-of-rational-function based representations (shortly, sosrf-based representations) of polynomial matrices that are positive semidefinite on some special sets: $\mathbb{R}^n;$ $\mathbb{R}$ and its intervals…
We develop explicit formulas and algorithms for arithmetic in radical function fields K/k(x) over finite constant fields. First, we classify which places of k(x) whose local integral bases have an easy monogenic form, and give explicit…
An irreducible polynomial over $\Bbb F_q$ is said to be normal over $\Bbb F_q$ if its roots are linearly independent over $\Bbb F_q$. We show that there is a polynomial $h_n(X_1,\dots,X_n)\in\Bbb Z[X_1,\dots,X_n]$, independent of $q$, such…
There are two kinds of polynomial functions on matrix algebras over commutative rings: those induced by polynomials with coefficients in the algebra itself and those induced by polynomials with scalar coefficients. In the case of algebras…
Given an uncountable algebraically closed field $K$, we proved that if partially defined function $f\colon K \times \dots \times K \dashrightarrow K$ defined on a Zariski open subset of the $n$-fold Cartesian product $K \times \dots \times…
In \cite{05} B. Ebanks and H. Stetk{\ae}r obtained the solutions of the functional equation $f(xy)-f(\sigma(y)x)=g(x)h(y)$ where $\sigma$ is an involutive automorphism and $f,g,h$ are complex-valued functions, in the setting of a group $G$…
A seminal result of E. Ehrhart states that the number of integer lattice points in the dilation of a rational polytope by a positive integer $k$ is a quasi-polynomial function of $k$ --- that is, a "polynomial" in which the coefficients are…
Let $H(D)$ denote the space of holomorphic functions on the unit disk $D$. We characterize those radial weights $w$ on $D$, for which there exist functions $f, g \in H(D)$ such that the sum $|f| + |g|$ is equivalent to $w$. Also, we obtain…
We present an algorithm producing all rational functions $f$ with prescribed $n+1$ Taylor coefficients at the origin and such that $\|f\|_\infty\le 1$ and $\deg f\le k$ for every fixed $k\ge n$. The case where $k<n$ is also discussed.
We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…
For a rational function f we consider the norm of the derivative with respect to the spherical metric and denote by K(f) the supremum of this norm. We give estimates of this quantity K(f) both for an individual function and for sequences of…