<?xml version="1.0" encoding="UTF-8" ?>
	<rss version="2.0">
		<channel><title>JAMS Student Seminar</title><link>http://www-math.umd.edu/research/seminars.html</link><description></description><item>
	<title>What is almost purity?</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Thu, 18 Sep 2025 16:30:00 EDT</pubDate>
	<description><![CDATA[When: Thu, September 18, 2025 - 4:30pm<br />Where: Kirwan Hall 1308<br />Speaker: Ziyi Huang (UMD) - <br />
Abstract: We explain what classical Zariski-Nagata purity and Faltings&#039;s almost purity are and their relations. We will give some examples and provide a (hopefully) down-to-earth explanation of almost mathematics, which is a crucial technical tool.<br />]]></description>
</item>

<item>
	<title>What is learning to optimize?</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Thu, 02 Oct 2025 16:30:00 EDT</pubDate>
	<description><![CDATA[When: Thu, October 2, 2025 - 4:30pm<br />Where: Kirwan Hall 1308<br />Speaker: Cameron Austin (UMD) - <br />
Abstract: Learning to optimize (L2O) is an approach to optimization that leverages machine learning techniques for the discovery of novel optimization algorithms. In this talk, we will discuss some examples of this approach -- neural network optimizers and symbolic optimizers, among others if time permits -- as well as some present limitations.  <br />]]></description>
</item>

<item>
	<title>What is. . . a surreal number?</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Thu, 09 Oct 2025 16:30:00 EDT</pubDate>
	<description><![CDATA[When: Thu, October 9, 2025 - 4:30pm<br />Where: Kirwan Hall 1308<br />Speaker:  Lixin Zheng (UMD) - <br />
Abstract: In this interactive presentation, we will view combinatorial game theory through a rather arboreal lens: the game of Hackenbush. We&#039;ll take a guided, scenic stroll through the forest of games (no background required!) and develop the theory in a natural way. Along the way, we&#039;ll encounter some really tall trees, numbers both real and surreal, and maybe even revisit some numbers.<br />]]></description>
</item>

<item>
	<title>What is... a stochastic gradient?</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Thu, 23 Oct 2025 16:30:00 EDT</pubDate>
	<description><![CDATA[When: Thu, October 23, 2025 - 4:30pm<br />Where: Kirwan Hall 1308<br />Speaker: Nicholas Wu (UMD) - https://sladjkf.github.io<br />
Abstract: Stochastic gradients are now commonly used in modern machine learning. But where do they come from and where else are they used? This talk will explore stochastic gradients (mostly from a simulation-based viewpoint) and discuss some applications and examples of stochastic gradients.<br />]]></description>
</item>

<item>
	<title>What is mathematical biology?</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Thu, 06 Nov 2025 16:30:00 EST</pubDate>
	<description><![CDATA[When: Thu, November 6, 2025 - 4:30pm<br />Where: Kirwan Hall 1308<br />Speaker: Darsh Gandhi (UMD) - <br />
Abstract: Mathematical biology is a vast field which has experienced rapid growth over the past 50 years. But what is mathematical biology? What questions can be (or have been) answered, and what are researchers investigating now? In this talk, we will present a brief survey of the field and then focus on a few recent student-led works in ecology, oncology, and infectious disease modeling.<br />]]></description>
</item>

<item>
	<title> Fourier Decompositions of Wallpatterns</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Thu, 20 Nov 2025 16:30:00 EST</pubDate>
	<description><![CDATA[When: Thu, November 20, 2025 - 4:30pm<br />Where: Kirwan Hall 1308<br />Speaker:  Nicholas McConnell (UMD) - <br />
Abstract: A periodic function on the real line can be decomposed as a sum of trigonometric waves.  But suppose we care about the two-dimensional repeating patterns we see on wallpaper and textiles? With each symmetry type, there is a specific collection of functions that build up its patterns. In this talk, we shall derive these functions.<br />]]></description>
</item>

<item>
	<title> What is ... Topological Data Analysis?</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Thu, 04 Dec 2025 16:30:00 EST</pubDate>
	<description><![CDATA[When: Thu, December 4, 2025 - 4:30pm<br />Where: Kirwan Hall 1308<br />Speaker: Nicole Abreu (UMD) - <br />
Abstract: Topological Data Analysis (TDA) is a relatively new field that utilizes foundational results and ideas from algebraic topology and computational geometry to analyze the geometric properties of various types of datasets. All one needs is a dataset with some notion of distance between points (not necessarily a metric), and TDA offers many tools that reveal robust qualitative information about the dataset&#039;s structure by, in a sense, &#039;blurring&#039; the dataset and observing which topological characteristics emerge. In this presentation, I will introduce TDA and the motivation behind it, TDA tools such as Persistent Homology and the Mapper Algorithm, and some applications of TDA to real-world problems in fields such as neuroscience, basketball, and epidemiology. Feel free to join along (no prior knowledge of algebraic topology required) to explore how you can use TDA to blur your eyes and see a clearer picture!<br />]]></description>
</item>

<item>
	<title>What is.... Abstract Topological Dynamics?</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Thu, 16 Apr 2026 16:30:00 EDT</pubDate>
	<description><![CDATA[When: Thu, April 16, 2026 - 4:30pm<br />Where: Kirwan Hall 1308<br />Speaker: Carlos Estrada () - <br />
Abstract: In this talk we (will try to) survey the basics of what is known as Abstract Topological Dynamics of Topological Groups and its relation with Structural Ramsey Theory. <br />
<br />
In a nutshell, we will cover a natural framework on which it should be clear that<br />
<br />
1.- The Classical Ramsey Theorem is equivalent to the fact that the order-automorphism group of the rational numbers fixes a point on every compact space on which it continuously acts, and that<br />
<br />
2.- The space of linear orders over the natural numbers is universal among the class of compact spaces admitting a continuous minimal action of the group of bijections of the natural numbers equipped with the pointwise convergence topology.<br />
<br />]]></description>
</item>

<item>
	<title>What are... Core Diagrams?</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Thu, 23 Apr 2026 16:30:00 EDT</pubDate>
	<description><![CDATA[When: Thu, April 23, 2026 - 4:30pm<br />Where: Kirwan Hall 1308<br />Speaker: Samuel Bachhuber () - <br />
Abstract: This talk will explore what it means to be a core diagram as well as some of the combinatorics of colored Young diagrams, among other things.<br />
<br />]]></description>
</item>


	</channel>
</rss>