Related papers: Cyclic Resultants

For a suitable irreducible \textit{base} polynomial $f(x)\in \mathbf{Z}[x]$ of degree $k$, a family of polynomials $F_m(x)$ depending on $f(x)$ is constructed with the properties: (i) there is exactly one irreducible factor $\Phi_{d,f}(x)$…

For every polynomial f of degree n with no double roots, there is an associated family C(f) of harmonic algebraic curves, fibred over the circle, with at most n-1 singular fibres. We study the combinatorial topology of C(f) in the generic…

Let $\{f_{\lambda; j}\}_{\lambda\in V; 1\le j\le k}$ be families of holomorphic functions in the open unit disk $\Di\subset\Co$ depending holomorphically on a parameter $\lambda\in V\subset \Co^n$. We establish a Rolle type theorem for the…

Consider the Dirichlet-type space on the bidisk consisting of holomorphic functions $f(z_1,z_2):=\sum_{k,l\geq 0}a_{kl}z_1^kz_2^l$ such that $\sum_{k,l\geq 0}(k+1)^{\alpha_1} (l+1)^{\alpha_2}|a_{kl}|^2 <\infty.$ Here the parameters…

We provide a complete description of the ideal that serves as the resultant ideal for n univariate polynomials of degree d. We in particular describe a set of generators of this resultant ideal arising as maximal minors of a set of…

This paper investigates the number of monic integer polynomials of degree $n$ whose roots are all real and positive. We establish an asymptotic formula for the case of fixed trace by estimating the number of integer sequences satisfying…

This note is motivated by an old result of Kronecker on monic polynomials with integer coefficients having all their roots in the unit disc. We call such polynomials Kronecker polynomials for short. Let $k(n)$ denote the number of Kronecker…

We study the geometry, topology and Lebesgue measure of the set of monic conjugate reciprocal polynomials of fixed degree with all roots on the unit circle. The set of such polynomials of degree N is naturally associated to a subset of…

We estimate several probability distributions arising from the study of random, monic polynomials of degree $n$ with coefficients in the integers of a general $p$-adic field $K_{\mathfrak{p}}$ having residue field with $q= p^f$ elements. We…

The interplay among the time-evolution of the coefficients and the zeros of a generic time-dependent (monic) polynomial provides a convenient tool to identify certain classes of solvable dynamical systems. Recently this tool has been…

We fully classify completely multiplicative sequences which are given by generalised polynomial formulae, and obtain a similar result for (not necessarily completely) multiplicative sequences under the additional restriction that the…

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

We prove some functional equations involving the (classical) matching polynomials of path and cycle graphs and the $d$-matching polynomial of a cycle graph. A matching in a (finite) graph $G$ is a subset of edges no two of which share a…

This paper studies so-called "null polynomials modulo m", i.e., polynomials with integer coefficients that satisfy f(x)=0 (mod m) for any integer x. The study on null polynomials is helpful to reduce congruences of higher degrees modulo m…

The symmetric Macdonald polynomials are able to be constructed out of the non-symmetric Macdonald polynomials. This allows us to develop the theory of the symmetric Macdonald polynomials by first developing the theory of their non-symmetric…

Let $f_1,\dots,f_k\in\mathbb{R}[X]$ be polynomials of degree at most $d$ with $f_1(0)=\dots=f_k(0)=0$. We show that there is an integer $n<x$ such that the fractional parts $\|f_i(n)\|\ll x^{c/k}$ for all $1\le i\le k$ and for some constant…

We study graded connected algebras over a field of characteristic zero and give an explicit formula for the cyclic homology of a tensor algebra. By means of a slightly new definition of David Anick's notion "strongly free" we are able to…

Simple necessary and sufficient conditions for a $n$-tuple of noncommutative polynomials to be a cyclic gradient are given and similarly for a noncommutative polynomial to have a vanishing cyclic gradient. Connections with free probability…

We show that if a real trigonometric polynomial has few real roots, then the trigonometric polynomial obtained by writing the coefficients in reverse order must have many real roots. This is used to show that a class of random trigonometric…

We show that a monic univariate polynomial over a field of characteristic zero, with $k$ distinct non-zero known roots, is determined by its $k$ proper leading coefficients by providing an explicit algorithm for computing the multiplicities…