Computational aspects of orbifold equivalence

Kluck, Timo and Ros Camacho, Ana ORCID: https://orcid.org/0000-0001-9947-203X 2024. Computational aspects of orbifold equivalence. Contributions to Algebra and Geometry [English] Beiträge zur Algebra und Geometrie [German] 65 , pp. 809-826. 10.1007/s13366-024-00731-4

Preview

PDF - Published Version Available under License Creative Commons Attribution. Download (361kB) | 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 state-of-the-art results of Gröbner 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 examples of applying this approach.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Mathematics
Publisher:	Springer
ISSN:	0138-4821
Date of First Compliant Deposit:	9 January 2024
Date of Acceptance:	5 January 2024
Last Modified:	03 Dec 2024 13:15
URI:	https://orca.cardiff.ac.uk/id/eprint/165364

Actions (repository staff only)

Edit Item