A. Montes

activity

20052007

most citedImproving DISPGB Algorithm Using the Discriminant Ideal

61 citations · 87 across the 8 of their papers we have counts for

collaborators

8 papers

math.AG2007★ 18 cited

Automatic Discovery of Geometry Theorems Using Minimal Canonical Comprehensive Groebner Systems

Antonio Montes, Tomas Recio

The main idea in this paper is merging two techniques that have been recently developed. On the one hand, we consider MCCGS, standing for Minimal Canonical Comprehensive Groebner S…

math.AC2006★ 7 cited

Minimal Canonical Comprehensive Groebner Systems

Antonio Montes, Montserrat Manubens

This is the continuation of Montes' paper "On the canonical discussion of polynomial systems with parameters". In this paper we define the Minimal Canonical Comprehensive Groebner…

math.AC2006★ 61 cited

Improving DISPGB Algorithm Using the Discriminant Ideal

Montserrat Manubens, Antonio Montes

In 1992, V. Weispfenning proved the existence of Comprehensive Groebner Bases (CGB) and gave an algorithm to compute one. That algorithm was not very efficient and not canonical. U…

math.CO2006

A polynomial generalization of the power-compositions determinant

Josep M. Brunat, Antonio Montes

Let $C (n, p)$ be the set of $p$ -compositions of an integer $n$ , i.e., the set of $p$ -tuples $α = (α_{1}, ..., α_{p})$ of nonnegative integers such that $α_{1} + ... + α_{p} = n$ , and $\mathbf{x}=(…

math.AC2006

On polynomial digraphs

Josep M. Brunat, Antonio Montes

Let $Φ (x, y)$ be a bivariate polynomial with complex coefficients. The zeroes of $Φ (x, y)$ are given a combinatorial structure by considering them as arcs of a directed graph $G (Φ)$ .…

math.AC2006

The characteristic ideal of a finite, connected, regular graph

Josep M. Brunat, Antonio Montes

Let $Φ (x, y) \in C [x, y]$ be a symmetric polynomial of partial degree $d$ . The graph $G (Φ)$ is defined by taking $C$ as set of vertices and the points of $\mathbb{V}(…