• From sparsity of rational points on curves to the generic positivity of Beilinson-Bloch height (Ziyang Gao, UCLA)

    Estella 2099

    It is a fundamental question to find rational solutions to a given system of polynomials, and in modern language this translates into finding rational points in algebraic varieties.  It is already very deep for algebraic curves defined over Q.  An intrinsic natural number associated with the curve, called its genus, plays an important role in […]

  • Elementary probability via bundles (Wai Yan Pong, Cal State Dominguez Hills)

    Estella 2099

    This talk explores elementary probability and statistics through the language of category theory. We introduce a category of Bundles and use it to reinterpret several results typically covered in an introductory course on probability and statistics. This approach naturally reveals the underlying geometric structures common to these results. The talk is accessible to anyone familiar […]

  • The forbidden quiver of a link (Sam Nelson, CMC)

    Estella 2099

    Virtual links can be represented as equivalence classes of Gauss diagrams under Reidemeister moves. The Forbidden Moves are moves which look plausible but change the virtual isotopy class of the […]

  • Relationships between skein algebras (Helen Wong, CMC)

    Estella 2099

    We will examine the multiplicative structure of two skein algebras--- the usual Kauffman bracket skein algebra of a surface (generated by loops) and a generalization of it due to Roger-Yang […]

  • Hecke algebras and motives (Robert Cass, CMC)

    Estella 2099

    Hecke algebras play a central role in both number theory and representation theory. While some Hecke algebras have explicit descriptions in terms of generators and relations, others are understood through structure constants that encode multiplicities in tensor products of representations. In this talk, I will discuss several projects with Thibaud van den Hove and Jakob […]

  • Computing certificates for complete positivity (Achill Schürmann, University of Rostock)

    Estella 2099

    A key problem in computer proofs based on solutions from copositive optimization, is checking whether or not a given quadratic form is completely positive or not. In this talk we describe the first known algorithm for arbitrary rational input. It is based on a suitable adaption of Voronoi's Algorithm and the underlying theory from positive definite […]