Related papers: A uniqueness theorem for bounded analytic function…

We study the functional identity $G(x)f(x)=H(x)$ on a division ring $D$, where $f \colon D\to D$ is an additive map and $G(X)\ne 0, H(X)$ are generalized polynomials in the variable $X$ with coefficients in $D$. Precisely, it is proved that…

We propose a symbolic-numeric algorithm to count the number of solutions of a polynomial system within a local region. More specifically, given a zero-dimensional system $f_1=\cdots=f_n=0$, with $f_i\in\mathbb{C}[x_1,\ldots,x_n]$, and a…

Let E_n={x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}}. If Matiyasevich's conjecture on single-fold Diophantine representations is true, then for every computable function f:N->N there is a positive integer m(f) such that for…

We study rational functions $f$ of degree $d+1$ such that $f$ is univalent in the exterior unit disc, and the image of the unit circle under $f$ has the maximal number of cusps ($d+1$) and double points $(d-2)$. We introduce a bi-angled…

Extending work of Bell and of Bell, Ghioca, and Tucker, we prove that for a p-adic analytic self-map f on a closed unit polydisk, if every coefficient of f(x)-x has valuation greater than that of p^{1/(p-1)}, then the iterates of f can be…

We prove that, if f:R^n\to R satisfies Fr\'echet's functional equation and f(x_1,...,x_n) is not an ordinary algebraic polynomial in the variables x_1,...,x_n, then f is unbounded on all non-empty open set U of R^n. Furthermore, the closure…

Let f(1)=1, and let f(n+1)=2^{2^{f(n)}} for every positive integer n. We conjecture that if a system S \subseteq {x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} \cup {x_i+1=x_k: i,k \in {1,...,n}} has only finitely many solutions in non-negative…

This paper settles the computational complexity of the problem of integrating a polynomial function f over a rational simplex. We prove that the problem is NP-hard for arbitrary polynomials via a generalization of a theorem of Motzkin and…

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

A rational function $f(x)$ is rationally summable if there exists a rational function $g(x)$ such that $f(x)=g(x+1)-g(x)$. Detecting whether a given rational function is summable is an important and basic computational subproblem that…

Let $D_j\subset\Bbb C^{k_j}$ be a pseudoconvex domain and let $A_j\subset D_j$ be a locally pluripolar set, $j=1,...,N$. Put$$X:=\bigcup_{j=1}^N A_1\times...\times A_{j-1}\times D_j\times A_{j+1}\times...\times A_N\subset\Bbb…

In this very short paper, we provide a strong motivation for the study of the following problem: given a real normed space $E$, a closed, convex, unbounded set $X\subseteq E$ and a function $f:X\to X$, find suitable conditions under which,…

We analyse the 3-extremal holomorphic maps from the unit disc $\mathbb{D}$ to the symmetrised bidisc $ \mathcal{G}$, defined to be the set $ \{(z+w,zw): z,w\in\mathbb{D}\}$, with a view to the complex geometry and function theory of…

In this paper, we investigate the uniqueness problem of difference polynomials $f^{n}(z)P(f(z))L_c(f)$ and $g^{n}(z)P(g(z))L_c(g)$, where $L_c(f)=f(z+c)+c_0f(z)$, $P(z)$ is a polynomial with constant coefficients of degree $m$ sharing a…

By classical results of Herglotz and F. Riesz, any bounded analytic function in the complex unit disk has a unique inner-outer factorization. Here, a bounded analytic function is called \emph{inner} or \emph{outer} if multiplication by this…

In 1934, Whitney raised the question of how to recognize whether a function f defined on a closed subset X of Euclidean space is the restriction of a function that is continuously differentiable to order p. A necessary and sufficient…

Let E_n={x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}}. There is an algorithm that for every computable function f:N->N returns a positive integer m(f), for which a second algorithm accepts on the input f and any integer…

Evaluating a polynomial on a set of points is a fundamental task in computer algebra. In this work, we revisit a particular variant called trimmed multipoint evaluation: given an $n$-variate polynomial with bounded individual degree $d$ and…

Let $D = d_1, d_2, \ldots, d_n$ and $F = f_1, f_2,\ldots, f_n$ be two sequences of positive integers. We consider the following decision problems: is there a $i)$ multigraph, $ii)$ loopless multigraph, $iii)$ simple graph, $iv)$ connected…

Let $\mathcal{R} = \mathbb{K}[x_1, \dots, x_n]$ be a multivariate polynomial ring over a field $\mathbb{K}$ of characteristic 0. Consider $n$ algebraically independent elements $g_1, \dots, g_n$ in $\mathcal{R}$. Let $\mathcal{S}$ denote…