DeepAI AI Chat
Log In Sign Up

Solving Decomposable Sparse Systems

by   Taylor Brysiewicz, et al.
University of Wisconsin-Madison
Texas A&M University

Amendola et al. proposed a method for solving systems of polynomial equations lying in a family which exploits a recursive decomposition into smaller systems. A family of systems admits such a decomposition if and only if the corresponding Galois group is imprimitive. When the Galois group is imprimitive we consider the problem of computing an explicit decomposition. A consequence of Esterov's classification of sparse polynomial systems with imprimitive Galois groups is that this decomposition is obtained by inspection. This leads to a recursive algorithm to solve decomposable sparse systems, which we present and give evidence for its efficiency.


page 1

page 2

page 3

page 4


Decomposable sparse polynomial systems

The Macaulay2 package DecomposableSparseSystems implements methods for s...

A family of explicit Waring decompositions of a polynomial

In this paper we settle some polynomial identity which provides a family...

Computing the decomposition group of a zero-dimensional ideal by elimination method

In this note, we show that the decomposition group Dec(I) of a zero-dime...

Automatically Composing Representation Transformations as a Means for Generalization

How can we build a learner that can capture the essence of what makes a ...

Solving coupled Lane-Emden equations by Green's function and decomposition technique

In this paper, the Green's function and decomposition technique is propo...

Finding sparse solutions of systems of polynomial equations via group-sparsity optimization

The paper deals with the problem of finding sparse solutions to systems ...

A new algorithm for irreducible decomposition of representations of finite groups

An algorithm for irreducible decomposition of representations of finite ...