Kluck, Timo and Ros Camacho, Ana  ORCID: https://orcid.org/0000-0001-9947-203X
2019.
Computational aspects of orbifold equivalence.
[Online].
arXiv:
Cornell University.
Available at: https://doi.org/10.48550/arXiv.1901.09019
|
Preview |
PDF
- Submitted Pre-Print Version
Download (216kB) | Preview |
Official URL: https://doi.org/10.48550/arXiv.1901.09019
Abstract
In this paper we study the computational feasibility of an algorithm to prove orbifold equivalence between potentials describing Landau-Ginzburg models. Through a comparison with leading results of Grobner basis computations in cryptology, we infer that the algorithm produces systems of equations that are beyond the limits of current technical capabilities. As such the algorithm needs to be augmented by `inspired guesswork', and we provide two new examples of applying this approach.
| Item Type: | Website Content |
|---|---|
| Status: | Unpublished |
| Schools: | Schools > Mathematics |
| Publisher: | Cornell University |
| Last Modified: | 23 Feb 2023 12:15 |
| URI: | https://orca.cardiff.ac.uk/id/eprint/157190 |
Actions (repository staff only)
 |
Edit Item |
Download Statistics
Download Statistics