*일시: 4월 29일 수요일 16:30 – 17:30
*연사: 송민호 박사님 (연세대학교 수학과)
*장소 : 응용수학연습실(베어드홀 426호)
*제목 : Exact enumeration via Riordan arrays
*초록
The Riordan group provides a useful framework for studying combinatorial structures through generating functions and infinite lower-triangular arrays. Many classical counting arrays arise from pairs of generating functions in this setting. This talk introduces the basic ideas of Riordan group theory through familiar examples from recursive combinatorics, such as trees and lattice paths. The emphasis will be on how generating functions lead naturally to lower-triangular arrays, how identities among these arrays reflect combinatorial constructions, and how Riordan arrays provide a unified language for recursive counting problems.