BiSC is an algorithm that, given a finite set of permutations, conjectures a mesh pattern basis describing the set, rediscovering known theorems and suggesting new ones.
Baxter, On fixed points of the composite of commuting functions, Proc
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
BiSC: An algorithm for discovering generalized permutation patterns
BiSC is an algorithm that, given a finite set of permutations, conjectures a mesh pattern basis describing the set, rediscovering known theorems and suggesting new ones.