AMS Sectional Meeting AMS Special Session

Current as of Sunday, April 14, 2024 03:30:04

2024 Spring Eastern Sectional Meeting

  • Howard University, Washington, DC
  • April 6-7, 2024 (Saturday - Sunday)
  • Meeting #1194

Associate Secretary for the AMS Scientific Program:

Steven H Weintraub, Lehigh University shw2@lehigh.edu

Special Session on Riordan Arrays

  • Saturday April 6, 2024, 9:00 a.m.-11:00 a.m.
    Special Session on Riordan Arrays, I
    A Riordan array, denoted by (g, f), is an infinite lower triangular matrix where g and f aregenerating functions. The coefficients of the generating function g form the first column ofthe matrix, and subsequent columns are obtained by multiplying the previous column by f.In essence, it can be represented as (g; f) = (g, gf, gf2, gf2, gf3, . . .).The first applications of Riordan arrays were in providing quick proofs for combinatorialidentities and by using its group structure inverting combinatorial identities. Recent areasof interest involving Riordan arrays include Riordan Lie theory, involutions and pseudoinvolutions, connections with the Banach fixed point theorem, RNA secondary structure,directed animals, Riordan graphs, the Riemann hypothesis, super groups containing theRiordan group, and the interrelations among various subgroups of combinatorial or probabilisticsignificance.The accessibility of the Riordan group, requiring minimal background knowledge, contributesto its popularity. This session is dedicated to examining recent advancements in the studyof Riordan arrays and the Riordan group.
    ILH 118, Inabel Burns Lindsay Hall
    Organizers:
    Dennis Davenport, Howard University dennis.davenport@howard.edu
    Lou Shapiro, Howard University
    Leon Woodson, SPIRAL REU At Georgetown

  • Saturday April 6, 2024, 3:00 p.m.-4:00 p.m.
    Special Session on Riordan Arrays, II
    A Riordan array, denoted by (g, f), is an infinite lower triangular matrix where g and f aregenerating functions. The coefficients of the generating function g form the first column ofthe matrix, and subsequent columns are obtained by multiplying the previous column by f.In essence, it can be represented as (g; f) = (g, gf, gf2, gf2, gf3, . . .).The first applications of Riordan arrays were in providing quick proofs for combinatorialidentities and by using its group structure inverting combinatorial identities. Recent areasof interest involving Riordan arrays include Riordan Lie theory, involutions and pseudoinvolutions, connections with the Banach fixed point theorem, RNA secondary structure,directed animals, Riordan graphs, the Riemann hypothesis, super groups containing theRiordan group, and the interrelations among various subgroups of combinatorial or probabilisticsignificance.The accessibility of the Riordan group, requiring minimal background knowledge, contributesto its popularity. This session is dedicated to examining recent advancements in the studyof Riordan arrays and the Riordan group.
    ILH 118, Inabel Burns Lindsay Hall
    Organizers:
    Dennis Davenport, Howard University dennis.davenport@howard.edu
    Lou Shapiro, Howard University
    Leon Woodson, SPIRAL REU At Georgetown

  • Sunday April 7, 2024, 10:00 a.m.-11:00 a.m.
    Special Session on Riordan Arrays, III
    A Riordan array, denoted by (g, f), is an infinite lower triangular matrix where g and f aregenerating functions. The coefficients of the generating function g form the first column ofthe matrix, and subsequent columns are obtained by multiplying the previous column by f.In essence, it can be represented as (g; f) = (g, gf, gf2, gf2, gf3, . . .).The first applications of Riordan arrays were in providing quick proofs for combinatorialidentities and by using its group structure inverting combinatorial identities. Recent areasof interest involving Riordan arrays include Riordan Lie theory, involutions and pseudoinvolutions, connections with the Banach fixed point theorem, RNA secondary structure,directed animals, Riordan graphs, the Riemann hypothesis, super groups containing theRiordan group, and the interrelations among various subgroups of combinatorial or probabilisticsignificance.The accessibility of the Riordan group, requiring minimal background knowledge, contributesto its popularity. This session is dedicated to examining recent advancements in the studyof Riordan arrays and the Riordan group.
    ILH 118, Inabel Burns Lindsay Hall
    Organizers:
    Dennis Davenport, Howard University dennis.davenport@howard.edu
    Lou Shapiro, Howard University
    Leon Woodson, SPIRAL REU At Georgetown

  • Sunday April 7, 2024, 2:00 p.m.-3:30 p.m.
    Special Session on Riordan Arrays, IV
    A Riordan array, denoted by (g, f), is an infinite lower triangular matrix where g and f aregenerating functions. The coefficients of the generating function g form the first column ofthe matrix, and subsequent columns are obtained by multiplying the previous column by f.In essence, it can be represented as (g; f) = (g, gf, gf2, gf2, gf3, . . .).The first applications of Riordan arrays were in providing quick proofs for combinatorialidentities and by using its group structure inverting combinatorial identities. Recent areasof interest involving Riordan arrays include Riordan Lie theory, involutions and pseudoinvolutions, connections with the Banach fixed point theorem, RNA secondary structure,directed animals, Riordan graphs, the Riemann hypothesis, super groups containing theRiordan group, and the interrelations among various subgroups of combinatorial or probabilisticsignificance.The accessibility of the Riordan group, requiring minimal background knowledge, contributesto its popularity. This session is dedicated to examining recent advancements in the studyof Riordan arrays and the Riordan group.
    ILH 118, Inabel Burns Lindsay Hall
    Organizers:
    Dennis Davenport, Howard University dennis.davenport@howard.edu
    Lou Shapiro, Howard University
    Leon Woodson, SPIRAL REU At Georgetown

Inquiries: meet@ams.org