<?xml version="1.0" encoding="UTF-8" ?>
	<rss version="2.0">
		<channel><title>Colloquium</title><link>http://www-math.umd.edu/research/seminars.html</link><description></description><item>
	<title>Orbit equivalence relations and the compact action realization problem</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Wed, 28 Aug 2024 15:15:00 EDT</pubDate>
	<description><![CDATA[When: Wed, August 28, 2024 - 3:15pm<br />Where: Kirwan Hall 3206<br />Speaker: Alexander Kechris (CalTech) - <br />
<br />]]></description>
</item>

<item>
	<title>Multilevel approximation of Gaussian random fields</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Wed, 04 Sep 2024 15:15:00 EDT</pubDate>
	<description><![CDATA[When: Wed, September 4, 2024 - 3:15pm<br />Where: Kirwan Hall 3206<br />Speaker: Christoph Schwab (ETH, Zurich) - https://math.ethz.ch/research/applied-mathematics-numerical-analysis-scientific-computing/christoph-schwab.html<br />
Abstract: Centered Gaussian random fields (GRFs) indexed by compacta<br />
as e.g. compact orientable manifolds M<br />
are determined by their covariance operators.<br />
We consider the numerical analysis of sample-wise, compressive<br />
multi-level wavelet-Galerkin approximations of centered GRFs given<br />
as variational solutions to coloring operator equations driven by spatial white noise,<br />
with pseudodifferential covariance operator being<br />
elliptic, self-adjoint and positive from the Hörmander class.<br />
<br />
For pathwise approximations with p parameters,<br />
tapered covariance or precision matrices have O(p) nonzero entries,<br />
can be optimally diagonally preconditioned,<br />
and allow O(p) path simulation, covariance estimation and kriging of GRFs.<br />
<br />
Joint work with Helmut Harbrecht (Uni Basel).<br />]]></description>
</item>

<item>
	<title>Branching selection particle systems and the selection principle</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Wed, 18 Sep 2024 15:15:00 EDT</pubDate>
	<description><![CDATA[When: Wed, September 18, 2024 - 3:15pm<br />Where: Kirwan Hall 3206<br />Speaker: Julien Berestycki (University of Oxford, Statistics Department) - https://www.stats.ox.ac.uk/~berestyc/<br />
Abstract: The $N$-branching Brownian motion with selection ($N$-BBM) is a particle system consisting of $N$ independent particles that diffuse as Brownian motions in $\mathbb{R}$, branch at rate one, and whose size is kept constant by removing the leftmost particle at each branching event. It is a simple toy model for the evolution of a population under selection that has generated some fascinating research since its introduction by Brunet and Derrida in the early 200ss.<br />
<br />
If one recentre the positions by the left most particle, this system has a stationary distribution. I will show that, as $N\to \infty$ the stationary empirical measure of the $N$-particle system converges to the minimal travelling wave of an associated free boundary PDE. This resolves an open question going back at least to works of e.g. Maillard in 2012.<br />
It follows a recent related result by Oliver Tough (with whom this is joint work) establishing a similar selection principle for the so-called Fleming-Viot particle system.<br />]]></description>
</item>

<item>
	<title>TBA</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Wed, 23 Oct 2024 15:15:00 EDT</pubDate>
	<description><![CDATA[When: Wed, October 23, 2024 - 3:15pm<br />Where: Kirwan Hall 3206<br />Speaker: Artur Avila (IMPA) - <br />
<br />]]></description>
</item>

<item>
	<title>From Generative AI to Statistical Physics Through Harmonic Analysis</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Fri, 25 Oct 2024 16:00:00 EDT</pubDate>
	<description><![CDATA[When: Fri, October 25, 2024 - 4:00pm<br />Where: Kirwan Hall 3206<br />Speaker: Stephane Mallat (College de France) - https://blog.umd.edu/nwc/fft/2024fft/<br />
Abstract: Score based diffusions generate impressive models of images, sounds and complex physical systems. Are they generalising or memorising ? How can deep network estimate high-dimensional scores without curse of dimensionality ? This talk shows that generalisation does occur for deep network estimation of scores, with enough training data. We prove that these deep networks perform a denoising by shrinking image coefficients in a best basis adapted to the image geometry. The ability to avoid the curse of dimensionality seems to rely on multiscale properties revealed by a renormalisation group decomposition coming from statistical physics. Applications to models of turbulences will be introduced and discussed.<br />]]></description>
</item>

<item>
	<title>Intrinsic Diophantine approximation on homogeneous spaces</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Wed, 30 Oct 2024 15:15:00 EDT</pubDate>
	<description><![CDATA[When: Wed, October 30, 2024 - 3:15pm<br />Where: Kirwan Hall 3206<br />Speaker: Amos Nevo (Technion) - <br />
Abstract:     Let G be a Lie group, L a lattice in G, and H a closed subgroup of G.<br />
Suppose that L acts on the homogeneous space G/H with dense orbits. <br />
Naturally, we would like to measure how dense these orbits actually are, or equivalently, gauge the efficiency of approximation of a general point on G/H by a lattice orbit. <br />
    Departing from traditional classical Diophantine approximation, we will <br />
Assume G to be a non-amenable group,  for example the group of isometries of hyperbolic space, or the general linear or affine group. <br />
    We will present a solution to this problem for lattice actions <br />
on a large class of homogeneous spaces, emphasizing a sufficient condition for when an optimal result holds, and give some examples. The methods involve dynamical arguments, and the representation theory of the automorphic representation. <br />
    We will then briefly describe the extensive scope of this set-up, and explain some more refined problems related to equidistribution and discrepancy of lattice orbits, as time permits. <br />
    Based partly on joint work with Alex Gorodnik and Anish Ghosh, and partly on recent joint work with Alex Gorodnik and Mikolaj Fraczyk. <br />]]></description>
</item>

<item>
	<title>Ergodic and statistical properties of slowly chaotic systems</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Wed, 06 Nov 2024 15:15:00 EST</pubDate>
	<description><![CDATA[When: Wed, November 6, 2024 - 3:15pm<br />Where: Kirwan Hall 3206<br />Speaker: Adam Kanigowski (UMD) - https://akanigow.math.umd.edu/<br />
<br />
Title:  Ergodic and statistical properties of slowly chaotic systems<br />
<br />
Abstract: Smooth dynamical systems can be (roughly) divided into three classes: (partially) hyperbolic, parabolic and elliptic. I will shortly discuss some general characteristic features of each of these classes. Then I will focus on the class of parabolic dynamical systems. These systems typically display intermediate type of chaotic behavior (called slow chaos). I will discuss recent developments and results around ergodic and statistical properties for parabolic dynamical systems.<br />]]></description>
</item>

<item>
	<title>Forbidding Induced Subgraphs: Structure and Algorithms (Brin MRC Distinguished Lecture)</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Wed, 13 Nov 2024 15:15:00 EST</pubDate>
	<description><![CDATA[When: Wed, November 13, 2024 - 3:15pm<br />Where: Kirwan Hall 3206<br />Speaker: Maria Chudnovsky  (Princeton University) - https://web.math.princeton.edu/~mchudnov/<br />
Abstract: Tree decompositions are a powerful tool in both structural<br />
graph theory and graph algorithms. Many hard problems<br />
become tractable if the input graph is known to have a tree<br />
decomposition of bounded “width”. Exhibiting a particular kind<br />
of a tree decomposition is also a useful way to describe the<br />
structure of a graph.<br />
<br />
Tree decompositions have traditionally been used in the context<br />
of forbidden graph minors; studying them in connection with<br />
graph containment relations of more local flavor (such as<br />
induced subgraph or induced minors) is a relatively new<br />
research direction. In this talk, we will discuss recent progress in<br />
this area, touching on both the classical notion of bounded<br />
tree-width, and concepts of more structural flavor.<br />]]></description>
</item>

<item>
	<title>TBA</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Wed, 20 Nov 2024 15:30:00 EST</pubDate>
	<description><![CDATA[When: Wed, November 20, 2024 - 3:30pm<br />Where: Kirwan Hall 3206<br />Speaker: Alessio Figalli (ETH Zurich) - https://people.math.ethz.ch/~afigalli/<br />
<br />]]></description>
</item>

<item>
	<title>Martin&#039;s Conjecture and order-preserving functions</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Mon, 09 Dec 2024 15:30:00 EST</pubDate>
	<description><![CDATA[When: Mon, December 9, 2024 - 3:30pm<br />Where: Kirwan Hall 3206<br />Speaker: Patrick Lutz (UC Berkeley) - https://math.berkeley.edu/~pglutz/<br />
Abstract: The field of computability theory studies the complexity of uncomputable problems. In this study, a special role is played by the Halting Problem—i.e. the problem of determining whether a given program stops after a finite number of steps or runs forever. Not only is it the first problem proved to be uncomputable, it also seems to be the simplest &quot;natural&quot; uncomputable problem. Martin&#039;s Conjecture is a long-standing open question in computability theory which partially explains why the Halting Problem plays such a special role. A key idea behind Martin&#039;s Conjecture is to view the Halting Problem not just as an individual problem, but as an operator on problems, which takes any problem to a strictly harder one. Martin&#039;s Conjecture consists of a classification of such operators, which says, in part, that the Halting Problem is the minimal non-trivial operator. I will discuss the background and motivation for Martin&#039;s Conjecture, as well as recent progress by Benjamin Siskind and myself which essentially completes a proof of the conjecture for a special class of operators called &quot;order-preserving.&quot;<br />]]></description>
</item>

<item>
	<title>Continuous spin systems: group synchronisation and topological phase transitions </title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Wed, 11 Dec 2024 15:15:00 EST</pubDate>
	<description><![CDATA[When: Wed, December 11, 2024 - 3:15pm<br />Where: Kirwan Hall 3206<br />Speaker: Christophe Garban  (University of Lyon) - https://math.univ-lyon1.fr/~garban/<br />
Abstract:  One of the main goals of statistical physics is to observe how spins displayed along a lattice Z^d interact together and fluctuate. When the spins belong to a discrete set (for example the celebrated Ising model where spins \sigma_x belong to {-1,+1}), the nature of the phase transitions which arise as one varies the temperature is now rather well understood. When the spins belong instead to a continuous space (for example the unit circle S^1 for the so-called XY model, the unit sphere S^2 for the classical Heisenberg model etc.), the nature of the phase transitions differs drastically from the discrete symmetry setting. The case where the (continuous) symmetry is non-Abelian is currently more mysterious than when the symmetry is Abelian. In the later case, phase transitions are caused by a change of behaviour of certain monodromies in the system called &quot;vortices&quot;. They are called topological phase transitions for this reason.  <br />
In this talk, after an introduction to the mathematics of spin systems with a continuous symmetry, I will present some recent results on these spins systems. One proof will happen to rely on an intriguing Bayesian statistics problem (!).<br />
The talk will not require any background in statistical physics/probability and will be based on joint works with Juhan Aru, Paul Dario, Avelio Sepúlveda and Tom Spencer.<br />]]></description>
</item>

<item>
	<title>Mathematical and Historical Aspects of Breaking the Enigma Code</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Wed, 05 Feb 2025 15:15:00 EST</pubDate>
	<description><![CDATA[When: Wed, February 5, 2025 - 3:15pm<br />Where: Kirwan Hall 3206<br />Speaker: Zbigniew Blocki (Jagiellonian University and UMD) - https://gamma.im.uj.edu.pl/~blocki/<br />
Abstract: Breaking of the Enigma code, encryption used by the Germans in the Second World War, had a huge influence on the outcome of the conflict. Everybody has heard about the Bletchey Park and Alan Turing’s role in it but it is not widely known that in fact it was done by Polish mathematicians led by Marian Rejewski already in December 1932. Only in July 1939 the Polish intelligence shared it with the Allies and only since then the British could follow. We will explain the main mathematical aspects of this work, as well as the historical background.<br />]]></description>
</item>

<item>
	<title>Optimal dimensionality reduction</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Thu, 13 Feb 2025 15:15:00 EST</pubDate>
	<description><![CDATA[When: Thu, February 13, 2025 - 3:15pm<br />Where: Kirwan Hall 3206<br />Speaker:  Albert Cohen  ( Sorbonne University) - https://www.ljll.fr/cohen/<br />
Abstract: Understanding how to optimally approximate general compact sets by finite dimensional spaces is of central interest for designing efficient numerical methods in forward simulation or inverse problems. While the concept of n-width, introduced in 1936 by Kolmogorov, is well taylored to linear methods, finding the correct analogous concept for nonlinear approximation (which typically occurs when using adaptive methods or neural networks) is still the object of current research. In this talk, we shall discuss a general framework that allows to embrace various concepts of linear and nonlinear widths, present some recent results and relevant open problems.<br />]]></description>
</item>

<item>
	<title>Faculty meeting</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Wed, 19 Feb 2025 15:15:00 EST</pubDate>
	<description><![CDATA[When: Wed, February 19, 2025 - 3:15pm<br />Where: <br /><br />]]></description>
</item>

<item>
	<title>On stabilisations of symplectic 4-manifolds</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Wed, 26 Feb 2025 15:15:00 EST</pubDate>
	<description><![CDATA[When: Wed, February 26, 2025 - 3:15pm<br />Where: Kirwan Hall 3206<br />Speaker: Amanda Hirschi (Sorbonne Université) - https://amandahirschi.com/<br />
Abstract: Two simply-connected smooth 4-manifolds are homeomorphic if and only if their product with S^2, are diffeomorphic. The Donaldson 4-6 question ask whether this fact can be lifted to the symplectic category. Explicitly, it conjectures that the underlying smooth manifolds of two (simply-connected) symplectic manifolds are diffeomorphic if and only if their product with S^2, equipped with the standard area form, are symplectic deformation equivalent. I will describe one example of a smooth 4-manifold admitting two symplectic forms which remain deformation inequivalent after taking the product with S^2, giving counterexamples to one implication of the conjecture. On the other hand, I will explain why two symplectic manifolds, whose stabilisations are deformation equivalent, have the same Gromov-Witten invariants. This is joint work with Luya Wang.<br />]]></description>
</item>

<item>
	<title>AWM Talk - Katrin Trent</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Wed, 05 Mar 2025 15:15:00 EST</pubDate>
	<description><![CDATA[When: Wed, March 5, 2025 - 3:15pm<br />Where: Kirwan Hall 3206<br />Speaker: Katrin Tent (University of Münster) - https://www.uni-muenster.de/FB10srvi/persdb/MM-member.php?id=482<br />
Abstract: The Cherlin-Zilber Conjecture states that any infinite simple group of finite Morley rank is an algebraic group over an algebraically closed field. I will explain how work on this conjecture naturally leads to the Burnside problem, namely the question whether any finitely generated group of bounded exponent is finite. I will then indicate the ideas behind our proof with Atkarskaya and Rips which gives the currently best known lower bound for the exponent for infinite Burnside groups.<br />]]></description>
</item>

<item>
	<title>A counterexample to Viterbo&#039;s conjecture</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Wed, 12 Mar 2025 15:15:00 EDT</pubDate>
	<description><![CDATA[When: Wed, March 12, 2025 - 3:15pm<br />Where: Kirwan Hall 3206<br />Speaker: Pazit Haim-Kislev  (Institute for Advanced Study) - https://www.ias.edu/scholars/pazit-haim-kislev<br />
Abstract: Symplectic capacities are, roughly speaking, a means of measuring the &quot;size&quot; of symplectic manifolds, arising from various themes in Hamiltonian dynamics and symplectic topology. Viterbo&#039;s conjecture, an isoperimetric-type question introduced in 2000, asserted that the ball has the largest capacity among all convex domains with the same volume. Despite its simple formulation, this conjecture remained unresolved for many years, sparking extensive research, partly due to its encapsulation of the nontrivial interplay between convex and symplectic geometries. In this talk, I will present a counterexample to Viterbo&#039;s conjecture, based on joint work with Yaron Ostrover, and discuss its implications for further research.<br />]]></description>
</item>

<item>
	<title>The P=W Conjecture</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Wed, 26 Mar 2025 15:15:00 EDT</pubDate>
	<description><![CDATA[When: Wed, March 26, 2025 - 3:15pm<br />Where: Kirwan Hall 3206<br />Speaker: Davesh Maulik (MIT) - https://math.mit.edu/directory/profile.html?pid=177<br />
Abstract: Given a compact Riemann surface, nonabelian Hodge theory relates topological and algebro-geometric objects associated to it. Namely, complex representations of the fundamental group are in correspondence with algebraic vector bundles, equipped with an extra structure called a Higgs field. This gives a transcendental matching between two very different moduli spaces associated with the Riemann surface: the character variety (parameterizing representations of the fundamental group) and the Hitchin moduli space (parameterizing Higgs bundles). In 2010, de Cataldo, Hausel, and Migliorini proposed the P=W conjecture, which predicted that the Hodge theory of the character variety is determined by the topology of the Hitchin space, imposing surprising constraints on each side.   In this talk, I will introduce the conjecture and review its recent proofs; time permitting, I will try to explain how this phenomenon relates to other geometric questions.  <br />]]></description>
</item>

<item>
	<title>Proper graph colouring, optimization, and paradoxical decompositions</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Wed, 09 Apr 2025 15:15:00 EDT</pubDate>
	<description><![CDATA[When: Wed, April 9, 2025 - 3:15pm<br />Where: Kirwan Hall 3206<br />Speaker: Robert Simon (London School of Economics) - https://www.lse.ac.uk/Mathematics/people/Robert-Simon<br />
Abstract: We show that there is an infinite graph of finite degree defined by a Borel<br />
  equivalence relation on a probability space such that it can be coloured<br />
  properly with 17 colours but only in ways that induce paradoxical<br />
  decompositions. We show that there are problems of optimization such that<br />
every epsilon-optimal solution for small enough positive epsilon induces a paradoxical decomposition.<br />
<br />
<br />
<br />
<br />]]></description>
</item>

<item>
	<title>The Unitary Dual (this colloquium is cancelled)</title>
	<link>http://www-math.umd.edu/research/seminars.html</link>
	<pubDate>Wed, 16 Apr 2025 15:15:00 EDT</pubDate>
	<description><![CDATA[When: Wed, April 16, 2025 - 3:15pm<br />Where: Kirwan Hall 3206<br />Speaker: Jeff Adams (IDA-CCS and UMD) - https://www.math.umd.edu/~jda/<br />
Abstract: This talk is an update on the Atlas of Lie Groups and Representations project which was started at UMD in 2002. One of the main problems in representation theory is to describe the unitary dual: the set of irreducible unitary representations of a Lie group. I will describe an algorithm for computing the unitary dual of, and discuss our computer calculations of E_7 and (partially completed) E_8. I will also discuss recent progress on proving Arthur&#039;s conjectures about the unitarity of Arthur packets for real reductive groups. This work is joint with the members of the Atlas project - among others, Lucas Mason-Brown, Stephen Miller, Marc van Leeuwen, Annegret Paul and David Vogan, as well as Dougal Davis and Kari Vilonen.<br />]]></description>
</item>


	</channel>
</rss>