Events for 02/28/2018 from all calendars

Number Theory Seminar

Time: 1:15PM - 2:15PM

Location: BLOC 220

Speaker: Wei-Lun Tsai, Texas A&M University

Title: Analytic formulas for Stark units in quadratic extensions of totally real cubic fields

Abstract: In this talk, we will explain how Stark units in certain quadratic extensions of totally real cubic fields can be evaluated explicitly in terms of values of the Barnes triple Gamma function at algebraic arguments. This is joint work with Adrian Barquero-Sanchez and Riad Masri.

URL: Event link

Numerical Analysis Seminar

Time: 3:00PM - 4:00PM

Location: BLOC 628

Speaker: Abner Salgado, University of Tennessee

Title: Finite element approximation of nonconvex uniformly elliptic fully nonlinear equations

Abstract: We propose and analyze a two-scale finite element method for the Isaacs equation. By showing the consistency of the approximation and that the method satisfies the discrete maximum principle we establish convergence to the viscosity solution. By properly choosing each of the scales, and using the recently derived discrete Alexandrov Bakelman Pucci estimate we can deduce rates of convergence.

Groups and Dynamics Seminar

Time: 3:00PM - 4:00PM

Location: BLOC 220

Speaker: Yaroslav Vorobets, Texas A&M

Title: Finite generation of topological full groups

Abstract: Topological full groups provide a connection between topological dynamics and group theory. A countable transformation group is associated to a dynamical system and, as an abstract group, it completely encodes the dynamics. It is known that the derived group of the topological full group is finitely generated provided that dynamics is minimal and expansive. However the group itself need not be finitely generated. I am going to discuss issues with finite generation and then present a new example of a finitely generated topological full group.

AMUSE

Time: 6:00PM - 7:00PM

Location: BLOC 220

Speaker: Dr. Andrew Bridy, Texas A&M University, Department of Mathematics

Title: Integer Factorization and Cryptography

Abstract: The security of modern cryptography largely depends on the fact that factoring integers is a computationally expensive problem (at least, until quantum computers become practical). We will discuss the difficulty of factoring, as well as some factoring algorithms that are significantly faster than the naive "trial division" method.