Clustering in image analysis is a central technique that allows to classify elements of an image. We describe a simple clustering technique that uses the method of similarity matrices, and an algorithm in which a collection of image elements is treated as a dynamical system. Efficient clustering in this framework is achieved if the dynamical system admits […]
Mathematicians like to count things. Often in very complicated and fancy ways. In this talk I will explain how we can use quantum Airy structures -- an abstract formalism recently […]
This triple-header of topology talks will include three speakers: First, Hyeran Cho from The Ohio State University will speak about Derivation of Schubert normal forms of 2-bridge knots from (1,1)-diagrams. In this talk, we show that the dual (1, 1)-diagram of a (1, 1)-diagram (a.k.a. a two pointed genus one Heegaard diagram) D(a, 0, 1, […]
A fascinating fact on mathematics is that there are many interesting connections between seemingly different mathematical disciplines. In this talk, I will present a surprising formula counting integral points on polygons and sketch its proof. We will see a delightful interaction between algebra, combinatorics, and geometry. This talk aims primarily for undergraduate students. No prerequisite […]
We review some recent developments in the study of biquandle brackets and other quantum enhancements.
The bridge distance and the topological index are measures of the complexity of the bridge splitting of a knot. In 2016, Johnson and Moriah gave a formula for the bridge […]
Silica-based glasses are increasingly becoming vital components in our current technology, from optical data transmission lines, to electronics, to optical lenses, to smartphone screens. These materials are inherently brittle and subject to failure under shock, non-equilibrium stress states, or corrosive environments. Identifying new compositions and processing conditions that result in improved fracture resistance (i.e. a […]
Joan Ponce Purdue University Abstract: One of the main challenges of mathematical modeling is the balance between simplifying assumptions and incorporating sufficient complexity for the model to provide more accurate and […]
At the turn of the twentieth century, physicist Henri Bénard heated a shallow plate of fluid from below. For temperatures above a critical value, the fluid’s evenly heated state became unstable […]
Domination in graphs has been an important and active topic in graph theory for over 40 years. It has immediate applications in visibility and controllability. In this talk we will discuss a generalization of domination called exponential domination. A vertex $v$ in an exponential dominating set assigns weight $2^{1−dist(v,u)}$ to vertex $u$. An exponential dominating […]
Probability is a now-classic tool in combinatorics, especially graph theory. Some applications of probabilistic techniques are: (1) describing the typical/expected properties of a class of objects, (2) uncovering phase transitions and sudden thresholds in the dependence of one property on another, and (3) producing examples of conjectured or unusual objects. (This last technique is sometimes […]
Shannons sampling theorem provides a link between the continuous and thediscrete realms stating that bandlimited signals are uniquely determined by itsvalues on a discrete set. This theorem is realized in […]
