Related papers: Polynomial Coefficient Enumeration

Following the author's previous works, we continue to consider the problem of counting the number of affine conjugacy classes of polynomials of one complex variable when its unordered collection of holomorphic fixed point indices is given.…

Let F be a homogeneous real polynomial of even degree in any number of variables. We consider the problem of giving explicit conditions on the coefficients so that F is positive definite or positive semi-definite. In this note we produce a…

We consider the class of polynomial optimization problems $\inf \{f(x):x\in K\}$ for which the quadratic module generated by the polynomials that define $K$ and the polynomial $c-f$ (for some scalar $c$) is Archimedean. For such problems,…

The relationship between a polynomial's zeros and factors is well known. If a is a zero of f(x) then (x-a) is a factor of f(x). In this paper, we generalize this idea to polynomials of two variables and with real coefficients. We consider…

Let $f(X_1,\dots, X_n)$ be a nonzero multilinear noncommutative polynomial. If $A$ is a unital algebra with a surjective inner derivation, then every element in $A$ can be written as $f(a_1,\dots,a_n)$ for some $a_i\in A$.

The following result, a consequence of Dumas criterion for irreducibility of polynomials over integers, is generally proved using the notion of Newton diagram: Let $f(x)$ be a polynomial with integer coefficients and $k$ be a positive…

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…

In [arXiv 0811.3913] the authors introduced the notion of quasi-polynomial function as being a mapping f: X^n -> X defined and valued on a bounded chain X and which can be factorized as f(x_1,...,x_n)=p(phi(x_1),...,phi(x_n)), where p is a…

We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…

Let k be a field of characteristic not 2, let q be a quadratic space over k and let f be an irreducible polynomial with coefficients in k. In 1969, Milnor raised the following question : how can we decide whether q has an isometry with…

We define tensors, corresponding to cubic polynomials, which have the same exponent $\omega$ as the matrix multiplication tensor. In particular, we study the symmetrized matrix multiplication tensor $sM_n$ defined on an $n\times n$ matrix…

We present the formula for the number of monic irreducible polynomials of degree $n$ over the finite field $\mathbb F_q$ where the coefficients of $x^{n-1}$ and $x$ vanish for $n\ge3$. In particular, we give a relation between rational…

Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a…

Suppose $F$ is an infinite field and let $f \in F\{X_1, \dots,X_m\}$ be a noncommutative polynomial. Partially answering a query of Makar-Limanov, we show that there are numbers $d$ and $m'$ such that, if $F$ is closed under taking $d$th…

For a polynomial $f(x)\in \mathbb Z[x]$ we study an analogue of Jacobsthal function, defined by the formula \[ j_f(N)=\max_{m}\{\text{For some } x\in \mathbb N \text{ the inequality } (x+f(i),N)>1 \text{ holds for all }i\leq m\}. \] We…

For any positive integer $n$ along with parameters $\alpha$ and $\nu$, we define and investigate $\alpha$-shifted, $\nu$-offset, floor sequences of length $n$. We find exact and asymptotic formulas for the number of integers in such a…

The polynomial coefficient $\binom {n,q}{k}$ is defined to be the coefficient of $x^{k}$ in the expansion of $(1+x+x^2+... +x^{q-1})^n$. In this note we give an asymptotic estimate for $\binom {n,q}{cn}$ as $n$ tends to infinity, where $c$…

An integer-valued multiplicative function $f$ is said to be polynomially-defined if there is a nonconstant separable polynomial $F(T)\in \mathbb{Z}[T]$ with $f(p)=F(p)$ for all primes $p$. We study the distribution in coprime residue…

Taking a combinatorial point of view on cyclotomic polynomials leads to a larger class of polynomials we shall call the inclusion-exclusion polynomials. This gives a more appropriate setting for certain types of questions about the…

In this paper, we give some results on closed polynomials and factorially closed polynomial in $n$ variables. In particular, we give a characterization of factorially closed polynomials in $n$ variables over an algebraically closed field…