Related papers: On function compositions that are polynomials

Steingrimsson (2001) showed that the chromatic polynomial of a graph is the Hilbert function of a relative Stanley-Reisner ideal. We approach this result from the point of view of Ehrhart theory and give a sufficient criterion for when the…

Let $k\in \mathbb{N}\setminus\{0\}$. For a commutative ring $R$, the ring of dual numbers of $k$ variables over $R$ is the quotient ring $R[x_1,\ldots,x_k]/ I $, where $I$ is the ideal generated by the set $\{x_ix_j\mid i,j=1,\ldots,k\}$.…

The vector space of all polynomial functions of degree $k$ on a box of dimension $n$ is of dimension ${n \choose k}$. A consequence of this fact is that a function can be approximated on vertices of the box using other vertices to higher…

In this paper we show that if an entire function $f(z_1,z_2)$ of two (or more) complex variables verifies $\norm{f(z_1,z_2)}\leq K(\norm{P(z_1,z_2)})$, where $P(z_1,z_2)$ is a polynomial that is not a power in $\CC[[z_1,z_2]]$, and $K$ is…

Viewing a bivariate polynomial f in R[x,t] as a family of univariate polynomials in t parametrized by real numbers x, we call f real rooted if this family consists of monic polynomials with only real roots. If f is the characteristic…

Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we…

In this paper we consider polynomial representability of functions defined over $Z_{p^n}$, where $p$ is a prime and $n$ is a positive integer. Our aim is to provide an algorithmic characterization that (i) answers the decision problem: to…

We introduce the notion of semi-characteristic polynomial for a semi-linear map of a finite- dimensional vector space over a field of characteristic p. This polynomial has some properties in common with the classical characteristic…

Let $A = K[x_1, ..., x_n]$ denote the polynomial ring in $n$ variables over a field $K$. We will classify all the Gotzmann ideals of $A$ with at most $n$ generators. In addition, we will study Hilbert functions $H$ for which all homogeneous…

Given a real cubic function $f(x)$ with three roots, take an equilateral triangle $ABC$, the projections of which vertices are the roots of $f(x)$. There is a folklore fact that the vertical lines through the extrema of $f(x)$ are tangent…

A continuous selection of polynomial functions is a continuous function whose domain can be partitioned into finitely many pieces on which the function coincides with a polynomial. Given a set of finitely many polynomials, we show that…

For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…

For a field $k$ of characteristic $0$, we present an algorithm for deciding if a morphism $\phi:k[X_1,...,X_m]\to k[X_1,...,X_m]$ has an inverse. The algorithm also shows how to find the inverse when it exists.

Given a compact set $K$ in the plane, which does not contain any triple of points forming a vertical and a horizontal segment, and a map $f\in C(K)$, we give a construction of functions $g,h\in C(\mathbb R)$ such that $f(x,y)=g(x)+h(y)$ for…

Let $F(t,u)\equiv F(u)$ be a formal power series in $t$ with polynomial coefficients in $u$. Let $F\_1, ..., F\_k$ be $k$ formal power series in $t$, independent of $u$. Assume all these series are characterized by a polynomial equation $$…

We study the class of functions on the set of (generalized) Young diagrams arising as the number of embeddings of bipartite graphs. We give a criterion for checking when such a function is a polynomial function on Young diagrams (in the…

We generalize a version of Lavrent\'ev's theorem which says that a function that is continuous on a compact set K with connected complement and without interior points can be uniformly approximated as closely as desired by a polynomial…

Modular composition is the problem of computing the coefficient vector of the polynomial $f(g(x)) \bmod h(x)$, given as input the coefficient vectors of univariate polynomials $f$, $g$, and $h$ over an underlying field $\mathbb{F}$. While…

Let $K$ be a field of characteristic 0, $f:\mathbb{N}\to K$ be a multiplicative function, and $F(z)=\sum_{n\geq 1} f(n)z^n\in K[[z]]$ be algebraic over $K(z)$. Then either there is a natural number $k$ and a periodic multiplicative function…

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…