Free boundary minimal hypersurfaces

Speaker: 

Lucas Ambrozio

Institution: 

University of Chicago

Time: 

Tuesday, June 13, 2017 - 4:00pm to 5:00pm

Location: 

RH 340P

We will review some recent work on free boundary minimal
hypersurfaces. In particular, we will explain a geometric classification
of the critical catenoid (joint with Ivaldo Nunes) and discuss what
information about such hypersurfaces in a general ambient manifold one can
extract from the knowledge of their Morse index (joint with Alessandro
Carlotto and Ben Sharp).

Cryptography Learning Seminar

Speaker: 

Nathan Kaplan and Shahed Sharif

Institution: 

UCI and CSUSM

Time: 

Monday, May 1, 2017 - 3:00pm

Host: 

Location: 

RH 440R

The May 1 meeting will include Nathan continuing the topic from last time, and Shahed discussing the topic below. Suggestions for things to read before the seminar are also given below.

Shahed's abstract:
We will cover the basics of quantum computation, with the goal of understanding Shor's algorithm and, eventually, the Hidden Subgroup Problem as applied to computation of unit groups. Please read the documents linked from the seminar webpage (http://public.csusm.edu/ssharif/crypto/), especially the paper titled QCPrerequisites.pdf:
http://www.qi.damtp.cam.ac.uk/sites/default/files/QCPrerequisites.pdf

Addendum to Shahed's abstract:

I will not assume any of the material in the reading. The specific
sections I will be covering, which you are encouraged to read, are

• Prerequisites paper, sections 1 and 2;
• Lecture 3;
• Lecture 5, sections 1 and 2; and
• Lecture 6, section 1.

5.3 and 6.3 may be worthwhile reading, but I will likely not cover them.

My notes will soon be posted on my webpage.

On self-similar sets with overlaps and inverse theorems for entropy III

Speaker: 

Yuki Takahashi

Institution: 

UC Irvine

Time: 

Tuesday, May 2, 2017 - 1:00pm to 2:00pm

Location: 

RH 440R

We discuss an inverse theorem on the structure of pairs of discrete probability measures which has small amount of growth under convolution, and apply this result to self-similar sets with overlaps to show that if the dimension is less than the generic bound, then there are superexponentially close cylinders at all small enough scales. The results are by M.Hochman. 

Computational modeling of cell decision processes

Speaker: 

James Faeder

Institution: 

Pittsburgh

Time: 

Monday, June 12, 2017 - 4:00pm to 5:00pm

Host: 

Location: 

Nat Sci II 3201

My group uses computational approaches in collaboration with experimental labs to develop better mechanistic understanding of cell decision processes. One of the major challenges in modeling these systems is that the molecular constituents of signaling networks interact in a multitude of ways to form densely connected networks involving hundreds to thousands (and beyond) of distinct biochemical species. Rule-based modeling is an approach to modeling complex biochemical networks in which signaling molecules are represented as structured objects whose interactions are governed by rules, which serve as generators of the species and reactions that comprise the network. This approach enables concise and precise encoding of known molecular biochemistry, freeing the modeler from having to explicitly enumerate the large number of possible species and reactions that can arise in such systems. BioNetGen, which is developed and maintained by my group, is one of several rule-based modeling platforms that enable scalable specification and simulation of large-scale models of signal transduction and other biochemical systems.  In recent years its capabilities for modeling, simulation, and analysis have been greatly expanded and it has been used to model and gain mechanistic understanding of number of important signaling processes. Here, in addition to providing a general introduction to rule-based modeling and describing some recent developments, I will present an application of combined computational and experimental approaches to further mechanistic understanding of signaling through the T cell antigen receptor to control differentiation of T helper cells in the immune system. I will also discuss some recent collaborative work to quantify information flow in a signaling through cytokine receptors. This work suggests that previous estimates of the limiting effects of noise on signal flow may have underestimated the capacity of these biochemical systems to transmit information within the cell. 

An embedding theorem: differential geometry behind massive data analysis

Speaker: 

Chen-Yun Lin

Institution: 

University of Toronto

Time: 

Tuesday, May 23, 2017 - 3:00pm to 4:00pm

Host: 

Location: 

RH 306

High-dimensional data can be difficult to analyze. Assume data are distributed on a low-dimensional manifold. The Vector Diffusion Mapping (VDM), introduced by Singer-Wu, is a non-linear dimension reduction technique and is shown robust to noise. It has applications in cryo-electron microscopy and image denoising and has potential application in time-frequency analysis.

 
In this talk, I will present a theoretical analysis of the effectiveness of the VDM. Specifically, I will discuss parametrisation of the manifold and an embedding which is equivalent to the truncated VDM. In the differential geometry language, I use eigen-vector fields of the connection Laplacian operator to construct local coordinate charts that depend only on geometric properties of the manifold. Next, I use the coordinate charts to embed the entire manifold into a finite-dimensional Euclidean space. The proof of the results relies on solving the elliptic system and provide estimates for eigenvector fields and the heat kernel and their gradients.

 

 

Pages

Subscribe to UCI Mathematics RSS