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

Gaussian polynomial, which is also known as $q$-binomial coefficient, is one of the fundamental concepts in the theory of partitions. Zeilberger provided a combinatorial proof of Gaussian polynomial, which is called Algorithm Z by Andrews…

We investigate the rank of random (symmetric) sparse matrices. Our main finding is that with high probability, any dependency that occurs in such a matrix is formed by a set of few rows that contains an overwhelming number of zeros. This…

We prove a formula for the multidegrees of a rational map defined by generalized monomials on a projective variety, in terms of integrals over an associated Newton region. This formula leads to an expression of the multidegrees as volumes…

In a recent paper, the first author proved the log-concavity of the coefficients of the characteristic polynomial of a matroid realizable over a field of characteristic 0, answering a long-standing conjecture of Read in graph theory. We…

Over a decade ago De Loera, Haws and K\"oppe conjectured that Ehrhart polynomials of matroid polytopes have only positive coefficients and that the coefficients of the corresponding $h^*$-polynomials form a unimodal sequence. The first of…

In that paper, we prove that the composition of two roofs is another roof by using mapping cone of a morphism of cochain complexes.

In this paper we consider images of (ordinary) noncommutative polynomials on matrix algebras endowed with a graded structure. We give necessary and sufficient conditions to verify that some multilinear polynomial is a central polynomial, or…

It has been shown by Ibragimov and Zaporozhets [In Prokhorov and Contemporary Probability Theory (2013) Springer] that the complex roots of a random polynomial $G_n(z)=\sum_{k=0}^n\xi_kz^k$ with i.i.d. coefficients $\xi_0,\ldots,\xi_n$…

Let $\mathbb{K}$ be an algebraically closed field of characteristic zero and $\mathbb{K}[x,y]$ the polynomial ring. The group $\text{SL}_{2}\left(\mathbb{K}[x,y]\right)$ of all matrices with determinant equal to $1$ over $\mathbb{K}[x,y]$…

In~\cite{algorithmic} was given an algorithm that computes arithmetical structures on matrices. We use some of the ideas contained there to get an algorithm that computes arithmetical structures over dominated polynomials. A dominated…

The deep interconnection between linear algebra and graph theory allows one to interpret classical matrix invariants through combinatorial structures. To each square matrix A over a commutative ring K, one can associate a weighted directed…

In this elementary note we prove that a polynomial with rational coefficients divides the derivative of some polynomial which splits in $\Q$ if and only if all of its irrational roots are real and simple. This provides an answer to a…

We give a short proof of the log-concavity of the coefficients of the reduced characteristic polynomial of a matroid. The proof uses an extension of the theory of Lorentzian polynomials to convex cones, and reproves the Hodge-Riemann…

Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…

In this paper polynomial maps are represented by the use of matrices whose entries are numbered by pair of multiindices and a new product of such matrices is introduced. A matrix representation of composition of polynomial maps is given. In…

The classical matrix tree theorem relates the number of spanning trees of a connected graph with the product of the nonzero eigenvalues of its Laplacian matrix. The class of regular matroids generalizes that of graphical matroids, and a…

Using calculus we show how to prove some combinatorial inequalities of the type log-concavity or log-convexity. It is shown by this method that binomial coefficients and Stirling numbers of the first and second kinds are log-concave, and…

Vladimir Shpilrain and Jie-Tai Yu have asked for an effective algorithm to decide if two elements of C[x,y] are related by an automorphism of C[x,y]. We describe here an efficient algorithm that decides this question and finds the…

We discuss two realizations of the colored Jones polynomials of a knot, one from an unnoticed work of the second author in 1994 on quantum R-matrices at roots of unity obtained from solutions of the pentagon identity, and another one from…

Let $k$ be a field of characteristic zero and let $K=k(t)$ be the rational function field over $k$. In this paper we combine a formula of Ulmer for ranks of certain Jacobians over $K$ with strong upper bounds on endomorphisms of Jacobians…