Mixed Discriminants
نویسندگان
چکیده
The mixed discriminant of n Laurent polynomials in n variables is the irreducible polynomial in the coefficients which vanishes whenever two of the roots coincide. The Cayley trick expresses the mixed discriminant as an A-discriminant. We show that the degree of the mixed discriminant is a piecewise linear function in the Plücker coordinates of a mixed Grassmannian. An explicit degree formula is given for the case of plane curves. Dedicated to the memory of our friend Mikael Passare (1959–2011)
منابع مشابه
An efficient tree decomposition method for permanents and mixed discriminants
We present an efficient algorithm to compute permanents, mixed discriminants and hyperdeterminants of structured matrices and multidimensional arrays (tensors). We describe the sparsity structure of an array in terms of a graph, and we assume that its treewidth, denoted as ω, is small. Our algorithm requires Õ(n 2) arithmetic operations to compute permanents, and Õ(n + n 3) for mixed discrimina...
متن کاملA characterization of the mixed discriminant
The striking analogy between mixed volumes of convex bodies and mixed discriminants of positive semidefinite matrices has repeatedly been observed. It was A. D. Aleksandrov [1] who, in his second proof of the Aleksandrov–Fenchel inequalities for the mixed volumes, first introduced the mixed discriminants of positive semidefinite quadratic forms and established some of their properties, includin...
متن کاملPlane mixed discriminants and toric jacobians
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 existence of a multiple root. We describe discriminants in a general context, and focus on exploiting the sparseness of polynomials via the theory of Newton polytope...
متن کاملPolynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor
We present real, complex, and quaternionic versions of a simple ran-domized polynomial time algorithm to approximate the permanent of a non-negative matrix and, more generally, the mixed discriminant of positive semideenite matrices. The algorithm provides an unbiased estimator, which, with high probability, approximates the true value within a factor of O(c n), where n is the size of the matri...
متن کاملRelative Manin-Mumford for semi-abelian surfaces
We show that Ribet sections are the only obstruction to the validity of the relative Manin-Mumford conjecture for one dimensional families of semi-abelian surfaces. Applications include special cases of the Zilber-Pink conjecture for curves in a mixed Shimura variety of dimension four, as well as the study of polynomial Pell equations with non-separable discriminants.
متن کاملCayley-Hamilton Theorem for mixed discriminants
The mixed discriminant of an n-tuple of n×n matrices A1, . . . , An is defined as D(A1, A2, . . . , An) = 1 n! ∑ σ∈S(n) det(A (1) σ(1), A (2) σ(2), . . . , A (n) σ(n)), where A denotes the ith column of the matrix A and S(n) denotes the group of permutations of 1, 2, . . . , n. For n matrices A1, ..., An and indeterminates λ1, . . . , λn, set Φλ1,...,λn(A1, ..., An) = D(λ1I −A1, ..., λnI −An). ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1112.1012 شماره
صفحات -
تاریخ انتشار 2011