Statistics on Graphs, Exponential Formula and Combinatorial Physics

The concern of this paper is a famous combinatorial formula known under the name "exponential formula". It occurs quite naturally in many contexts (physics, mathematics, computer science). Roughly speaking, it expresses that the exponential generating function of a whole structure is equal to the exponential of those of connected substructures. Keeping this descriptive statement as a guideline, we develop a general framework to handle many different situations in which the exponential formula can be applied

Dobinski-type relations: Some properties and physical applications

We introduce a generalization of the Dobinski relation through which we define a family of Bell-type numbers and polynomials. For all these sequences we find the weight function of the moment problem and give their generating functions. We provide a physical motivation of this extension in the context of the boson normal ordering problem and its relation to an extension of the Kerr Hamiltonian.Comment: 7 pages, 1 figur

Dobinski-type relations and the Log-normal distribution

We consider sequences of generalized Bell numbers B(n), n=0,1,... for which there exist Dobinski-type summation formulas; that is, where B(n) is represented as an infinite sum over k of terms P(k)^n/D(k). These include the standard Bell numbers and their generalizations appearing in the normal ordering of powers of boson monomials, as well as variants of the "ordered" Bell numbers. For any such B we demonstrate that every positive integral power of B(m(n)), where m(n) is a quadratic function of n with positive integral coefficients, is the n-th moment of a positive function on the positive real axis, given by a weighted infinite sum of log-normal distributions.Comment: 7 pages, 2 Figure

Hierarchical Dobinski-type relations via substitution and the moment problem

We consider the transformation properties of integer sequences arising from the normal ordering of exponentiated boson ([a,a*]=1) monomials of the form exp(x (a*)^r a), r=1,2,..., under the composition of their exponential generating functions (egf). They turn out to be of Sheffer-type. We demonstrate that two key properties of these sequences remain preserved under substitutional composition: (a)the property of being the solution of the Stieltjes moment problem; and (b) the representation of these sequences through infinite series (Dobinski-type relations). We present a number of examples of such composition satisfying properties (a) and (b). We obtain new Dobinski-type formulas and solve the associated moment problem for several hierarchically defined combinatorial families of sequences.Comment: 14 pages, 31 reference

From Quantum Mechanics to Quantum Field Theory: The Hopf route

We show that the combinatorial numbers known as {\em Bell numbers} are generic in quantum physics. This is because they arise in the procedure known as {\em Normal ordering} of bosons, a procedure which is involved in the evaluation of quantum functions such as the canonical partition function of quantum statistical physics, {\it inter alia}. In fact, we shall show that an evaluation of the non-interacting partition function for a single boson system is identical to integrating the {\em exponential generating function} of the Bell numbers, which is a device for encapsulating a combinatorial sequence in a single function. We then introduce a remarkable equality, the Dobinski relation, and use it to indicate why renormalisation is necessary in even the simplest of perturbation expansions for a partition function. Finally we introduce a global algebraic description of this simple model, giving a Hopf algebra, which provides a starting point for extensions to more complex physical systems

Operational methods in the study of Sobolev-Jacobi polynomials

Inspired by ideas from umbral calculus and based on the two types of integrals occurring in the defining equations for the gamma and the reciprocal gamma functions, respectively, we develop a multi-variate version of umbral calculus and of the so-called umbral image technique. Besides providing a class of new formulae for generalized hypergeometric functions and an implementation of series manipulations for computing lacunary generating functions, our main application of these techniques is the study of Sobolev-Jacobi polynomials. Motivated by applications to theoretical chemistry, we moreover present a deep link between generalized normal-ordering techniques introduced by Gurappa and Panigrahi, two-variable Hermite polynomials and our integral-based series transforms. Notably, we thus calculate all K-tuple L-shifted lacunary exponential generating functions for a certain family of Sobolev-Jacobi (SJ) polynomials explicitly

Building Capacity in the Zambian Mental Health Workforce through Engaging College Educators: Evaluation of a Development Partnership in Higher Education (DelPHe) project

yesBetween 2008 and 2011 academic teaching staff from Leeds Beckett University (UK) and Chainama Hills College of Health Sciences (Zambia) worked together on a Development Partnership in Higher Education (DelPHe) project funded by the Department for International Development (DFID) via the British Council. The partnership focused on “up-scaling” the provision of mental health education which was intended to build capacity through the delivery of a range of workshops for health educators at Chainama College, Lusaka. The project was evaluated on completion using small focus group discussions (FGDs), so educators could feedback on their experience of the workshops and discuss the impact of learning into their teaching practice. This chapter discusses the challenges of scaling up the mental health workforce in Zambia; the rationale for the content and delivery style of workshops with the health educators and finally presents and critically discusses the evaluation findings.Department for International Development (DFID) via the British Counci

Combinatorics and Boson normal ordering: A gentle introduction

We discuss a general combinatorial framework for operator ordering problems by applying it to the normal ordering of the powers and exponential of the boson number operator. The solution of the problem is given in terms of Bell and Stirling numbers enumerating partitions of a set. This framework reveals several inherent relations between ordering problems and combinatorial objects, and displays the analytical background to Wick's theorem. The methodology can be straightforwardly generalized from the simple example given herein to a wide class of operators.Comment: 8 pages, 1 figur

Preface (to EuroCereal 2011 special issue)

None available (preface)