arXiv · 1901.09019
Computational aspects of orbifold equivalence
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 Groebner 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.
Explore related subjects
Keep this discovery
Timo Kluck, Ana Ros Camacho. 2019-01-25. Computational aspects of orbifold equivalence. https://arxiv.org/abs/1901.09019
Cite the original work for its findings. Save a collection to share your selection of sources.