Ottawa Lectures on Admissible Representations of Reductive P-adic Groups
Ottawa Lectures on Admissible Representations of Reductive P-adic Groups

Author: Clifton Cunningham

Publisher: American Mathematical Soc.

Published: 2009-01-01

Total Pages: 199

ISBN-13: 9780821844939

DOWNLOAD EBOOK

Ottawa Lectures offers researchers and graduate students a rare introduction to some of the major modern themes in the representation theory of $p$-adic groups: the classification and construction of their (complex) admissible representations, the calculation of their characters, and the realization of the celebrated local Langlands correspondence. Recent years have seen significant and rapid progress made toward each of these goals; the purpose of this book is to help bridge the gap from the classical literature to the forefront of research. The first part of this volume is devoted to the tools and techniques used to classify and construct smooth representations of $p$-adic groups: the Bernstein decomposition, Bruhat-Tits theory and filtrations of subgroups, and an overview of J.-K. Yu's construction of supercuspidal representations, together with J.-L. Kim's proof that it is exhaustive. The second part begins with a historical overview of character computations and continues with an introduction to motivic integration. The volume concludes, in the third part, with an introduction to the local Langlands programme and a proof of the local Langlands correspondence for algebraic tori. The chapters, written by leaders in this field, arose from lecture notes of mini-courses delivered at workshops held at the University of Ottawa in 2004 and 2007.

Representations of Reductive p-adic Groups
Representations of Reductive p-adic Groups

Author: Anne-Marie Aubert

Publisher: Springer

Published: 2019-04-16

Total Pages: 297

ISBN-13: 9811366284

DOWNLOAD EBOOK

This book consists of survey articles and original research papers in the representation theory of reductive p-adic groups. In particular, it includes a survey by Anne-Marie Aubert on the enormously influential local Langlands conjectures. The survey gives a precise and accessible formulation of many aspects of the conjectures, highlighting recent refinements, due to the author and her collaborators, and their current status. It also features an extensive account by Colin Bushnell of his work with Henniart on the fine structure of the local Langlands correspondence for general linear groups, beginning with a clear overview of Bushnell–Kutzko’s construction of cuspidal types for such groups. The remaining papers touch on a range of topics in this active area of modern mathematics: group actions on root data, explicit character formulas, classification of discrete series representations, unicity of types, local converse theorems, completions of Hecke algebras, p-adic symmetric spaces. All meet a high level of exposition. The book should be a valuable resource to graduate students and experienced researchers alike.

Arbeitstagung Bonn 2013
Arbeitstagung Bonn 2013

Author: Werner Ballmann

Publisher: Birkhäuser

Published: 2016-11-11

Total Pages: 427

ISBN-13: 3319436481

DOWNLOAD EBOOK

This volume contains selected papers authored by speakers and participants of the 2013 Arbeitstagung, held at the Max Planck Institute for Mathematics in Bonn, Germany, from May 22-28. The 2013 meeting (and this resulting proceedings) was dedicated to the memory of Friedrich Hirzebruch, who passed away on May 27, 2012. Hirzebruch organized the first Arbeitstagung in 1957 with a unique concept that would become its most distinctive feature: the program was not determined beforehand by the organizers, but during the meeting by all participants in an open discussion. This ensured that the talks would be on the latest developments in mathematics and that many important results were presented at the conference for the first time. Written by leading mathematicians, the papers in this volume cover various topics from algebraic geometry, topology, analysis, operator theory, and representation theory and display the breadth and depth of pure mathematics that has always been characteristic of the Arbeitstagung.

Automorphic Forms and Galois Representations
Automorphic Forms and Galois Representations

Author: Fred Diamond

Publisher: Cambridge University Press

Published: 2014-10-16

Total Pages: 387

ISBN-13: 1107693632

DOWNLOAD EBOOK

Part two of a two-volume collection exploring recent developments in number theory related to automorphic forms and Galois representations.

Automorphic Forms and Galois Representations: Volume 2
Automorphic Forms and Galois Representations: Volume 2

Author: Fred Diamond

Publisher: Cambridge University Press

Published: 2014-10-16

Total Pages: 387

ISBN-13: 1316062341

DOWNLOAD EBOOK

Automorphic forms and Galois representations have played a central role in the development of modern number theory, with the former coming to prominence via the celebrated Langlands program and Wiles' proof of Fermat's Last Theorem. This two-volume collection arose from the 94th LMS-EPSRC Durham Symposium on 'Automorphic Forms and Galois Representations' in July 2011, the aim of which was to explore recent developments in this area. The expository articles and research papers across the two volumes reflect recent interest in p-adic methods in number theory and representation theory, as well as recent progress on topics from anabelian geometry to p-adic Hodge theory and the Langlands program. The topics covered in volume two include curves and vector bundles in p-adic Hodge theory, associators, Shimura varieties, the birational section conjecture, and other topics of contemporary interest.

Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization
Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization

Author: Levent Tunçel

Publisher: American Mathematical Soc.

Published: 2016-05-05

Total Pages: 233

ISBN-13: 1470428113

DOWNLOAD EBOOK

Since the early 1960s, polyhedral methods have played a central role in both the theory and practice of combinatorial optimization. Since the early 1990s, a new technique, semidefinite programming, has been increasingly applied to some combinatorial optimization problems. The semidefinite programming problem is the problem of optimizing a linear function of matrix variables, subject to finitely many linear inequalities and the positive semidefiniteness condition on some of the matrix variables. On certain problems, such as maximum cut, maximum satisfiability, maximum stable set and geometric representations of graphs, semidefinite programming techniques yield important new results. This monograph provides the necessary background to work with semidefinite optimization techniques, usually by drawing parallels to the development of polyhedral techniques and with a special focus on combinatorial optimization, graph theory and lift-and-project methods. It allows the reader to rigorously develop the necessary knowledge, tools and skills to work in the area that is at the intersection of combinatorial optimization and semidefinite optimization. A solid background in mathematics at the undergraduate level and some exposure to linear optimization are required. Some familiarity with computational complexity theory and the analysis of algorithms would be helpful. Readers with these prerequisites will appreciate the important open problems and exciting new directions as well as new connections to other areas in mathematical sciences that the book provides.