2012 | 2013 | 2014 | 2015 | 2016 | 2017 | 2018 | 2019 | 2020 | 2021 | 2022
Current contact: Brandi Henry and Ruth Meadow-MacLeod
The seminar takes place on Fridays from 3:00 to 4:00pm on Zoom, and there will be a social time from 2:00 to 3:00pm in lieu of the refreshments usually offered.
Rebekah Palmer, Temple University
Abstract: The tessellation of surfaces is an ongoing question. A healthy place to start is with a class of relatively uncomplicated tiles — triangles! We construct the triangle groups geometrically by reflecting triangles across their three edges and propagating. From here, we can express the group as an algebraic structure. We will explore what properties can be deduced about these groups in both geometric and algebraic contexts as well as the grander implications of how we approach tiling surfaces.
Katherine Burke, Temple University
Abstract: Come one, come all, and learn about the pros and cons of the Jones polynomial as an invariant of a closed 3-braid link. Based Birman’s ‘85 On the Jones Polynomial of Closed 3 Braids.
A panel of soon-to-graduate grad students will describe their experiences and give their advice on how to approach the penultimate and the last years of the PhD program at Temple, including the required paperwork, the job market, and the dissertation process.
Zhi Li, Temple University
Abstract: Understanding the significance and sensitivity of parameters plays an important role in mathematical modeling. A sensitivity analysis of the parameters is not only critical to model validation but also serves to guide future research efforts. We will talk about several of the more practical methods for conducting parameter sensitivity studies, ranging from one-at-a-time sensitivity measures to standardized regression coefficients to statistical tests.
Rose Kaplan-Kelly, Temple University
Abstract: Based on the work of Moon Duchin.
Xinli Yu, Temple University
Abstract: With the advent of parallel computers, many new algorithms were devised or rediscovered for the new architectures. Asynchronous parallel solvers are new techniques that speed up thecomputation time. The main character of asynchronous algorithm is that the local algorithms donot have to wait at predetermined points for predetermined messages to become available. Asynchronous method has wide applications. In this talk applications of asynchronous iterations todifferent areas will be discussed.
Khanh Le, Temple University
Abstract: In this talk, we will discuss left ordering of a group. We will focus on basic examples of groups which admit a left order and properties of the space of left orders. If time permits, we discuss some interesting questions and connections of left ordering on groups to 3-manifold topology.
2012 | 2013 | 2014 | 2015 | 2016 | 2017 | 2018 | 2019 | 2020 | 2021 | 2022