Groups, Probability and Combinatorics: Different Aspects in Gelfand Pairs Theory
نویسندگان
چکیده
منابع مشابه
Gelfand Pairs, Representation Theory of the Symmetric Group, and the Theory of Spherical Functions
This thesis gives an introduction to the study of Gelfand pairs and their applications. We begin with a brief introduction to the notion of a Gelfand pair and then move to some of the foundational results concerning Gelfand pairs. Next, we explore specific examples of Gelfand pairs, developing tools of independent interest as we progress. We find that consideration of a specific example of a Ge...
متن کاملGelfand-Graev Characters of the Finite Unitary Groups
Gelfand-Graev characters and their degenerate counterparts have an important role in the representation theory of finite groups of Lie type. Using a characteristic map to translate the character theory of the finite unitary groups into the language of symmetric functions, we study degenerate Gelfand-Graev characters of the finite unitary group from a combinatorial point of view. In particular, ...
متن کاملSome Applications of Gelfand Pairs to Number Theory
The classical theory of Gelfand pairs has found a wide range of applications, ranging from harmonic analysis on Riemannian symmetric spaces to coding theory. Here we discuss a generalization of this theory, due to Gelfand-Kazhdan, and Bernstein, which was developed to study the representation theory of p-adic groups. We also present some recent number-theoretic results, on local e-factors and o...
متن کاملComparing Graphs of Different Sizes
We consider two notions describing how one finite graph may be larger than another. Using them, we prove several theorems for such pairs that compare the number of spanning trees, the return probabilities of random walks, and the number of independent sets, among other combinatorial quantities. Our methods involve inequalities for determinants, for traces of functions of operators, and for entr...
متن کاملThe Order Steps of an Analytic Combinatorics
Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. This theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology and information theory. With a caref...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008