Two-closures of supersolvable permutation groups in polynomial time

Ilia Ponomarenko, Andrey Vasil’ev

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

The 2-closure G¯ of a permutation group G on Ω isdefined to be the largest permutation group on Ω , having thesame orbits on Ω × Ω as G. It is proved that ifG is supersolvable, then G¯ can be found in polynomial timein

Original languageEnglish
Article number5
Number of pages33
JournalComputational Complexity
Volume29
Issue number1
DOIs
Publication statusPublished - 1 Jun 2020

Keywords

  • 2-closure
  • 20B25
  • 20B40
  • Permutation group
  • Polynomial-time algorithm

Fingerprint

Dive into the research topics of 'Two-closures of supersolvable permutation groups in polynomial time'. Together they form a unique fingerprint.

Cite this