Counting Simultaneous Core Partitions

Speaker: 

Hayan Nam

Institution: 

University of California, Irvine - Department of Mathematics

Time: 

Monday, May 22, 2017 - 4:00pm to 4:50pm

Location: 

Rowland Hall 340N

A partition with no hook lengths divisible by a is called an a-core partition. For two coprime numbers a and b, a partition is called an (a,b)-core partition if it is both a-core and b-core partition. It is well-known that the number of a-core partitions is infinite, and Anderson proved the number of (a,b)-core partitions is a rational Catalan number. Inspired by work of Johnson, we give an expression for the number of (a,b,c)-core partitions. This is ongoing work with Jineon Baek and Myungjun Yu.

Isometric embeddings via heat kernel

Speaker: 

Ke Zhu

Institution: 

Minnesota State University

Time: 

Monday, June 5, 2017 - 4:00pm

Location: 

RH 340N

The Nash embedding theorem states that every Riemannian
manifold can be isometrically embedded into some Euclidean space with
dimension bound. Isometric means preserving the length of every
path. Nash's proof involves sophisticated perturbations of the
initial embedding, so not much is known about the geometry of the
resulted embedding.
     In this talk, using the eigenfunctions of the Laplacian
operator, we construct canonical isometric embeddings of compact
Riemannian manifolds into Euclidean spaces, and study the geometry of
embedded images. They turn out to have large mean curvature
(intuitively, very bumpy), but the extent of oscillation is about the
same at every point. More can be said about global quantities like
the center of mass. This is a joint work with Xiaowei Wang.

Use of Statistical Tools and Mathematical Concepts in Redistricting

Speaker: 

Bernard Grofman

Institution: 

UCI

Time: 

Thursday, May 18, 2017 - 11:00am

Host: 

Location: 

NS2 1201

My talk will cover two key areas of voting rights in the area of redistricting: partisan gerrymandering and racial gerrymandering.  In the 30 years since Davis v. Bandemer 106 S. Ct. 2797 (1986) declared that partisan gerrymandering was indeed justiciable, there has been only one federal court that has struck down a single seat plurality election-based plan as an unconstitutional partisan gerrymander. The finding of unconstitutionality in that legislative case from Wisconsin, Whitford v. Gill, No. 15-cv-421-bbc, United States District Court, W.D. Wisconsin, decided in November 2016, is now on appeal to the U.S. Supreme Court. Earlier courts confronting partisan gerrymandering challenges had insisted that there were no clear and manageable standards to separate out "ordinary" politics from unconstitutional gerrymandering.  Beginning with a definition of gerrymandering, I offer a multi-componented standard that has as necessary conditions (a) a clear and severe injury involving a disparate impact on a political party that serves as the vehicle for the expression of particular ideas and values, (b) effects that can be expected to be durable, (c) effects that can be shown NOT to be explicable by chance nor explicable by specific features of the electoral geography that impact all plans, (d) compelling direct or indirect evidence of partisan intent  and (e) evidence that there exist one or more remedial plans that address the constitutional violation while also satisfying, on balance, all relevant constitutional and statutory criteria at least as well as the challenged plan.  Here "neutral" treatment as the baseline for comparison. Implementing this test requires the application of a number of different statistical ideas.  In particular, the concept of disparate impact is related to the mathematical/statistical ideal of asymmetry in seats-votes distributions.  I will also talk about racial gerrymandering and the problem of avoiding, on the one hand, situations where racial concerns play too great a role in districting and avoiding on the other hand, situations where race has not adequately been taken into account, leading to the unconstitutional dilution of minority voting strength.  Here I will talk about the application of statistical  tests for racially polarized voting and the implementation, in the districting context, of mathematical ideas such a compactness and contiguity, as well as the definition of terms such as "packing" and "cracking."

 

The Sphere Covering Inequality and Its Applications

Speaker: 

Amir Moradifam

Institution: 

UC Riverside

Time: 

Tuesday, May 30, 2017 - 3:00pm

Host: 

Location: 

RH 306

We show that the total area of two distinct Gaussian curvature 1 surfaces with the same conformal factor on the boundary, which are also conformal to the Euclidean unit disk, must be at least 4π. In other words, the areas of these surfaces must cover the whole unit sphere after a proper rearrangement. We refer to this lower bound of total areas as the Sphere Covering Inequality. This inequality and it's generalizations are applied to a number of open problems related to Moser-Trudinger type inequalities, mean field equations and Onsager vortices, etc, and yield optimal results. In particular we confirm the best constant of a Moser-Truidinger type inequality conjectured by A. Chang and P. Yang in 1987. This is a joint work Changfeng Gui.

 

Deep learning in vision and language intelligence

Speaker: 

Xiaodong He

Institution: 

Microsoft Research

Time: 

Thursday, May 25, 2017 - 4:00pm to 5:00pm

Host: 

Location: 

RH 306

Deep learning, which exploits multiple levels of data representations that give rise to hierarchies of concept abstraction, has been the driving force in the recent resurgence of Artificial Intelligence (AI). In this talk, I will summarize rapid advances in cognitive AI, particularly including comprehension, reasoning, and generation across vision and natural language, and applications in vision-to-text captioning, text-to-image synthesis, and reasoning grounded on images for question answering and dialog. I will also discuss future AI breakthrough that will benefit from multi-modal intelligence, which empowers the communication between humans and the real world and enables enormous scenarios such as universal chat-bot and intelligent augmented reality.

Hallgren's algorithm for solving Pell's equation

Speaker: 

Shahed Sharif

Institution: 

CSUSM and UCI

Time: 

Monday, May 8, 2017 - 3:00pm

Host: 

Location: 

RH 440R

We will complete our discussion of Shor's algorithm for
factoring integers. Then we will begin discussing Hallgren's quantum
polynomial-time algorithm for solving Pell's equation x^2 - dy^2 = 1.
The paper can be found at

http://public.csusm.edu/ssharif/crypto/

Hallgren's idea is to adapt Shor's algorithm to estimate the regulator
of Q(\sqrt{d}), and recover a fundamental unit from the regulator. This
algorithm also provides the main ideas in the quantum unit group
algorithm of Eisentr\"ager, Hallgren, Kitaev, and Song.

Equivariant eta forms and differential K theory

Speaker: 

Bo Liu

Institution: 

UC Santa Barbara

Time: 

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

Location: 

RH 306

The eta form of Bismut–Cheeger is the higher degree version of the Atiyah-Patodi-Singer eta invariant, i.e. it is exactly the boundary correction term in the family index theorem for manifolds with boundary. In this talk, I'll study the properties of eta forms and extend them to the equivariant version for compact Lie group action. Moreover, the applications of eta forms in differential K theory will be discussed.

Pages

Subscribe to UCI Mathematics RSS