Related papers: Polynomial functions as splines

Let $k$ be a field, $V$ a $k$-vector space and $X$ be a subset of $V $. A function $f:X\to k$ is weakly polynomial of degree $\leq a$, if the restriction of $f$ on any affine subspace $L\subset X$ is a polynomial of degree $\leq a$. In this…

Let $V$ be a vector space over a field $k, P:V\to k, d\geq 3$. We show the existence of a function $C(r,d)$ such that $rank (P)\leq C(r,d)$ for any field $k,char (k)>d$, a finite-dimensional $k$-vector space $V$ and a polynomial $P:V\to k$…

We study the problem of testing whether a function $f: \mathbb{R}^n \to \mathbb{R}$ is a polynomial of degree at most $d$ in the \emph{distribution-free} testing model. Here, the distance between functions is measured with respect to an…

For a function field $K$ and fixed polynomial $F\in K[x]$ and varying $f\in F$ (under certain restrictions) we give a lower bound for the degree of the greatest prime divisor of $F(f)$ in terms of the height of $f$, establishing a strong…

We use tools of additive combinatorics for the study of subvarieties defined by {\it high rank} families of polynomials in high dimensional $\mathbb{F} _q$-vector spaces. In the first, analytic part of the paper we prove a number properties…

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…

Let $k$ be a field, $V$ be a $k$-vector space and $X\subset V$ an algebraic irreducible subvariety. We say that a function $f:X(k) \to k$ is weakly linear if its restriction to any two-dimensional linear subspace $W$ of $V$ contained in $X$…

For a polynomial map $\mathbf{f} : k^n \to k^m$ ($k$ a field), we investigate those polynomials $g \in k[t_1,\ldots, t_n]$ that can be written as a composition $g = h \circ \mathbf{f}$, where $h: k^m \to k$ is an arbitrary function. In the…

Polynomial representations of Boolean functions over various rings such as $\mathbb{Z}$ and $\mathbb{Z}_m$ have been studied since Minsky and Papert (1969). From then on, they have been employed in a large variety of fields including…

Let k be an algebraically closed field of characteristic zero. An element F from k(x_1,...,x_n) is called a closed rational function if the subfield k(F) is algebraically closed in the field k(x_1,...,x_n). We prove that a rational function…

In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…

Let $f:\mathbb{K}^n\rightarrow\mathbb{K}^m$ be a generically finite polynomial map of degree $d$ between affine spaces. In arXiv:1411.5011 we proved that if $\mathbb{K}$ is the field of complex or real numbers, then the set $S_f$ of points…

Multi-degree splines are piecewise polynomial functions having sections of different degrees. They offer significant advantages over the classical uniform-degree framework, as they allow for modeling complex geometries with fewer degrees of…

The algebraic degree is an important parameter of Boolean functions used in cryptography. When a function in a large number of variables is not given explicitly in algebraic normal form, it might not be feasible to compute its degree.…

We prove a version of both Jacobi's and Montel's Theorems for the case of continuous functions defined over the field $\mathbb{Q}_p$ of $p$-adic numbers. In particular, we prove that, if \[ \Delta_{h_0}^{m+1}f(x)=0 \ \ \text{for all}…

We study the behaviour of the algebraic degree of vectorial Boolean functions when their inputs are restricted to an affine subspace of their domain. Functions which maintain their degree on all subspaces of as high a codimension as…

Given a polynomial P in several variables over an algebraically closed field, we show that except in some special cases that we fully describe, if one coefficient is allowed to vary, then the polynomial is irreducible for all but at most…

Given a polynomial function $f \colon \mathbb{R}^n \rightarrow \mathbb{R}$ and a unbounded basic closed semi-algebraic set $S \subset \mathbb{R}^n,$ in this paper we show that the conditions listed below are characterized exactly in terms…

We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…

Let $p$ be a prime, let $1 \le t < d < p$ be integers, and let $S$ be a non-empty subset of $\mathbb{F}_p$. We establish that if a polynomial $P:\mathbb{F}_p^n \to \mathbb{F}_p$ with degree $d$ is such that the image $P(S^n)$ does not…