Constructions in finite geometry using computer algebra systems
From MaRDI portal
The author adresses the question of how computer algebra systems can be used in finite geometry. The computer can be used to construct small examples and then one can analyze them to see the general pattern. The author illustrates his ideas by discussing two examples. The first one comprises the construction of translation planes by finding replaceable nests and the second one concerns the construction of large collections of mutually disjoint projective bundles of conics.
Recommendations
Cites work
- Filling the nest gaps
- scientific article; zbMATH DE number 4058300 (Why is no real title available?)
- scientific article; zbMATH DE number 4071782 (Why is no real title available?)
- scientific article; zbMATH DE number 1511189 (Why is no real title available?)
- scientific article; zbMATH DE number 3328019 (Why is no real title available?)
- Nests of Size q −1 and another Family of Translation Planes
- On the geometry of planar difference sets
- Projective bundles
- Spreads admitting regular elliptic covers
- The Magma algebra system. I: The user language
- Über nicht-Desarguessche Ebenen mit transitiver Translationsgruppe
Cited in
(6)- Symbolic incidence geometry and finite linear spaces
- Computer-aided construction of finite geometric spaces: Automated verification of geometric constraints
- scientific article; zbMATH DE number 1273696 (Why is no real title available?)
- scientific article; zbMATH DE number 665695 (Why is no real title available?)
- scientific article; zbMATH DE number 1431711 (Why is no real title available?)
- Applications of computer algebra to finite geometry
This page was built for publication: Constructions in finite geometry using computer algebra systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5928880)