Datagraphs in algebraic geometry and K3 surfaces

  • Authors:

  • Gavin Brown

  • Affiliations:

  • Mathematics Institute, University of Warwick, Coventry, UK

  • Venue:
  • SNSC'01 Proceedings of the 2nd international conference on Symbolic and numerical scientific computation
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Datagraphs are combinatorial graphs having database items at their vertices and geometric relationships along their edges. I describe their applicability to lists of examples in algebraic geometry generated by computer algebra, and illustrate this with a list of K3 surfaces as the database items. The main point is that when analysinga single surface during construction of the database, the datagraph makes available its close relations, and that very often these provide extra information required to complete the analysis.