Decomposition of multihomogeneous polynomials: minimal number of variables
نویسنده
چکیده
In this paper, we generalize Hironaka’s invariants, the ridge and the directrix, of homogeneous ideals, to multihomogeneous ideals. These invariants are the minimal number of additive polynomials or linear forms to write a given ideal. We design algorithms to compute both these invariants which make use of the multihomogeneous structure of the ideal and study their complexities depending on the number of blocks of variables, the number of variables in each block and the degree of the polynomials spanning the considered ideal. We report our implementation in Maple using FGb library.
منابع مشابه
Geometric lower bounds for generalized ranks
We revisit a geometric lower bound for Waring rank of polynomials (symmetric rank of symmetric tensors) of [LT10] and generalize it to a lower bound for rank with respect to arbitrary varieties, improving the bound given by the “non-Abelian” catalecticants recently introduced by Landsberg and Ottaviani. This is applied to give lower bounds for ranks of multihomogeneous polynomials (partially sy...
متن کاملHeuristic methods for computing the minimal multi-homogeneous Bézout number
The multi-homogeneous B ezout number of a polynomial system is the number of paths that one has to follow in computing all its isolated solutions with continuation method. Each partition of variables corresponds to a multi-homogeneous B ezout number. It is a challenging problem to find a partition with minimal multi-homogeneous B ezout number. Two heuristic numerical methods for computing the m...
متن کاملSolving Differential Equations by Using a Combination of the First Kind Chebyshev Polynomials and Adomian Decomposition Method
In this paper, we are going to solve a class of ordinary differential equations that its source term are rational functions. We obtain the best approximation of source term by Chebyshev polynomials of the first kind, then we solve the ordinary differential equations by using the Adomian decomposition method
متن کاملGröbner Bases of Bihomogeneous Ideals generated by Polynomials of Bidegree (1,1): Algorithms and Complexity
Solving multihomogeneous systems, as a wide range of structured algebraic systems occurring frequently in practical problems, is of first importance. Experimentally, solving these systems with Gröbner bases algorithms seems to be easier than solving homogeneous systems of the same degree. Nevertheless, the reasons of this behaviour are not clear. In this paper, we focus on bilinear systems (i.e...
متن کاملThe coefficients of differentiated expansions of double and triple Jacobi polynomials
Formulae expressing explicitly the coefficients of an expansion of double Jacobi polynomials which has been partially differentiated an arbitrary number of times with respect to its variables in terms of the coefficients of the original expansion are stated and proved. Extension to expansion of triple Jacobi polynomials is given. The results for the special cases of double and triple ultraspher...
متن کامل