Linear evolution equations, such as the heat equation, are commonly studied on finite spatial domains via initial-boundary value problems. In place of the boundary conditions, we consider “multipoint conditions”, where […]
A triple of natural numbers (a,b,c) is an S-set if a+b=c. I. Schur used the S-sets to show that for n >3, there exists s(n) such that for prime p […]
Abstract: In this talk, a conformal mapping approach to shape optimization problems on planar domains will be discussed. In particular, spectral methods based on conformal mappings are proposed to solve Steklov eigenvalues and their related shape optimization problems in two dimensions. To apply spectral methods, we first reformulate the Steklov eigenvalue problem in the complex domain […]
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 […]
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 […]
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.
