Generation modulo the action of a permutation group - Inria - Institut national de recherche en sciences et technologies du numérique
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2013

Generation modulo the action of a permutation group

Nicolas Borie
  • Function : Author
  • PersonId : 941412

Abstract

Originally motivated by algebraic invariant theory, we present an algorithm to enumerate integer vectors modulo the action of a permutation group. This problem generalizes the generation of unlabeled graph up to an isomorphism. In this paper, we present the full development of a generation engine by describing the related theory, establishing a mathematical and practical complexity, and exposing some benchmarks. We next show two applications to effective invariant theory and effective Galois theory.
Fichier principal
Vignette du fichier
dmAS0165.pdf (382.11 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01229658 , version 1 (17-11-2015)

Identifiers

Cite

Nicolas Borie. Generation modulo the action of a permutation group. 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), 2013, Paris, France. pp.767-778, ⟨10.46298/dmtcs.2341⟩. ⟨hal-01229658⟩
81 View
834 Download

Altmetric

Share

More