Related papers: Polynomial maps on vector spaces over a finite fie…

Let $\mu$ be a probability measure with an infinite compact support on $\mathbb{R}$. Let us further assume that $(F_n)_{n=1}^\infty$ is a sequence of orthogonal polynomials for $\mu$ where $(f_n)_{n=1}^\infty$ is a sequence of nonlinear…

Consider a system F of n polynomials in n variables, with a total of n+k distinct exponent vectors, over any local field L. We discuss conjecturally tight bounds on the maximal number of non-degenerate roots F can have over L, with all…

Consider the gradient map associated to any non-constant homogeneous polynomial $f\in \C[x_0,...,x_n]$ of degree $d$, defined by \[\phi_f=grad(f): D(f)\to \CP^n, (x_0:...:x_n)\to (f_0(x):...:f_n(x))\] where $D(f)=\{x\in \CP^n; f(x)\neq 0\}$…

Let ${\mathbb{F}_{q}}$ be the finite field of order $q$. Let $G$ be one of the three groups ${\rm GL}(n, \mathbb{F}_q)$, ${\rm SL}(n, \mathbb{F}_q)$ or ${\rm U}(n, \mathbb{F}_q)$ and let $W$ be the standard $n$-dimensional representation of…

In this sequence of work we investigate polynomial equations of additive functions. We consider the solutions of equation \[ \sum_{i=1}^{n}f_{i}(x^{p_{i}})g_{i}(x)^{q_{i}}= 0 \qquad \left(x\in \mathbb{F}\right), \] where $n$ is a positive…

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…

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}…

Over an algebraically closed field $\mathbb{F}$ of zero characteristic polynomial map $\xi: \mathbb{F}^n\rightarrow \mathbb{F}^n$ of the form $\xi(x)=x-((xA_1)^{3}, (xA_2)^{3},..., (xA_n)^{3})$, where $x=(x_1,x_2,...,x_n)$ a row vector of…

We present an algorithmic equivalent statement to the Jacobian conjecture. Given a polynomial map F on an affine space of dimension n, our algorithm constructs n sequences of polynomials such that F is invertible if and only if the zero…

For n=1,2,3,... let N_n(q) denote the number of monic irreducible polynomials over the finite field F_q. We mainly show that the sequence N_n(q)^{1/n} (n>e^{3+7/(q-1)^2}) is strictly increasing and the sequence…

Let $\mathbb{F}_{q}$ be the finite field of characteristic $p$ containing $q = p^{r}$ elements and $f(x)=ax^{n} + x^{m}$ a binomial with coefficients in this field. If some conditions on the gcd of $n-m$ an $q-1$ are satisfied then this…

Investigating a problem posed by W. Hengartner (2000), we study the maximal valence (number of preimages of a prescribed point in the complex plane) of logharmonic polynomials, i.e., complex functions that take the form $f(z) = p(z)…

Let K be F_q((T)), or more generally any field of characteristic p equipped with a valuation having a finite residue field of q elements. Then a polynomial f(x) in K[x] having k+1 nonzero coefficients has at most q^k distinct zeros in K. We…

We show that if $f : \mathbb{A}_{\bar{\mathbb{Q}}}^r \to \mathbb{A}_{\bar{\mathbb{Q}}}^r$ is a regular self-map and $P \in \mathbb{A}^r(\bar{\mathbb{Q}})$ has $\limsup_{n \in \mathbb{N}} \frac{\log{h_{\mathrm{aff}}(f^nP)}}{\log{n}} < 1/r$,…

We give an explicit characterization of all minimal value set polynomials in $\F_q[x]$ whose set of values is a subfield $\F_{q'}$ of $\F_{q}$. We show that the set of such polynomials, together with the constants of $\F_{q'}$, is an…

If E is a locally convex topological vector space, let P(E) be the pre-ordered set of all continuous seminorms on E. We study, on the one hand, for g an infinite cardinal those locally convex spaces E which have the g-neighbourhood property…

We generalize an approach from a 1960 paper by Ljunggren, leading to a practical algorithm that determines the set of $N > \operatorname{deg}(c) + \operatorname{deg}(d)$ such that the polynomial $$f_N(x) = x^N c(x^{-1}) + d(x)$$ is…

We show that the proportion of polynomials of degree $n$ over the finite field with $q$ elements, which have a divisor of every degree below $n$, is given by $c_q n^{-1} + O(n^{-2})$. More generally, we give an asymptotic formula for the…

For any two integers $k,n$, $2\leq k\leq n$, let $f:(\mathbb{C}^*)^n\rightarrow\mathbb{C}^k$ be a generic polynomial map with given Newton polytopes. It is known that points, whose fiber under $f$ has codimension one, form a finite set…

The best uniform polynomial approximation of the checkmark function $f(x)=|x-\alpha |$ is considered, as $\alpha$ varies in $(-1,1)$. For each fixed degree $n$, the minimax error $E_n (\alpha)$ is shown to be piecewise analytic in $\alpha$.…