Two Algorithms to Compute Symmetry Groups for Landau-Ginzburg Models

02/19/2018
by   Nathan Cordner, et al.
0

Landau-Ginzburg mirror symmetry studies isomorphisms between graded Frobenius algebras, known as A- and B-models. Fundamental to constructing these models is the computation of the finite, Abelian maximal symmetry group G_W^ of a given polynomial W. For invertible polynomials, which have the same number of monomials as variables, a generating set for this group can be computed efficiently by inverting the polynomial exponent matrix. However, this method does not work for noninvertible polynomials with more monomials than variables since the resulting exponent matrix is no longer square. A previously conjectured algorithm to address this problem relies on intersecting groups generated from submatrices of the exponent matrix. We prove that this method is correct, but intractable in general. We overcome intractability by presenting a group isomorphism based on the Smith normal form of the exponent matrix. We demonstrate an algorithm to compute G_W^ via this isomorphism, and show its efficiency in all cases.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/19/2018

Two Algorithms to Compute the Maximal Symmetry Group

Landau-Ginzburg mirror symmetry studies isomorphisms between graded Frob...
research
05/05/2020

Characterizing Triviality of the Exponent Lattice of A Polynomial through Galois and Galois-Like Groups

The problem of computing the exponent lattice which consists of all the ...
research
11/03/2019

Cryptanalysis of a new version of the MOR scheme

We show that an attack based on the linear decomposition method introduc...
research
03/27/2023

Faster Isomorphism for p-Groups of Class 2 and Exponent p

The group isomorphism problem determines whether two groups, given by th...
research
06/14/2016

Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields

The fastest known algorithm for factoring univariate polynomials over fi...
research
06/26/2017

An adaptive prefix-assignment technique for symmetry reduction

This paper presents a technique for symmetry reduction that adaptively a...
research
06/22/2023

Breaking the cubic barrier in the Solovay-Kitaev algorithm

We improve the Solovay-Kitaev theorem and algorithm for a general finite...

Please sign up or login with your details

Forgot password? Click here to reset