2 papers
math.CO2026
Exactly-solvable self-trapping lattice walks. II. Lattices of arbitrary height
Jay Pantone, Alexander R. Klotz, Everett Sullivan
A growing self-avoiding walk (GSAW) is a walk on a graph that is directed, does not visit the same vertex twice, and has a trapped endpoint. We show that the generating function en…
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…