Computational aspects of orbifold equivalence

Kluck, Timo and Ros Camacho, Ana ORCID: https://orcid.org/0000-0001-9947-203X 2019. Computational aspects of orbifold equivalence. arXiv Cornell University.

Preview

PDF - Submitted Pre-Print Version Download (216kB) | Preview

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:	Working paper
Status:	Unpublished
Schools:	Schools > Mathematics
Publisher:	Cornell University
Projects:	NWO Veni Fellowship 639.031.758, Marie Sklodowska-Curie Individual Fellowship “MACOLAB” proposal number 747555
Last Modified:	30 Jan 2026 16:29
URI:	https://orca.cardiff.ac.uk/id/eprint/157190

Actions (repository staff only)

Edit Item