A (Z⊕Z)-family of knot quandles (Jim Hoste, Pitzer College)
Suppose K is an oriented knot in a 3-manifold M with regular neighborhood N (K). For each element γ ∈ π 1 (∂N (K)) we define a quandle Q γ […]
Suppose K is an oriented knot in a 3-manifold M with regular neighborhood N (K). For each element γ ∈ π 1 (∂N (K)) we define a quandle Q γ […]
Data is exploding at a faster rate than computer architectures can handle. For that reason, mathematical techniques to analyze large-scale data need be developed. Stochastic iterative algorithms have gained interest […]
Augusta Ada Byron King Lovelace (1815-1852) is today celebrated as the first computer programmer in history. This might be confusing to some because in 1852 there were no machines that looked like what we call computers today. In this talk I attempt to explain what Ada really did, and delineate the mathematics involved. Bernoulli numbers […]
Mathematics isnt done in a void: its done by groups of people. Those groups have different norms and values, which affect both who wants to engage in math and the mathematics itself being done. When thinking about diversity and inclusion, explicitly examining norms within our communities can get us a long way. Through a Thomas […]
Knotting in proteins was once considered exceedingly rare. However, systematic analyses of solved protein structures over the last two decades have demonstrated the existence of many deeply knotted proteins, and researchers now hypothesize that the knotting presents some functional or evolutionary advantage for those proteins. Unfortunately, there is very little known (whether experimentally, through […]
One of the main drivers of current research in geometry is the classification of Calabi-Yau threefolds. Towards this effort, a particular approach in algebraic geometry is via the study of stability conditions. In this talk, I will explain what constitutes a notion of stability in algebraic geometry, and what the challenges are in studying them.
As titled
The classical Frobenius problem asks for the largest integer not representable as a non-negative integer linear combination of a relatively prime integer n-tuple. This problem and its various generalizations have been studied extensively in combinatorics, number theory, algebra, theoretical computer science and probability theory. In this talk, we will consider a reformulation of this problem […]
CLAREMONT CENTER for MATHEMATICAL SCIENCES Fall 2019 Poster Session Click here for poster abstracts.
We investigate a hybrid inverse problem in fluorescence ultrasound modulated optical tomography (fUMOT) in the diffusive regime. We prove that the boundary measurement of the photon currents allows unique and […]
In Euclidean geometry, the sum of two sides of any triangle is greater than the third side. We introduce this idea to labeling of graphs. A (p,q)-graph G=(V,E) is said to be in Euclid(0) if there exists a bijection f: V(G) --> {1,…,p} such that for each induced C3 subgraph with vertices {v1,v2,v3} with f(v1)<f(v2)<f(v3) we […]
Title: Biquandle Brackets and Knotoids Abstract: Biquandle brackets are a type of quantum enhancement of the biquandle counting invariant for oriented knots and links, defined by a set of skein […]