Generation modulo the action of a permutation group

MaRDI QIDQ5746175zbMATH OpenFDO

Authors Nicolas Borie

Publication date 18 February 2014

Full work available at URL https://arxiv.org/abs/1211.6261, https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAS0165/0.html

zbMATH Keywords

computational invariant theoryeffective Galois theoryenumerative combinatoricsgeneration up to an isomorphism

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutation groups (20B99)

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.

Recommendations

• Effective Invariant Theory of Permutation Groups Using Representation Theory
• scientific article; zbMATH DE number 1741032
• Minimal generating sets of non-modular invariant rings of finite groups
• A compact representation for permutation groups
• scientific article; zbMATH DE number 1004935

Cited in

(4)

• Exploring the tree of numerical semigroups.
• Algebraic invariants of graphs; a study based on computer exploration
• Error thresholds for arbitrary Pauli noise
• Simplifying modular lattices by removing doubly irreducible elements

Describes a project that uses

Uses Software

• GAP
• SageMath
• Sage-Combinat

This page was built for publication: Generation modulo the action of a permutation group

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5746175)