Speaker: Nikita Borisov
Abstract: Can you guess the formula for these numbers? It’s nⁿ⁻², which is much simpler than the formula for the Fibonacci and Catalan numbers. But this sequence is not as well-known, so much so that it doesn’t have a name besides A000272. I’ll try to convince you that these numbers count interesting things and provide cute bijective proofs. We will see how they count labeled trees, parking functions, and the dimensions of certain spaces of solutions to PDEs.
