2 papers
math.CO2024
Combinatorial Exploration: An algorithmic framework for enumeration
Michael H. Albert, Christian Bean, Anders Claesson +3
Combinatorial Exploration is a new domain-agnostic algorithmic framework to automatically and rigorously study the structure of combinatorial objects and derive their counting sequ…
cs.DM2024
Restricted Permutations Enumerated by Inversions
Atli Fannar FranklÃn, Anders Claesson, Christian Bean +2
Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposab…