16:00
$p$-Adic Variation in the Theory of Automorphic Forms
Abstract
This will be an expository lecture intended for a general mathematical audience to illustrate, through examples, the theme of $p$-adic variation in the classical theory of modular forms. Classically, modular forms are complex analytic objects, but because their Fourier coefficients are typically integral, it is possible to also do elementary arithmetic with them. Early examples arose already in the work of Ramanujan. Today one knows that modular forms encode deep arithmetic information about elliptic curves and Galois representations. Our main goal will be to illustrate these ideas through simple concrete examples.
Non-nilpotent graphs of groups
Abstract
A non-nilpotent graph Γ(G) of a finite group G has elements of G as vertices, with x and y joined by an edge iff a subgroup generated by these two elements is non-nilpotent. During the talk we will prove several (often unrelated) properties of this construction; for instance, any simple graph can be found as an induced subgraph of Γ(G) for some (solvable) group G. The talk is based on my article "A few remarks on the theory of non-nilpotent graphs" (May 2023).
One of the last things Buddy recorded with just him and his guitar, Peggy Sue Got Married and its predecessor Peggy Sue were written about Peggy Sue Gerron who Holly had known for many years and who had married his band's drummer Jerry Allison. The marriage was unhappy and this song, so wistful yet written by a 22 year old Holly, was about that marriage.
Integrate your residuals while solving dynamic optimization problems
Abstract
Many optimal control, estimation and design problems can be formulated as so-called dynamic optimization problems, which are optimization problems with differential equations and other constraints. State-of-the-art methods based on collocation, which enforce the differential equations at only a finite set of points, can struggle to solve certain dynamic optimization problems, such as those with high-index differential algebraic equations, consistent overdetermined constraints or problems with singular arcs. We show how numerical methods based on integrating the differential equation residuals can be used to solve dynamic optimization problems where collocation methods fail. Furthermore, we show that integrated residual methods can be computationally more efficient than direct collocation.
This seminar takes place at RAL (Rutherford Appleton Lab).