We will talk about a recent result in lattice path enumeration whose proof required heavy computer algebra calculation. The focus of the talk will be on a particularly expensive computational step in the proof, where we needed to show that something that looks like a power series really is a power series. Joint work with Alin Bostan, Inria.
Forschungs-