The classical-pattern basis conjecture for the union of dihedral subgroups

Let DnD_n be the dihedral subgroup of the symmetric group on nn letters, and let DD denote the union of the groups DnD_n. For a set PP of classical patterns, write Av(P)\operatorname{Av}(P) for the permutations avoiding every pattern in PP. Dihedral subgroup basis conjecture. The union of the dihedral subgroups consists of permutations avoiding the classical patterns 31423142, 13421342, 23142314, 21342134, 32413241, 42314231, 34213421, 42134213, 24132413, 13241324, 31243124, 14231423, 24312431, 43124312, 41324132, and 12431243. 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 BiSC\mathsf{BiSC}, 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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.