## Discrete Math Seminar

“Generalized Ramsey numbers at the linear and quadratic thresholds.” being presented by Patrick Bennett of Western Michigan University.

“Generalized Ramsey numbers at the linear and quadratic thresholds.” being presented by Patrick Bennett of Western Michigan University.

Speaker: Philip Hackney (U of Louisiana at Lafayette) Abstract: Simplicial objects are a fundamental tool in modern homotopy theory, (higher) category theory, and algebra. We will begin with a brief review / introduction, with an emphasis on the connection to categories, generalizing to the 2-Segal spaces of Dyckerhoff–Kapranov (also called decomposition spaces by Gálvez-Carillo–Kock–Tonks). Any … Continue reading AG Seminar: Free Decomposition Spaces

Speaker: Ryan Jeong, University of Pennsylvania Abstract:Given two simple graphs $X$ and $Y$ on $n$ vertices, the friends-and-strangers graph $\mathsf{FS}(X, Y)$ has as its vertices all $n!$ bijections from $V(X)$ to $V(Y)$, with bijections $\sigma, \tau$ adjacent if and only if they differ on two adjacent elements of $V(X)$ whose mappings are adjacent in $V(Y)$. … Continue reading Discrete Seminar: On the Connectivity and Diameters of Friends-and-Strangers Graphs

Speaker: Siddhartha Mishra, Professor of Mathematics at the Seminar for Applied Mathematics at ETH Zürich Abstract: Operators are mapping between infinite-dimensional spaces and arise in a variety of contexts, particularly in the solution of PDEs. The main aim of this lecture would be to introduce the audience to the rapidly emerging area of operator learning, … Continue reading TrAC seminar: Learning Operators

Speaker: Rana Parshad, Iowa State University (Mathematics) Abstract: Food chain dynamics are the cornerstone of many ecosystems. In this talk we survey some classical three species food chain models. We discuss some recent (and not so recent) results that pertain to invasive species management, synchronization as well as fractional (in time) differential equations.

Speaker: Jonas Hartwig (ISU) Abstract: A Kleinian (or du Val, or simple surface) singularity XX is the set of orbits C2/GC2/G where GG is a finite group of 2×2 matrices of determinant 11. The set XX is a two-dimensional affine variety whose ring of regular functions is C[X]=C[x,y]GC[X]=C[x,y]G, the ring of all GG–invariant polynomials in two variables. Since the action of GGon C2C2 is not free (origin is fixed), XX is a singular variety, hence … Continue reading Algebra Geometry Seminar: Modules over Noncommutative Deformations of Kleinian Singularities

Speaker: Reinhard Laubenbacher, University of Florida Abstract: A Boolean network in n variables is a function from the set of binary strings of length n to itself, defined through n Boolean rules. Boolean networks are used in several applications, from electrical engineering to systems biology. Aside from their usefulness, there are many interesting mathematical … Continue reading Math Colloquium: Structure and dynamics of Boolean networks, with applications to the concept of modularity in biology

Speaker: Konstantin Slutsky, Iowa State University Abstract: (This talk reports on an ongoing joint work with Mikhail Sodin, Aron Wennman and Oren Yakir.) Weierstrass factorization theorem—a classical result in complex analysis—represents any entire function as a (typically infinite) product based on the zeroes of the function. Furthermore, it asserts that any discrete multiset in a … Continue reading Logic Seminar: Borel equivariant inverse to Weierstrass factorization theorem

Speaker: Joey Iverson (ISU) Abstract: How can we arrange lines to pass through the origin without creating sharp angles? This question arises in applications such as compressed sensing, wireless communication, and quantum information theory. For a fixed number of lines in a fixed dimension, an “optimal line packing” is one in which the sharpest angle … Continue reading Algebra Geometry Seminar: Leveraging Symmetry for Optimal Line Packings

Speaker: Debosmita Kundu, Iowa State University (Statistics) Abstract: CUT&RUN is a new method for detecting protein interactions with DNA that is easier to implement than ChIP-seq and can work with less starting DNA. This method combines antibody-targeted controlled cleavage by micrococcal nuclease with massively parallel DNA sequencing to identify DNA fragments bound to a target … Continue reading Math Bio Seminar: Identifying Peaks and Estimating Parameters for CUT&RUN Sequencing Using Branching Process Model