Related papers: Compatibility of Real-Rooted Polynomials with Mixe…
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…
The paper studies the question of existence of polynomials with given roots over associative non-commutative rings with identity. It is shown that in the case of an associative division ring for arbitrary n elements of this ring there…
We introduce the matching measure of a finite graph as the uniform distribution on the roots of the matching polynomial of the graph. We analyze the asymptotic behavior of the matching measure for graph sequences with bounded degree. A…
Each degree $n$ polynomial in one variable of the form $(x+1)(x^{n-1}+c_1x^{n-2}+\cdots +c_{n-1})$ is representable in a unique way as a Schur-Szeg\H{o} composition of $n-1$ polynomials of the form $(x+1)^{n-1}(x+a_i)$, see \cite{Ko1},…
In this paper we answer a question posed by C. A. Athanasiadis. Namely, we prove that the local $h$-polynomial of the $r$th edgewise subdivision of the $(n-1)$-dimensional simplex $2^V$ has only real zeros. In doing so we find a tool, using…
We give necessary and sufficient conditions for majorization of realrooted polynomials sharing a common interlacer by means of residues coming from fraction decomposition. We also introduce a motivated notion called strong majorization, and…
It is well-known that the coordinator polynomials of the classical root lattice of type $A_n$ and those of type $C_n$ are real-rooted. They can be obtained, either by the Aissen-Schoenberg-Whitney theorem, or from their recurrence…
We use the method of interlacing families of polynomials introduced to prove two theorems known to imply a positive solution to the Kadison--Singer problem. The first is Weaver's conjecture $KS_{2}$ \cite{weaver}, which is known to imply…
The well-known mathematical instrument for detection common roots for pairs of polynomials and multiple roots of polynomials are resultants and discriminants. For a pair of polynomials $f$ and $g$ their resultant $R(f,g)$ is a function of…
Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…
Student appreciation of a function is enhanced by understanding the graphical representation of that function. From the real graph of a polynomial, students can identify real-valued solutions to polynomial equations that correspond to the…
We provide a short proof of the theorem that every real multivariate polynomial has a symmetric determinantal representation, which was first proved in J. W. Helton, S. A. McCullough, and V. Vinnikov, Noncommutative convexity arises from…
In the present study, we propose necessary and sufficient assumptions on the coefficients in order to only get distinct real roots of polynomials.
We consider the computation of roots of polynomials expressed in the Chebyshev basis. We extend the QR iteration presented in [Eidelman, Y., Gemignani, L., and Gohberg, I., Numer. Algorithms, 47.3 (2008): pp. 253-273] introducing an…
One of basic difficulties of machine learning is handling unknown rotations of objects, for example in image recognition. A related problem is evaluation of similarity of shapes, for example of two chemical molecules, for which direct…
A graph is Schur-positive if its chromatic symmetric function expands nonnegatively in the Schur basis. All claw-free graphs are conjectured to be Schur-positive. We introduce a combinatorial object corresponding to a graph G, called a…
In this paper, we study functions of the roots of a univariate polynomial in which the roots have a given multiplicity structure $\mu$. Traditionally, root functions are studied via the theory of symmetric polynomials; we extend this theory…
A characteristic pair is a pair (G,C) of polynomial sets in which G is a reduced lexicographic Groebner basis, C is the minimal triangular set contained in G, and C is normal. In this paper, we show that any finite polynomial set P can be…
In 1982 Macdonald published his now famous constant term conjectures for classical root systems. This paper begins with the almost trivial observation that Macdonald's constant term identities admit an extra set of free parameters, thereby…
Motivated by an observation of Dehornoy, we study the roots of Alexander polynomials of knots and links that are closures of positive 3-strand braids. We give experimental data on random such braids and find that the roots exhibit marked…