Subspace codes for network error correction

Speaker: 

Fangwei Fu

Institution: 

Chern Institute of Mathematics, Nankai University

Time: 

Tuesday, April 23, 2013 - 3:00pm to 4:00pm

Host: 

Location: 

RH 340N

Subspace codes were introduced by Koetter and Kschischang in 2007 as network error- correcting codes. Constant dimension codes is an important class of subspace codes. In this talk, we review and survey some bounds, constructions, decoding algorithm and application background for subspace codes and constant dimension codes.

Structured Sparse Representations with Coherent Dictionaries Based on Ratio and Difference of L1 and L2 Norms

Speaker: 

Jack Xin

Institution: 

UC Irvine

Time: 

Friday, April 19, 2013 - 4:00pm

Location: 

MSTB 120

De-mixing problems in spectroscopic imaging often require finding sparse non-negative linear combinations of library functions to match observed data. Due to misalignment and uncertainty in data measurement, the known library functions may not represent the data as well as their proper deformations. To improve data adaptivity, we expand the library to one with a group structure and impose a structured sparsity constraint so that the coefficients for each group should be sparse or even 1-sparse. Since the expanded library is a highly coherent (redundant) dictionary, it is difficult to obtain good solutions using convex methods such as non-negative least squares (NNLS) or L1 norm minimization. We study efficient non-convex penalties such as the ratio/difference of L1 and L2 norms, as sparsity penalties to be added to the objective in NNLS-type models. We show an exact recovery theory of the sparsest solution by minimizing the ratio/difference norms under a uniformity condition. For solving the related unconstrained non-convex models, we develop a scaled gradient projection algorithm that requires solving a sequence of strongly convex quadratic programs.

 

How do Computers Use Mathematics to Solve Real World Problems: A Glimpse into Computational Mathematics

Speaker: 

Hongkai Zhao

Institution: 

UC Irvine

Time: 

Friday, April 5, 2013 - 4:00pm

Location: 

MSTB 120

 

I will use concrete examples to argue why mathematics is even more important and powerful when computers become more and more powerful and to show what computational mathematics is about.

Overdamped diffusive systems: theory and experiment.

Speaker: 

Janek Wehr

Institution: 

University of Arizona

Time: 

Tuesday, April 30, 2013 - 11:00am to 12:00pm

I will describe a circle of results on the Smoluchowski-Kramers limit in
systems of stochastic differential equations.  Some of them were directly
motivated by experiments, others suggest further laboratory work.  In each
case we identify a noise-induced drift which significantly changes the
observed properties of the system.  This is a joint work with experimental
physicists:  Giovanni Volpe (Bilkent University, Ankara) and Giuseppe
Pesce (University of Naples)  and with Scott Hottovy and Austin
McDaniel---graduate students at the University of Arizona.

A new rearrangement inequality around infinity and applications to Lévy processes.

Speaker: 

Alexander Drewitz

Institution: 

Columbia University

Time: 

Tuesday, April 16, 2013 - 11:00am to 12:00pm

Location: 

Rowland Hall 306

We start with showing how rearrangement inequalities may be used in probabilistic contexts such as e.g. for obtaining bounds on survival probabilities in trapping models. This naturally motivates the need for a new rearrangement inequality which can be interpreted as involving symmetric rearrangements around infinity. After outlining the proof of this inequality we proceed to give some further applications to the volume of Lévy sausages as well as to capacities for Lévy processes.
(Joint work with P. Sousi and R. Sun)

Convergence of solutions of p-adic differential equations

Speaker: 

Kiran Kedlaya

Institution: 

UCSD

Time: 

Tuesday, May 21, 2013 - 2:00pm

Location: 

RH 306

Given an ordinary differential equation whose coefficients are
meromorphic functions of a complex variable, the only obstruction to
convergence of local solutions in a disc is the presence of
singularities within the disc. It was observed decades ago that this
fails if one replaces "complex" by "p-adic", e.g., consider the
exponential function. In recent work of Baldassarri, Poineau, Pulita,
and the speaker, it has emerged that the convergence properties of such
solutions in the p-adic case can be described quite simply in terms of
Berkovich analytic geometry. We will give this description (without
assuming any prior familiarity with Berkovich's theory) and mention some
applications to studying wild ramification of covers of p-adic curves.

Base change lifting of families of p-adic automorphic representations

Speaker: 

Zhengyu Xiang

Institution: 

UCLA

Time: 

Tuesday, May 28, 2013 - 2:00pm

Location: 

RH 306

Let G be a reductive group satisfying the Harish-Chandra condition defined over a totally real field F, E/F a finite cyclic extension of fields. With further assumptions on G, by constructing an explicit morphism between eigenvarities, we prove that every p-adic family of p-adic automorphic representations of G over F can be lifted to a family of p-adic automorphic representations of G over E such that , at every classical point, the lifting is just the classical weak base change lifting. The key ingredients in the theory are: (1) a twisted p-adic trace formula for G/E ; (2) a p-adic fundamental lemma and an equation between p-adic trace formula and twisted p-adic trace formula; (3) a second construction of a twisted eigenvariety of G/E.

Pages

Subscribe to UCI Mathematics RSS