Using monodromy and representation theory to recover symmetries of polynomial systems | Korotynskiy @TheJuliaLanguage
Using monodromy and representation theory to recover symmetries of polynomial systems | Korotynskiy  @TheJuliaLanguage
Uploaded October 2026 | Updated November 2026, 3 days ago
Using monodromy and representation theory to recover symmetries of polynomial systems by Viktor Korotynskiy

PreTalx: pretalx.com/juliacon-2026/talk/SMBUHF

Parametric polynomial systems can be represented as dominant maps between irreducible algebraic varieties of the same dimension, where symmetries correspond to automorphisms of these maps. Galois, or monodromy, groups provide a numerical tool for detecting the existence of such symmetries in solution sets. A central computational challenge, however, is to recover explicit formulas for these automorphisms in order to better understand and more efficiently solve the systems. We combine numerical homotopy continuation with multivariate rational function interpolation to compute candidate symmetries, implemented in the Julia package [DecomposingPolynomialSystems.jl](https://github.com/MultivariatePolynomialSystems/DecomposingPolynomialSystems.jl).

For structured systems with many variables, such as minimal problems in computer vision, the resulting Vandermonde-like interpolation matrices become prohibitively large, leading to expensive nullspace computations and numerical instability. We address this by exploiting equivariance of minimal problems with respect to matrix Lie group actions. The interpolation space of bounded-degree polynomials decomposes into isotypic components as a representation of the Lie symmetry group, allowing a substantial reduction of the problem size. This representation-theoretic decomposition is implemented in the Julia package [DecomposingGroupRepresentations.jl](https://github.com/MultivariatePolynomialSystems/DecomposingGroupRepresentations.jl). Together, these tools provide a scalable Julia-based framework that integrates monodromy and computational representation theory to recover closed-form symmetries of polynomial systems.
Using monodromy and representation theory to recover symmetries of polynomial systems | KorotynskiyEffects of stochasticity on molecular minimization | Leclaire | JuliaCon Global 2026Neural Networks, Genetic Algorithms, and Neuroevolution | Bergel | JuliaCon Global 2026Optimal Planning for Steel Industry Decarbonization | Vinícius Justen PintoJulia for Data Analysis in LHCb experiment | Segal | JuliaCon Global 2026Implementing Lattice QCD to Multi-GPU Systems with JuliaQCD | Hsiao | JuliaCon Global 2026Haskell: origins, evolution, and future | Peyton Jones | JuliaCon Global 2026FerriteCon 2025 Kim Louisa Auth : Introduction to Ferrite.jlDisjunctiveProgramming.jl’s New Suite of Solution Methods | Daniel NguyenRadiomics.jl: a Library for High-Performance Radiomic Features Extraction from Medical ImagesMuschel N3 | JuliaCon Global 2026 | Day 1The Hidden Path to Turing.jl v1.0 | Yong | JuliaCon Global 2026
The Julia Programming Language |

Using monodromy and representation theory to recover symmetries of polynomial systems | Korotynskiy

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER