تقرير
Computational aspects of orbifold equivalence
| العنوان: | Computational aspects of orbifold equivalence |
|---|---|
| المؤلفون: | Kluck, Timo, Camacho, Ana Ros |
| سنة النشر: | 2019 |
| المجموعة: | Mathematics |
| مصطلحات موضوعية: | Mathematics - Quantum Algebra |
| الوصف: | 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. Comment: 20 pages, submitted |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/1901.09019 |
| رقم الأكسشن: | edsarx.1901.09019 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |