http://www-math.umd.edu/research/seminars.html http://www-math.umd.edu/research/seminars.html Thu, 29 Aug 2024 16:00:00 EDT Where: Kirwan Hall 0103
Speaker: Organizers () -

]]> http://www-math.umd.edu/research/seminars.html Thu, 05 Sep 2024 16:30:00 EDT Where: TBD
Speaker: Connor Lockhart (UMD) -

]]> http://www-math.umd.edu/research/seminars.html Thu, 12 Sep 2024 16:30:00 EDT Where: Toll Physics Building 2208
Speaker: Perrin Ruth (UMD) -
Abstract: The graph theoretic notion of cycle bases are useful for many fields such as for electrical and chemical networks. The structure of the cycle space is a binary vector space that is readily studied using abelian groups, computational algorithms, and optimization. We will discuss key definitions of cycle spaces, their history, and a method for computing cycle bases. Time permitting, we will also discuss minimum cycle bases which are useful for the study of chemical networks.
]]> http://www-math.umd.edu/research/seminars.html Thu, 19 Sep 2024 16:30:00 EDT Where: Toll Physics Building 2208
Speaker: Lixin Zheng (UMD) -
Abstract: For a finite group G, the vertices of the prime graph Γ(G) are the primes that divide |G|, and two vertices p and q are connected by an edge if and only if there is an element of order pq in G. Though this notion was used in the 1970s to study cohomological questions of group rings, prime graphs have been studied for their own sake ever since. In studying prime graphs of a specific class of groups, we encounter interesting number-theoretic questions, overcome computational obstacles, and devise heavy group-theoretic machinery that streamlines further work on the subject.
]]> http://www-math.umd.edu/research/seminars.html Thu, 26 Sep 2024 16:30:00 EDT Where: Toll Physics Building 2208
Speaker: Ziyi Huang (UMD) -
Abstract: Public key cryptography is essential to keeping our data secure. It appears, for example, in emails, our daily transactions, or signature schemes to ensure you always get the correct software updates. Classical public key cryptography relies on the hardness of factoring large primes and the discrete logarithm. However, these can easily be broken by quantum computers. So, the study of post-quantum cryptography is necessary. This talk will focus on isogeny cryptography. In particular, we will discuss the CSIDH relation, which is based on the action of the ideal class group of the order O = Z [√−p] ⊂ Q [√−p] on a family of supersingular elliptic curves over F_p.
]]> http://www-math.umd.edu/research/seminars.html Thu, 10 Oct 2024 16:30:00 EDT Where: Toll Physics Building 2208
Speaker: Brandon Kolstoe (UMD) -
Abstract: While Fourier series and the Fourier Transform are the key tools in harmonic analysis for analyzing the features of functions, they are not well-suited for local analysis or for representing sudden bumps. This has led to the study of wavelets, where functions are represented by the translation and dilations of a single, fixed function called a mother wavelet. In this talk, we shall discuss both the continuous wavelet transform and wavelet series, conditions that the mother wavelet must satisfy to have a admissible wavelet system, and how wavelet bases are constructed.
]]> http://www-math.umd.edu/research/seminars.html Thu, 17 Oct 2024 16:30:00 EDT Where: Toll Physics Building 2208
Speaker: TBD (UMD) -

]]> http://www-math.umd.edu/research/seminars.html Thu, 31 Oct 2024 16:30:00 EDT Where: Toll Physics Building 2208
Speaker: Ethan Dudley (UMD) -

]]> http://www-math.umd.edu/research/seminars.html Thu, 07 Nov 2024 16:30:00 EST Where: Toll Physics Building 2208
Speaker: Frank McBride (UMD) -
Abstract: Reservoir Computing is a recurrent machine learning technique for which most of the components are randomly generated instead of trained. This approach has had success forecasting time series from chaotic systems, and making predictions that preserve the ergodic features of these systems. In other words, Reservoir Computing can both make accurate short- to medium- term predictions—the “weather” of a system—and replicate long-term global patterns—the “climate”. In this talk, I will discuss the basics of how reservoir computing works, important analogies to continuous-time dynamical systems, theoretical results that suggest why it is able to work with so few trained components, and useful applications.
]]> http://www-math.umd.edu/research/seminars.html Thu, 14 Nov 2024 16:30:00 EST Where: Toll Physics Building 2208
Speaker: Max Springer (UMD) -
Abstract: Suppose we have an election with n voters and m candidates, all positioned within an unknown metric space. Our goal is to design a voting rule that selects a candidate who minimizes the average distance to all voters—without direct knowledge of the metric space itself, relying solely on voters' ranked preferences. This challenge, especially relevant in today's political climate, is known as the “metric distortion” problem in algorithmic game theory. In this talk, I’ll introduce the problem, survey major algorithmic results, and highlight open questions that continue to drive research in this field.
]]> http://www-math.umd.edu/research/seminars.html Thu, 21 Nov 2024 16:30:00 EST Where: Toll Physics Building 2208
Speaker: Abdullah Ahmed (UMD) -

]]> http://www-math.umd.edu/research/seminars.html Wed, 29 Jan 2025 16:00:00 EST Where: Physics Building 2122
Speaker: Organizational Meeting () -

]]> http://www-math.umd.edu/research/seminars.html Wed, 19 Feb 2025 17:00:00 EST Where: Physics Building 2122
Speaker: Revati Jadhav (UMD) -

]]> http://www-math.umd.edu/research/seminars.html Wed, 05 Mar 2025 17:00:00 EST Where: Physics Building 2122
Speaker: Dmitrii Gudin (UMD) -

]]> http://www-math.umd.edu/research/seminars.html Wed, 12 Mar 2025 17:00:00 EDT Where: Physics Building 2122
Speaker: Dmitrii Gudin (UMD) -
Abstract: What would happen if we were to reintroduce wolves to the DMV area? How would it affect the local deer population? The Lotka-Volterra model of population dynamics provides a framework for answering such questions. A system of seemingly simple differential equations leads to complex behaviors, featuring bifurcations, numerical instabilities, and counterintuitive results. Let us explore these fascinating properties by considering a variety of modeling scenarios and the model predictions - and how aligned they are with observations in the real world.
]]> http://www-math.umd.edu/research/seminars.html Wed, 26 Mar 2025 17:00:00 EDT Where: Physics Building 2122
Speaker: Max Springer (UMD) -

]]> http://www-math.umd.edu/research/seminars.html Wed, 02 Apr 2025 17:00:00 EDT Where: Physics Building 2122
Speaker: Sam Bachhuber (UMD) -

]]> http://www-math.umd.edu/research/seminars.html Wed, 09 Apr 2025 17:00:00 EDT Where: Physics Building 2122
Speaker: Lixin Zheng (UMD) -

]]> http://www-math.umd.edu/research/seminars.html Wed, 23 Apr 2025 17:00:00 EDT Where: Physics Building 2122
Speaker: Vaughn Osterman (UMD) -

]]>