BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Events and Announcements - ECPv4.6.24.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Williams Events Calendar
X-ORIGINAL-URL:https://events.williams.edu
X-WR-CALDESC:Events for Events and Announcements
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20181109T130000
DTEND;TZID=America/New_York:20181109T134500
DTSTAMP:20200812T014725
CREATED:20181022T133848Z
LAST-MODIFIED:20181022T133848Z
UID:13616-1541768400-1541771100@events.williams.edu
SUMMARY:Combinatorial Interpretations of Lucas Analogues by Prof. Bruce E. Sagan\, Michigan State University\, Mathematics Class of 1960s Scholar
DESCRIPTION:Combinatorial Interpretations of Lucas Analogues by Prof. Bruce E. Sagan\, Michigan State University\, Mathematics Class of 1960s Scholar\, Friday\, November 9\, 1 – 1:45 pm\, Stetson Court Classroom 105 \nAbstract: The Lucas sequence is a sequence of polynomials in s\, t defined recursively by \n{0} = 0\, {1} = 1\, and {n} = s{n – 1} + t{n – 2} for n 2. On specialization of s and t one can recover the Fibonacci numbers\, the nonnegative integers\, and the q-integers [n]q. Given a quantity which is expressed in terms of products and quotients of nonnegative integers\, one obtains a Lucas analogue by replacing each factor of n in the expression with {n}. It is then natural to ask if the resulting rational function is actually a polynomial in s and t and\, if so\, what it counts. Using lattice paths\, we give combinatorial models for Lucas analogues of binomial coefficients. We also consider Catalan numbers and their relatives\, such as those for finite Coxeter groups. This is joint work with Curtis Bennett\, Juan Carrillo\, and John Machacek. \n
URL:https://events.williams.edu/event/combinatorial-interpretations-of-lucas-analogues-by-prof-bruce-e-sagan-michigan-state-university-mathematics-class-of-1960s-scholar/
LOCATION:Stetson Court classroom\, Williamstown\, MA\, 01267\, United States
CATEGORIES:Event
END:VEVENT
END:VCALENDAR