Computational aspects of orbifold equivalence
Quantum Algebra
2023-09-27 v3
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.
Cite
@article{arxiv.1901.09019,
title = {Computational aspects of orbifold equivalence},
author = {Timo Kluck and Ana Ros Camacho},
journal= {arXiv preprint arXiv:1901.09019},
year = {2023}
}
Comments
20 pages, submitted