A Concise Proof of the Kronecker Polynomial System Solver from Scratch
نویسنده
چکیده
Nowadays polynomial system solvers are involved in sophisticated computations in algebraic geometry as well as in practical engineering. The most popular algorithms are based on Gröbner bases, resultants, Macaulay matrices, or triangular decompositions. In all these algorithms, multivariate polynomials are expanded in a monomial basis, and the computations mainly reduce to linear algebra. The major drawback of these techniques is the exponential explosion of the size of the polynomials needed to represent highly positive dimensional solution sets. Alternatively, the “Kronecker solver” uses data structures to represent the input polynomials as the functions that compute their values at any given point. In this paper we present the first self-contained and student friendly version of the Kronecker solver, with a substantially simplified proof of correctness. In addition, we enhance the solver in order to compute the multiplicities of the zeros without any extra cost.
منابع مشابه
?-Independent and Dissociate Sets on Compact Commutative Strong Hypergroups
In this paper we define ?-independent (a weak-version of independence), Kronecker and dissociate sets on hypergroups and study their properties and relationships among them and some other thin sets such as independent and Sidon sets. These sets have the lacunarity or thinness property and are very useful indeed. For example Varopoulos used the Kronecker sets to prove the Malliavin theorem. In t...
متن کامل1 7 O ct 2 00 8 REDUCED KRONECKER COEFFICIENTS AND COUNTER – EXAMPLES TO MULMULEY ’ S SATURATION CONJECTURE
We provide counter–examples to Mulmuley’s SH conjecture for the Kronecker coefficients. This conjecture was proposed in the setting of Geometric Complexity Theory to show that deciding whether or not a Kronecker coefficient is zero can be done in polynomial time. We also provide a short proof of the #P–hardness of computing the Kronecker coefficients. Both results rely on the connections betwee...
متن کاملReduced Kronecker Coefficients and Counter–examples to Mulmuley’s Strong Saturation Conjecture Sh with an Appendix by Ketan Mulmuley Emmanuel Briand, Rosa Orellana, and Mercedes Rosas
We provide counter–examples to Mulmuley’s strong saturation conjecture (strong SH) for the Kronecker coefficients. This conjecture was proposed in the setting of Geometric Complexity Theory to show that deciding whether or not a Kronecker coefficient is zero can be done in polynomial time. We also provide a short proof of the #P–hardness of computing the Kronecker coefficients. Both results rel...
متن کاملDecompositional Analysis of Kronecker Structured Markov Chains
This contribution proposes a decompositional iterative method for the steadystate analysis of Kronecker structured Markov chains [1]. The Markovian system, which is formed by a composition of subsystems using the Kronecker sum operator for local transitions and the Kronecker product operator for synchronized transitions, is assumed to have irreducible subsystem matrices associated with local tr...
متن کاملON AN INDEPENDENT RESULT USING ORDER STATISTICS AND THEIR CONCOMITANT
Let X1;X2;...;Xn have a jointly multivariate exchangeable normal distribution. In this work we investigate another proof of the independence of X and S2 using order statistics. We also assume that (Xi ; Yi); i =1; 2;...; n; jointly distributed in bivariate normal and establish the independence of the mean and the variance of concomitants of order statistics.
متن کامل