Abstract | ||
---|---|---|
For rationally flbred surfaces over Q and also over R, an ef- fective algorithm exists that decides if such a surface has a proper parametrisation. This algorithm uses a diagonalised form of the surface equation. We show, using recent algo- rithms for quadratic forms, that diagonalisation is not neces- sary. The resulting algorithm only uses operations on poly- nomials (as opposed to rational functions), which keeps all occurring degrees small and avoids spurious factors in the discriminant. |
Year | DOI | Venue |
---|---|---|
2006 | 10.1145/1145768.1145823 | International Symposium on Symbolic and Algebraic Computation |
Keywords | Field | DocType |
parametrisation,quadratic forms,surface equation,resulting algorithm,avoids spurious factor,surface parametrisation,rational surfaces,diagonalised form,quadratic form,fibred surface,effective algorithm,proper parametrisation,rational function,recent algorithm | Combinatorics,Parametrization,Polynomial,Discriminant,Quadratic form,Fibered knot,Rational function,Spurious relationship,Mathematics | Conference |
ISBN | Citations | PageRank |
1-59593-276-3 | 1 | 0.42 |
References | Authors | |
5 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Christiaan Van De Woestijne | 1 | 13 | 2.33 |