The classical-pattern basis conjecture for the union of dihedral subgroups
The classical-pattern basis conjecture for the union of dihedral subgroups
Let be the dihedral subgroup of the symmetric group on letters, and let denote the union of the groups . For a set of classical patterns, write for the permutations avoiding every pattern in . Dihedral subgroup basis conjecture. The union of the dihedral subgroups consists of permutations avoiding the classical patterns , , , , , , , , , , , , , , , and . This would provide the classical-pattern basis not given by the cited classification of pattern-defined subgroups; the paper presents it as a result discovered computationally by , with no resolution stated.
Sources & referencesView supporting material
Primary source
Henning Ulfarsson, “BiSC: An algorithm for discovering generalized permutation patterns”, arXiv:2411.17778 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.