Related papers: Counting integers representable as images of polyn…

We formulate several polynomial identities. One side of these identities has a nice simple form. Whereas the other has a form of a polynomial whose coefficients contain binomial coefficients double factorials or (and) rising factorials. The…

We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(n D kappa(f)) iterations where n is the number of polynomials (as well as the dimension of the ambient space), D…

Let $f$ be a half-integral weight cusp form of level $4N$ for odd and squarefree $N$ and let $a(n)$ denote its $n^{\rm th}$ normalized Fourier coefficient. Assuming that all the coefficients $a(n)$ are real, we study the sign of $a(n)$ when…

Denote by $\tau$ k (n), $\omega$(n) and $\mu$ 2 (n) the number of representations of n as product of k natural numbers, the number of distinct prime factors of n and the characteristic function of the square-free integers, respectively. Let…

Suppose $f : [0,1]^2 \rightarrow \mathbb{R}$ is a $(c,\alpha)$-mixed H\"older function that we sample at $l$ points $X_1,\ldots,X_l$ chosen uniformly at random from the unit square. Let the location of these points and the function values…

Let X be an analytic set defined by polynomials whose coefficients a_1,...,a_s are holomorphic functions. We formulate conditions such that for all sequences {a_(1,n)},...,{a_(s,n)} of holomorphic functions converging locally uniformly to…

Computer algebra systems are really good at factoring polynomials, i.e. writing f as a product of irreducible factors. It is relatively easy to verify that we have a factorisation, but verifying that these factors are irreducible is a much…

This paper investigates coefficients of cyclotomic polynomials theoretically and experimentally. We prove the following result. {{\em If $n=p_1\ldots p_k$ where $p_i$ are odd primes and $p_1<p_2<\ldots<p_r<p_1+p_2<p_{r+1}<\ldots<p_t$ with…

Commutative complex numbers of the form u=x+\alpha y+\beta z+\gamma t in 4 dimensions are studied, the variables x, y, z and t being real numbers. Four distinct types of multiplication rules for the complex bases \alpha, \beta and \gamma…

Let $f_n$ be a random polynomial of degree $n$, whose coefficients are independent and identically distributed random variables with mean-zero and variance one. Let $\Delta(f_n)$ denote the discriminant of $f_n$, that is $\Delta(f_n) =…

We describe a congruence property of solvable polynomials over Q, based on the irreducibility of cyclotomic polynomials over number fields that meet certain conditions.

Let $ \mathbb{Q}\mathcal{E}_{\mathbb{Z}} $ be the set of power sums whose characteristic roots belong to $ \mathbb{Z} $ and whose coefficients belong to $ \mathbb{Q} $, i.e. $ G : \mathbb{N} \rightarrow \mathbb{Q} $ satisfies…

We consider orthogonal polynomials with respect to the weight $|z^2+a^2|^{cN}e^{-N|z|^2}$ in the whole complex plane. We obtain strong asymptotics and the limiting normalized zero counting measure (mother body) of the orthogonal polynomials…

If a multiplicative function $f$ is commutable with a quadratic form $x^2+xy+y^2$, i.e., \[ f(x^2+xy+y^2) = f(x)^2 + f(x)\,f(y) + f(y)^2, \] then $f$ is the identity function. In other hand, if $f$ is commutable with a quadratic form…

Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…

The polynomials that arise as coefficients when a power series is raised to the power $x$ include many important special cases, which have surprising properties that are not widely known. This paper explains how to recognize and use such…

For a large integer $m,$ we obtain an asymptotic formula for the number of solutions of a certain congruence modulo $m$ with four variables, where the variables belong to special sets of residue classes modulo $m.$ This formula are applied…

Let $\A$ be an algebra and let $f(x_1,...,x_d)$ be a multilinear polynomial in noncommuting indeterminates $x_i$. We consider the problem of describing linear maps $\phi:\A\to \A$ that preserve zeros of $f$. Under certain technical…

A sum-of-squares is a polynomial that can be expressed as a sum of squares of other polynomials. Determining if a sum-of-squares decomposition exists for a given polynomial is equivalent to a linear matrix inequality feasibility problem.…

Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. In this paper, an effective algorithm is presented for computing the…