Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1,1): Algorithms and complexity - Archive ouverte HAL Access content directly
Journal Articles Journal of Symbolic Computation Year : 2011

## Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1,1): Algorithms and complexity

(1) , (1) , (2, 1)
1
2
Jean-Charles Faugère
Mohab Safey El Din
• Function : Author
Pierre-Jean Spaenlehauer

#### Abstract

Solving multihomogeneous systems, as a wide range of \emph{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. bihomogeneous systems where all equations have bidegree $(1,1)$). Our goal is to provide a theoretical explanation of the aforementioned experimental behaviour and to propose new techniques to speed up the Gröbner basis computations by using the multihomogeneous structure of those systems. The contributions are theoretical and practical. First, we adapt the classical $F_5$ criterion to avoid reductions to zero which occur when the input is a set of bilinear polynomials. We also prove an explicit form of the Hilbert series of bihomogeneous ideals generated by generic bilinear polynomials and give a new upper bound on the degree of regularity of generic affine bilinear systems. We propose also a variant of the $F_5$ Algorithm dedicated to multihomogeneous systems which exploits a structural property of the Macaulay matrix which occurs on such inputs. Experimental results show that this variant requires less time and memory than the classical homogeneous $F_5$ Algorithm. Lastly, we investigate the complexity of computing a Gröbner basis for the grevlex ordering of a generic $0$-dimensional affine bilinear system over $k[x_1,\ldots, x_{n_x}, y_1,\ldots, y_{n_y}]$. In particular, we show that this complexity is upper bounded by $O\left({{n_x+n_y+\min(n_x+1,n_y+1)}\choose{\min(n_x+1,n_y+1)}}^\omega\right)$, which is polynomial in $n_x+n_y$ (i.e. the number of unknowns) when $\min(n_x,n_y)$ is constant.

#### Domains

Computer Science [cs] Symbolic Computation [cs.SC]

### Dates and versions

inria-00596631 , version 1 (30-05-2011)

### Identifiers

• HAL Id : inria-00596631 , version 1
• DOI :

### Cite

Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer. Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1,1): Algorithms and complexity. Journal of Symbolic Computation, 2011, 46 (4), pp.406-437. ⟨10.1016/j.jsc.2010.10.014⟩. ⟨inria-00596631⟩

### Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

221 View