Related papers: On square-free values of large polynomials over th…

In this paper, we obtain formulas for the number of representations of positive integers as sums of arbitrarily many squares (and other polygonal numbers) with a certain natural weighting. The resulting weighted sums give Fourier…

We study the polynomial functions on tensor states in $(C^n)^{\otimes k}$ which are invariant under $SU(n)^k$. We describe the space of invariant polynomials in terms of symmetric group representations. For $k$ even, the smallest degree for…

We prove a new upper bound for the number of smooth values of a polynomial with integer coefficients. This improves Timofeev's previous result unless the polynomial is a product of linear polynomials with integer coefficients. As an…

For a real polynomial $f$ we present explicit zero-free angular sectors in the complex plane, symmetric with respect to the real axis, with angles depending only on the degree of $f$, and vertices expressed in terms of the coefficients of…

Hazewinkel proved the Ditters conjecture that the algebra of quasisymmetric functions over the integers is free commutative by constructing a nice polynomial basis. In this paper we prove a structure theorem for the algebra of peak…

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…

Regarding polynomial functions on a subset $S$ of a non-commutative ring $R$, that is, functions induced by polynomials in $R[x]$ (whose variable commutes with the coefficients), we show connections between, on one hand, sets $S$ such that…

Let $k$ be a finite field, and $L$ be a $q$-linearized polynomial defined over $k$ of $q$-degree $r$ ($L=\sum^r_{i=0}a_iZ^{q^i}$, with $a_i\in k$). This paper provides an algorithm to compute a characteristic polynomial of $L$ over a large…

In this work, we consider the proportion of smooth (free of large prime factors) values of a binary form $F(X_1,X_2)\in\Z[X_1,X_2]$. In a particular case, we give an asymptotic equivalent for this proportion which depends on $F$. This is…

This paper investigates the location of the zeros of a sequence of polynomials generated by a rational function with a binomial-type denominator. We show that every member of a two-parameter family consisting of such generating functions…

We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact field $\mathbb{K}$. More precisely, given a precision $d$, and a polynomial $Q$ whose coefficients are power series in $x$, the…

Let f\in Z[x], deg(f)=3. Assume that f does not have repeated roots. Assume as well that, for every prime q, the inequality f(x)\not\equiv 0 mod q^2 has at least one solution in (Z/q^2 Z)^*. Then, under these two necessary conditions, there…

We study several related problems on polynomials with integer coefficients. This includes the integer Chebyshev problem, and the Schur problems on means of algebraic numbers. We also discuss interesting applications to approximation by…

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…

We estimate mixed character sums of polynomial values over elements of a finite field $\mathbb F_{q^r}$ with sparse representations in a fixed ordered basis over the subfield $\mathbb F_q$. First we use a combination of the…

In this paper, we shall precise the asymptotic behaviour of Newton polygons of $L$ functions associated to character sums, coming from some $n$ variable Laurent polynomials. In order to do this, we use the free sum on convex polytopes. This…

The paper addresses the calculation of correlation functions of permanental polynomials of matrices with random entries. By exploiting a convenient contour integral representation of the matrix permanent some explicit results are provided…

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

We prove an explicit upper bound on the number of real quadratic fields that admit a universal quadratic form of a given rank, thus establishing a density zero statement. More generally, we obtain such a result for totally positive definite…

An irreducible polynomial over $\Bbb F_q$ is said to be normal over $\Bbb F_q$ if its roots are linearly independent over $\Bbb F_q$. We show that there is a polynomial $h_n(X_1,\dots,X_n)\in\Bbb Z[X_1,\dots,X_n]$, independent of $q$, such…