$University of Colorado Boulder$

Search

Algebraic Geometry Algebra/Logic DeLong Diversity Functional Analysis Geometry/Analysis Init Conditions Kempner Lie Theory MathClub Math Phys Noncomm Geometry Number Theory Probability Rep Theory Grad Student Seminar Thesis Defenses Topology Ulam Math Edu

Events for the weeks of April 28th – May 10th

Print these events

Tue, Apr. 30 1:25pm (online)	Algebra/Logic Guenter Pilz (JKU Linz, Austria) View Online:https://cuboulder.zoom.us/j/96896272260 X Algebraists like decompositions, for doing parallel computing, etc. Some decompositions are very "successful", some others are not. We try to find the "reasons of sucess" by looking at various instants, including decompositions of semisimple rings. We also get "Generalized Discrete Fourier Transforms" for group rings and related structures. Finally, we try to solve equations of degree >4. This is joint work with Manuel Kauers. Which (sub)direct decompositions are "useful"?
Tue, Apr. 30 3:30pm (MATH 3…	Topology Sarah Petersen X This talk will describe some of the history and background of one of the oldest (now solved) problems in algebraic topology. An Introduction to the Kervaire Invariant Problem
Wed, May. 1 3:30pm (MATH 3…	Math Phys Howy Jordan (CU Boulder, Department of Mathematics) Infinite Dimensional Control Theory
Thu, May. 2 11:15am (MATH …	Algebraic Geometry Luca Schaffler (Universita Roma Tre) X Given the moduli space of hyperplanes in projective space, V. Alexeev constructed a family of compactifications parametrizing stable hyperplane arrangements with respect to given weights. In particular, there is a toric compactification that generalizes the Losev–Manin compactification for the moduli of points on the line. We study the first natural wall crossing that modifies this compactification into a non-toric one by varying the weights. In particular, we prove that in dimensions two the wall crossing corresponds to blowing up at the identity of the dense torus of the generalized Losev–Manin space. As an application, we show that any Q-factorialization of this blow-up is not a Mori dream space for a sufficiently high number of lines. This is joint work in progress with Patricio Gallardo. An explicit wall crossing for the moduli space of hyperplane arrangements Sponsored by the Meyer Fund
Thu, May. 2 12:15pm (Math …	Algebraic Geometry Farbod Shokrieh (University of Washington) X I will describe some connections between arithmetic of abelian varieties, non-archimedean/tropical geometry, and combinatorics. For example, we give formulas for (non-archimedean) canonical local heights in terms of tropical geometry. Our formulas extend classical computations of local height functions due to Néron (involving Néron models) and, in the case of elliptic curves, due to Tate (involving Bernoulli polynomials). Based on joint work with Robin de Jong. Canonical local heights and tropical theta functions Sponsored by the Simons Foundation
Thu, May. 2 3:35pm (MATH 3…	Probability Vishesh Jain (University of Illinois at Chicago) X Markov chains provide a natural approach to sample from various distributions on the independent sets of a graph. For the uniform distribution on independent sets of a given size $k$ in a graph, perhaps the most natural Markov chain is the so-called ``down-up walk''. The down-up walk, which essentially goes back to the foundational work of Metropolis, Rosenbluth, Rosenbluth, Teller and Teller on the Markov Chain Monte Carlo method, starts at an arbitrary independent set of size $k$ , and in every step, removes an element uniformly at random and adds a uniformly random legal choice. Davies and Perkins showed that there is a critical $k = α(Δ)n$ such that it is hard to (approximately) sample from the uniform distribution on independent sets for the class of graphs $G$ with $n$ vertices and maximum degree at most $Δ$ . They conjectured that for $k$ below this critical value, the down-up walk mixes in polynomial time. I will discuss a resolution of this conjecture, which additionally shows that the down-up walk mixes in (optimal) time $OΔ(nn)$ . Based on joint work with Marcus Michelen, Huy Tuan Pham, and Thuy-Duong Vuong. Optimal mixing of the down-up walk on fixed-size independent sets
Tue, May. 7 12:10pm (MATH …	Kempner Luis David Garcia Puente (Colorado College) X Let G be a finite, connected graph. An arithmetical structure on G is an assignment of positive integers to the vertices such that, at each vertex, its label divides the sum of the labels at adjacent vertices (counted w/ multiplicity). Arithmetical structures naturally generalize the notion of the Laplacian matrix of a graph. They also appear in the context of arithmetical geometry. In this talk, I will present a general introduction to the topic, we will focus on the combinatorics of arithmetical structures on certain graph families including some counting results that relate arithmetical structures on a path graph and Catalan numbers. We will also discuss some results about the associated finite Abelian group of an arithmetical structure. What is an arithmetical structure? Sponsored by the Meyer Fund
Tue, May. 7 2:30pm (MATH 3…	Lie Theory Lucas Gagnon (York University) X TBD TBD Sponsored by the Meyer Fund

Return to the top of the page