Related papers: Symmetric functions and random partitions

We give an alternative method to that of Hardy-Ramanujan-Rademacher to derive the leading exponential term in the asymptotic approximation to the partition function p(n,a), defined as the number of decompositions of a positive integer 'n'…

These are (mostly) expository notes for lectures on affine Stanley symmetric functions given at the Fields Institute in 2010. We focus on the algebraic and combinatorial parts of the theory. The notes contain a number of exercises and open…

We study enumeration functions for unimodal sequences of positive integers, where the size of a sequence is the sum of its terms. We survey known results for a number of natural variants of unimodal sequences, including Auluck's generalized…

For a random partition, one of the most basic questions is: what can one expect about the parts which arise? For example, what is the distribution of the parts of random partitions modulo $N$? Since most partitions contain a $1$, and indeed…

Asymptotic statistical theory for estimating functions is reviewed in a generality suitable for stochastic processes. Conditions concerning existence of a consistent estimator, uniqueness, rate of convergence, and the asymptotic…

These are notes of a series of lectures on sieves, presented during the Special Activity in Analytic Number Theory, at the Max-Planck Institute for Mathematics in Bonn, during the period January--June 2002.

The partition function, $p_A(n)$, is defined to be the number of partitions of $n$ with parts in the set A, where $n$ is a positive integer and $A$ is a set of positive integers. It is well documented that: if A is a finite set with…

These notes grew out of lectures given at the LMS-EPSRC Short Course on Asymptotic Methods in Infinite Group Theory, University of Oxford, 9-14 September 2007, organised by Dan Segal.

This document contains notes from the graduate lecture course, "Symmetries in QFT" given by J.F.Wheater at Oxford University in Hilary term. The course gives an informal introduction to QFT.

Inspired by the works of Dewar, Murty and Kot\v{e}\v{s}ovec, we establish some useful theorems for asymptotic formulas. As an application, we obtain asymptotic formulas for the numbers of skew plane partitions and cylindric partitions. We…

This is a brief review paper summarizing talks at the NATO school on Complexity and Large Deviations in Geilo, Norway, 2001.

This habilitation thesis summarizes the research that I have carried out from 2005 to 2019. It is organized in four chapters. The first three deal with random planar maps. Chapter 1 is about their metric properties: from a general…

These lecture notes introduce the basic ideas of the Asymptotic Safety approach to Quantum Einstein Gravity (QEG). In particular they provide the background for recent work on the possibly multifractal structure of the QEG space-times.…

In this lecture note, we give a basic introduction to the rapidly developing concepts of generalized symmetries, from the perspectives of both high energy physics and condensed matter physics. In particular, we emphasize on the (invertible)…

Using an extension of Wright's version of the circle method, we obtain asymptotic formulae for partition ranks similar to formulae for partition cranks which where conjectured by F. Dyson and recently proved by the first author and K.…

The Hardy-Ramanujan partition function asymptotics is a famous result in the asymptotics of combinatorial sequences. It was originally derived using complex analysis and number-theoretic ideas by Hardy and Ramanujan. It was later re-derived…

Lecture notes for the tutorial at the workshop HPOPT 2008 - 10th International Workshop on High Performance Optimization Techniques (Algebraic Structure in Semidefinite Programming), June 11th to 13th, 2008, Tilburg University, The…

Let $P_r(n)$ be the set of partitions of n with non negative rth differences. Let $\lambda$ be a partition chosen uniformly at random among the set $P_r(n)$. Let $d(\lambda)$ be a positive rth difference chosen uniformly at random in…

This is my dissertation. Its research object is a symmetric group of permutations acting on a finite set. The density of permutations with a given cycle structure pattern is explored when the group order tends to infinity. New and sharper…

These notes are based on my four lectures given at the Newton Institute in April 2004 during the Recent Perspectives in Random Matrix Theory and Number Theory Workshop. Their purpose is to introduce the reader to the analytic number theory…