English
Related papers

Related papers: Mixed Discriminants

200 papers

Polynomial algebra offers a standard approach to handle several problems in geometric modeling. A key tool is the discriminant of a univariate polynomial, or of a well-constrained system of polynomial equations, which expresses the…

Algebraic Geometry · Mathematics 2013-04-23 Alicia Dickenstein , Ioannis Emiris , Anna Karasoulou

We consider systems of Laurent polynomials with support on a fixed point configuration. In the non-defective case, the closure of the locus of coefficients giving a non-degenerate multiple root of the system is defined by a polynomial…

Algebraic Geometry · Mathematics 2023-02-07 Alicia Dickenstein , Sandra di Rocco , Ralph Morrison

We define the second discriminant $D_2$ of a univariate polynomial $f$ of degree greater than $2$ as the product of the linear forms $2\,r_k-r_i-r_j$ for all triples of roots $r_i, r_k, r_j$ of $f$ with $i<j$ and $j\neq k, k\neq i$. $D_2$…

Commutative Algebra · Mathematics 2019-09-24 Dongming Wang , Jing Yang

We give lower bounds for the degree of the discriminant with respect to y of separable polynomials f in K[x,y] over an algebraically closed field of characteristic zero. Depending on the invariants involved in the lower bound, we give a…

Algebraic Geometry · Mathematics 2015-07-07 Denis Simon , Martin Weimann

The R\'emond resultant attached to a multiprojective variety and a sequence of multihomogeneous polynomials is a polynomial form in the coefficients of the polynomials, which vanishes if and only if the polynomials have a common zero on the…

Commutative Algebra · Mathematics 2019-12-10 Luca Ghidelli

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…

Complex Variables · Mathematics 2017-04-04 Keisuke Uchimura

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…

Algebraic Geometry · Mathematics 2026-02-17 Vladislav Pokidkin

We consider the problem of complex root classification, i.e., finding the conditions on the coefficients of a univariate polynomial for all possible multiplicity structures on its complex roots. It is well known that such conditions can be…

Symbolic Computation · Computer Science 2024-09-11 Hoon Hong , Jing Yang

Cubic and quartic non-autonomous differential equations with continuous piecewise linear coefficients are considered. The main concern is to find the maximum possible multiplicity of periodic solutions. For many classes, we show that the…

Classical Analysis and ODEs · Mathematics 2010-10-01 Mohamad Ali Alwash

We present a formula for the degree of the discriminant of irreducible representations of a Lie group, in terms of the roots of the group and the highest weight of the representation. The proof uses equivariant cohomology techniques,…

Algebraic Geometry · Mathematics 2007-08-22 L. M. Feher , A. Nemethi , R. Rimanyi

Hidden-variable resultant methods are a class of algorithms for solving multidimensional polynomial rootfinding problems. In two dimensions, when significant care is taken, they are competitive practical rootfinders. However, in higher…

Numerical Analysis · Mathematics 2016-01-12 Vanni Noferini , Alex Townsend

We classify the discriminantly separable polynomials of degree two in each of three variables, defined by a property that all the discriminants as polynomials of two variables are factorized as products of two polynomials of one variable…

Dynamical Systems · Mathematics 2014-10-02 Vladimir Dragovic , Katarina Kukic

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…

Classical Analysis and ODEs · Mathematics 2024-04-15 Mikhail Chernyavsky , Andrei Lebedev , Yurii Trubnikov

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…

Commutative Algebra · Mathematics 2012-10-18 Laurent Busé , Jean-Pierre Jouanolou

Let L be a linear difference operator with polynomial coefficients. We consider singularities of L that correspond to roots of the trailing (resp. leading) coefficient of L. We prove that one can effectively construct a left multiple with…

Classical Analysis and ODEs · Mathematics 2007-05-23 S. A. Abramov , M. A. Barkatou , M. van Hoeij

The multivariate resultant is a fundamental tool of computational algebraic geometry. It can in particular be used to decide whether a system of n homogeneous equations in n variables is satisfiable (the resultant is a polynomial in the…

Computational Complexity · Computer Science 2013-02-12 Bruno Grenet , Pascal Koiran , Natacha Portier

We consider a certain mixed polynomial which is an extended Lens equation $L_{n,m}=\bar z^m-p(z)/q(z)$ with $\text{degree}\, q=n$, $\text{degree}\, p<n$ whose numerator is a mixed polynomial of degree $(n+m;n,m)$. Then we consider its…

Algebraic Geometry · Mathematics 2015-10-21 Mutsuo Oka

Using a certain Pick-type formula for the mixed volume of Cayley polyhedra, we compute the multiplicity of the isolated common zero of the maximal minors for a matrix of generic homogeneous polynomials of given degrees.

Combinatorics · Mathematics 2013-08-22 Alexander Esterov

The plane partition polynomial $Q_n(x)$ is the polynomial of degree $n$ whose coefficients count the number of plane partitions of $n$ indexed by their trace. Extending classical work of E.M. Wright, we develop the asymptotics of these…

Number Theory · Mathematics 2014-01-10 Robert Boyer , Daniel Parry

The multivariate resultant is a fundamental tool of computational algebraic geometry. It can in particular be used to decide whether a system of n homogeneous equations in n variables is satisfiable (the resultant is a polynomial in the…

Computational Complexity · Computer Science 2012-10-05 Bruno Grenet , Pascal Koiran , Natacha Portier
‹ Prev 1 2 3 10 Next ›