Search
Talk

Local central limit theorems and asymptotic enumerative combinatorics

  • Georg Menz (UCLA)
A3 01 (Sophus-Lie room)

Abstract

A main goal in the field of enumerative combinatorics is to derive asymptotic formulas for combinatorial sequences. It has been shown in the past that many such sequences obey a central limit theorem, from which asymptotic estimates can be obtained. In particular, for a large class of combinatorial sequences (i.e., assemblies, multisets, and selections), there is a general principle that allows one to derive an asymptotic formula via a local central limit theorem (LCLT) for integer-valued random variables. We present a novel and robust method to derive quantitative LCLTs under conditions which are easy to verify, which then yields quantitative error estimates for the associated asymptotic formulas. In certain cases we are able to provide new quantitative error estimates unknown before. Joint work with Stephen De Salvo.

Katja Heid

MPI for Mathematics in the Sciences Contact via Mail

Upcoming Events of This Seminar

  • Mar 12, 2024 tba with Theresa Simon
  • Mar 26, 2024 tba with Phan Thành Nam
  • Mar 26, 2024 tba with Dominik Schmid
  • May 7, 2024 tba with Manuel Gnann
  • May 14, 2024 tba with Barbara Verfürth
  • May 14, 2024 tba with Lisa Hartung
  • Jun 25, 2024 tba with Paul Dario
  • Jul 16, 2024 tba with Michael Loss