Uncovering Symmetries in Polynomial Systems
Abstract
In this paper we study symmetries in polynomial equation systems and how they can be integrated into the action matrix method. The main contribution is a generalization of the partial p -fold symmetry and we provide new theoretical insights as to why these methods work. We show several examples of how to use this symmetry to construct more compact polynomial solvers. As a second contribution we present a simple and automatic method for finding these symmetries for a given problem. Finally we show two examples where these symmetries occur in real applications.
Cite
Text
Larsson and Åström. "Uncovering Symmetries in Polynomial Systems." European Conference on Computer Vision, 2016. doi:10.1007/978-3-319-46487-9_16Markdown
[Larsson and Åström. "Uncovering Symmetries in Polynomial Systems." European Conference on Computer Vision, 2016.](https://mlanthology.org/eccv/2016/larsson2016eccv-uncovering/) doi:10.1007/978-3-319-46487-9_16BibTeX
@inproceedings{larsson2016eccv-uncovering,
title = {{Uncovering Symmetries in Polynomial Systems}},
author = {Larsson, Viktor and Åström, Kalle},
booktitle = {European Conference on Computer Vision},
year = {2016},
pages = {252-267},
doi = {10.1007/978-3-319-46487-9_16},
url = {https://mlanthology.org/eccv/2016/larsson2016eccv-uncovering/}
}