Related papers: On a paper by Y.G.Zarhin

This paper is concerned with the factorization and equivalence problems of multivariate polynomial matrices. We present some new criteria for the existence of matrix factorizations for a class of multivariate polynomial matrices, and obtain…

Previous analyses of Laguerre's method have provided results on the convergence and properties of this popular method when applied to the polynomials $p_n(z)=z^n-1$, $n\in\mathbb{N}$. While these analyses appear to provide a fairly complete…

J.P. Levine showed that the Conway polynomial of a link is a product of two factors: one is the Conway polynomial of a knot which is obtained from the link by banding together the components; and the other is determined by the…

We study a class of polynomials that has all of its roots on the critical line and shares many properties with Ehrhart polynomials. Braun showed that the roots of Ehrhart polynomials are bounded quadratically and Higashitani provided…

The solution of equations from the title is well known since the Euler's time. However, its proof in the case of multiple roots of the characteristic polynomial is rather long and technical and even appearance of the factors $x^m$ looks…

By the classical Sturm's theorem, the number of distinct real roots of a given real polynomial $f(x)$ within any interval $(a,b]$ can be expressed by the number of variations in the sign of the Sturm chain at the bounds. Through…

We give necessary and sufficient conditions, in the form of matrix identities, for a polynomial f in C[X,Y] to be a component of a polynomial automorphism of C^2 and to be a component of a Keller polynomial mapping of C^2, respectively…

We introduce a new family of higher-rank graphs, whose construction was inspired by the graphical techniques of Lambek \cite{Lambek} and Johnstone \cite{Johnstone} used for monoid and category emedding results. We show that they are planar…

Using polynomial evaluation, we give some useful criteria to answer questions about divisibility of polynomials. This allows us to develop interesting results concerning the prime elements in the domain of coefficients. In particular, it is…

We introduce a class of polynomial maps that we call polynomial roots of powerseries, and show that automorphisms with this property generate the automorphism group in any dimension. In particular we determine generically which polynomial…

Let $p(n)$ denote the number of partitions of a natural number $n$. As $ n \to \infty$, the $n$th root of $p(n)$ tends to $1$, which is related to the Cauchy--Hadamard test for power series. Andrews also discovered an elementary proof. Sun…

Let G be a finite connected graph. The Kirchhoff polynomial of G is a certain homogeneous polynomial whose degree is equal to the first betti number of G. These polynomials appear in the study of electrical circuits and in the evaluation of…

We review the X = K conjecture and important ingredients for the proof. We also attach notes on the rank estimate for the X = K theorem to hold and on the strange relation that was found to be valid without the assumption that the rank is…

Theorem 1 is a formula expressing the mean number of real roots of a random multihomogeneous system of polynomial equations as a multiple of the mean absolute value of the determinant of a random matrix. Theorem 2 derives closed form…

The Jacobian Conjecture would follow if it were known that real polynomial maps with a unipotent Jacobian matrix are injective. The conjecture that this is true even for $C^1$ maps is explored here. Some results known in the polynomial case…

Theory of motivic superpolynomials is developed, including its extension to algebraic links colored by rows, relations to $L$-functions of plane curve singularities, the justification of the motivic versions of Weak Riemann Hypothesis, and…

Let $K$ be a number field, let $g \geq 1$ be an integer and let $f(x) = (x - a_1) \cdots (x - a_{2g + 1}) \in O_K[x]$ be a polynomial that splits into $2g + 1$ distinct linear factors. Write $C$ for the hyperelliptic curve given by $C: y^2…

By the work of Ferroni and Larson, Kazhdan-Lusztig polynomials and Z-polynomials of complete graphs have combinatorial interpretations in terms of quasi series-parallel matroids. We provide explicit formulas for the number of…

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…

Let $f,g\in Z[X]$ be monic polynomials of degree $n$ and let $C,D\in M_n(Z)$ be the corresponding companion matrices. We find necessary and sufficient conditions for the subalgebra $Z< C,D>$ to be a sublattice of finite index in the full…