## Events Search and Views Navigation

## March 2017

### Guang Gong – University of Waterloo

Two families of Lightweight Cryptographic Primitives for Securing Internet-of-Things Internet-of-Things at large, has become one of the most important challenges in computing today. Low-end embedded wireless devices are deployed in an increasing number and variety of applications. The integration of web-based and…

Find out more »### Winnie Li – Pennsylvania State University

Modular forms for noncongruence subgroups: an introduction Modular forms for congruence subgroups have been studied for over one century. There are fabulous results and remarkable applications. On the other hand, the arithmetic of modular forms for noncongruence subgroups is much…

Find out more »### Winnie Li – Pennsylvania State University

Modular forms for noncongruence subgroups: recent progress and open problems Modular forms for congruence subgroups have been studied for over one century. There are fabulous results and remarkable applications. On the other hand, the arithmetic of modular forms for noncongruence…

Find out more »## April 2017

### Manami Roy – University of Oklahoma

An introduction to the principle of functoriality I will give a brief introduction to the principle of functoriality, which is one of the central components of the Langlands program. Then we will go over a few examples of the principle…

Find out more »### Manami Roy – University of Oklahoma

Level of Siegel modular forms of degree 2 coming from the $latex Sym^3$ lifting Ramakrishnan and Shahidi used the $latex Sym^3$ lifting to lift a holomorphic elliptic (non-CM) newform $latex f$ of weight $latex 2k$ and level $latex N$ to…

Find out more »### Jessalyn Bolkema – University of Nebraska-Lincoln

The tensor-like join: graph-theoretic insights into polar code performance Arikan's polar codes have been celebrated for their capacity-achieving performance since first presented in 2008; however, the question of optimal finite-length design and decoding remains open. To understand the efficacy of…

Find out more »### Jessalyn Bolkema – University of Nebraska-Lincoln

The tensor-like join: graph-theoretic insights into polar code performance Arikan's polar codes have been celebrated for their capacity-achieving performance since first presented in 2008; however, the question of optimal finite-length design and decoding remains open. To understand the efficacy of…

Find out more »## September 2017

### Introductory lecture

The introductory lecture is aimed at sharing background material so that students are better prepared to understand the main seminar. The introductory lecture is open only to students.

Find out more »### Catherine Hsu – University of Oregon

Higher Eisenstein Congruences In this talk, we examine the relationship between the ``depth" of certain Eisenstein congruences and the local structure of the Eisenstein ideal. Specifically, let $latex p\geq 3$ be prime. For squarefree level $latex N>6$ and weight $latex…

Find out more »