We show that solutions to the Kashiwara–Vergne problem can be extended degree by degree. This can be used to simplify the computation of a class of Drinfel’d associators, which under the Alekseev–Torossian conjecture, may comprise all associators. We also give a proof that the associated graded Lie algebra of the Kashiwara–Vergne group is isomorphic to the graded Kashiwara–Vergne Lie algebra.
more »
« less
The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree
More Like this
-
-
null (Ed.)The Macaulay2 [5] package AlgebraicOptimization implements methods for determining the algebraic degree of an optimization problem. We describe the structure of an algebraic optimization problem and explain how the methods in this package may be used to determine the respective degrees. Special features include determining Euclidean distance degrees and maximum likelihood degrees. To our knowledge, this is the first comprehensive software package combining different methods in algebraic optimization. The package is available at https://github.com/Macaulay2/Workshop-2020-Cleveland/tree/ISSAC-AlgOpt/alg-stat/AlgebraicOptimization.more » « less
An official website of the United States government

