Related papers: Some facts about discriminants

In this paper, the discriminant of homogeneous polynomials is studied in two particular cases: a single homogeneous polynomial and a collection of n-1 homogeneous polynomials in n variables. In these two cases, the discriminant is defined…

For the family $P:=x^n+a_1x^{n-1}+\cdots +a_n$ of complex polynomials in the variable $x$ we study its {\em discriminant} $R:=$Res$(P,P',x)$, $R\in \mathbb{C}[a]$, $a=(a_1,\ldots ,a_n)$. When $R$ is regarded as a polynomial in $a_k$, one…

For the family of polynomials in one variable $P:=x^n+a_1x^{n-1}+\cdots +a_n$, $n\geq 4$, we consider its higher-order discriminant sets $\{ \tilde{D}_m=0\}$, where $\tilde{D}_m:=$Res$(P,P^{(m)})$, $m=2$, $\ldots$, $n-2$, and their…

Let $F(X,Y)=Y^d+a_1(X)Y^{d-1}+...+a_d(X)$ be a polynomial in $n+1$ variables $(X,Y)=(X_1,...,X_n,Y)$ with coefficients in an algebraically closed field K. Assuming that the discriminant $D(X)=\disc_Y F(X,Y)$ is nonzero we investigate the…

What polynomial in the coefficients of a system of algebraic equations should be called its discriminant? We prove a package of facts that provide a possible answer. Let us call a system typical, if the homeomorphic type of its set of…

We consider the family of polynomials $P(x,a)=x^n+a_1x^{n-1}+... +a_n$, $x,a_i\in {\bf R}$, and the stratification of ${\bf R}^n\cong \{(a_1,... ,a_n)|a_i\in {\bf R}\}$ defined by the multiplicity vector of the real roots of $P$. We prove…

A polynomial is said to be unimodal if its coefficients are non-decreasing and then non-increasing. The domination polynomial of a graph $G$ is the generating function of the number of domination sets of each cardinality in $G$, and its…

This paper investigates the stratification of the discriminant hypersurface associated with a univariate polynomial via the number of its distinct complex roots. We introduce two novel approaches different from the one based on…

We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…

The discriminant of a multivariate polynomial with indeterminate coefficients is not necessarily a hypersurface, and characterizing its codimension was an open problem for quite a while. We resolve this problem for the discriminants of…

A class of self-inversive polynomials includes all the self-reciprocal polynomials. Let A denote the set of all self-reciprocal polynomials with n+1 coefficients. Let B denote the set of certain self-inversive and non self-reciprocal…

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…

Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…

We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…

We consider real monic {\em hyperbolic} polynomials in one real variable, i.e. polynomials having only real roots. Call {\em hyperbolicity domain} $\Pi$ of the family of polynomials $P(x,a)=x^n+a_1x^{n-1}+... +a_n$, $a_i,x\in {\bf R}$, the…

A dominating set of a graph is a set of vertices such that every vertex not in the set has at least one neighbor in the set. The problem of counting dominating sets is #P-complete for chordal graphs but solvable in polynomial time for its…

Given a system of n homogeneous polynomials in n variables which is equivariant with respect to the canonical actions of the symmetric group of n symbols on the variables and on the polynomials, it is proved that its resultant can be…

The independence polynomial $I(G, x)$ of a graph $G$ is the polynomial in variable $x$ in which the coefficient $a_n$ on $x^n$ gives the number of independent subsets $S \subseteq V(G)$ of vertices of $G$ such that $|S| = n$. $I(G, x)$ is…

The hyperdeterminant of a polynomial (interpreted as a symmetric tensor) factors into several irreducible factors with multiplicities. Using geometric techniques these factors are identified along with their degrees and their…

In this article, we compile the work done by various mathematicians on the topic of the fixed divisor of a polynomial. This article explains most of the results concisely and is intended to be an exhaustive survey. We present the results on…