Datagraphs in algebraic geometry and K3 surfaces
UNSPECIFIED (2003) Datagraphs in algebraic geometry and K3 surfaces. In: 2nd International Conference on Symbolic and Numerical Scientific Computation, HAGENBERG, AUSTRIA, SEP 12-14, 2001. Published in: SYMBOLIC AND NUMERICAL SCIENTIFIC COMPUTATION, 2630 pp. 210-224.Full text not available from this repository.
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 analysing a 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.
|Item Type:||Conference Item (UNSPECIFIED)|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software|
|Series Name:||LECTURE NOTES IN COMPUTER SCIENCE|
|Journal or Publication Title:||SYMBOLIC AND NUMERICAL SCIENTIFIC COMPUTATION|
|Editor:||Winkler, F and Langer, U|
|Number of Pages:||15|
|Page Range:||pp. 210-224|
|Title of Event:||2nd International Conference on Symbolic and Numerical Scientific Computation|
|Location of Event:||HAGENBERG, AUSTRIA|
|Date(s) of Event:||SEP 12-14, 2001|
Actions (login required)