Related papers: On discriminants of polylinear forms

We propose a method for constructing systems of polynomial equations that define submanifolds of degenerate binary forms of an arbitrary degeneracy degree. It is appropriate to call these systems of equations "higher discriminants".

We introduce the general polynomial algebras characterizing a class of higher order superintegrable systems that separate in Cartesian coordinates. The construction relies on underlying polynomial Heisenberg algebras and their defining…

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…

Here we develop a technique of computing the invariants of $n-$ary forms and systems of forms using the discriminants of corresponding multilinear forms built of their partial derivatives, which should be cosidered as analogues of classical…

We are concerned with the problem of decomposing the parameter space of a parametric system of polynomial equations, and possibly some polynomial inequality constraints, with respect to the number of real solutions that the system attains.…

The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…

This write-up contains some minor results and notes related to our work [HQ15] (some of them already known in the literature). In particular, it shows the following: - We show that a graph with polynomial expansion have sublinear…

A recurring task in particle physics and statistics is to compute the complex critical points of a product of powers of affine-linear functions. The logarithmic discriminant characterizes exponents for which such a function has a degenerate…

We study questions of multiplicities of discriminants for degenerations coming from projective duality over discrete valuation rings. The main result is a type of discriminant-different formula in the sense of classical algebraic number…

We present a spectral theory of hypergraphs that closely parallels Spectral Graph Theory. A number of recent developments building upon classical work has led to a rich understanding of "hyperdeterminants" of hypermatrices, a.k.a.…

This paper gives a geometric interpretation of the notion of quasi-symmetric representation and uses this to show that the discriminant locus associated to such a representation is a hyperplane arrangement. Moreover, we identify this…

We propose a novel algebraic framework for treating probability distributions represented by their cumulants such as the mean and covariance matrix. As an example, we consider the unsupervised learning problem of finding the subspace on…

Integral discriminants provide a simple and fundamental model for non-Gaussian integrals, associated with homogeneous polynomials of degree r in n variables. We argue that, in this context, the study of correlators is equally if not more…

We present a general method for computing discriminants of noncommutative algebras. It builds a connection with Poisson geometry and expresses the discriminants as products of Poisson primes. The method is applicable to algebras obtained by…

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…

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…

We identify a common scheme in several existing algorithms addressing computational problems on linear differential equations with polynomial coefficients. These algorithms reduce to computing a linear relation between vectors obtained as…

Let $K$ be a field. In this article, we derive a formula for the discriminant of a sequence $\{r_{A,n}+c r_{A,n-1}\}$ of polynomials. Here, $c \in K$ and $\{r_{A,n} \}$ is a sequence of polynomials satisfying a certain recurrence relation…

Concise introduction to a relatively new subject of non-linear algebra: literal extension of text-book linear algebra to the case of non-linear equations and maps. This powerful science is based on the notions of discriminant…

In this paper, we consider the problem of representing a multivariate polynomial as the determinant of a definite (monic) symmetric/Hermitian linear matrix polynomial (LMP). Such a polynomial is known as determinantal polynomial.…