Combinatorics of Cremona monomial maps

  • Simis A
  • Villarreal R
9Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

We study Cremona monomial maps using linear algebra, lattice theory and linear optimization methods. Among the results is a simple integer matrix theoretic proof that the inverse of a Cremona monomial map is also defined by monomials of fixed degree, and moreover, the set of monomials defining the inverse can be obtained explicitly in terms of the initial data. We present another method to compute the inverse of a Cremona monomial map based on integer programming techniques and the notion of a Hilbert basis. A neat consequence is drawn for the plane Cremona monomial group, in particular, the known result saying that a plane Cremona monomial map and its inverse have the same degree. ? 2011 American Mathematical Society.

Cite

CITATION STYLE

APA

Simis, A., & Villarreal, R. H. (2012). Combinatorics of Cremona monomial maps. Mathematics of Computation, 81(279), 1857–1867. https://doi.org/10.1090/s0025-5718-2011-02556-1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free