arXiv subjects
Publications and source records attributed to Karol A. Penson.
In a recent series of communications we have shown that the reordering problem of bosons leads to certain combinatorial structures. These structures may be associated with a certain graphical description. In this paper, we show that there is a Hopf Algebra structure associated with this problem which is, in a certain sense, unique.
We examine two associative products over the ring of symmetric functions related to the intransitive and Cartesian products of permutation groups. As an application, we give an enumeration of some Feynman type diagrams arising in Bender's QFT of partitions. We end by exploring possibilities to construct noncommutative analogues.
Although symmetry methods and analysis are a necessary ingredient in every physicist's toolkit, rather less use has been made of combinatorial methods. One exception is in the realm of Statistical Physics, where the calculation of the partition function, for example, is essentially a combinatorial problem. In this talk we shall show that one approach is via the normal ordering of the second quantized operators appearing in the partition function. This in turn leads to a combinatorial graphical description, giving essentially Feynman-type graphs associated with the theory. We illustrate this methodology by the explicit calculation of two model examples, the free boson gas and a superfluid boson model. We show how the calculation of partition functions can be facilitated by knowledge of the combinatorics of the boson normal ordering problem; this naturally gives rise to the Bell numbers of combinatorics. The associated graphical representation of these numbers gives a perturbation expansion in terms of a sequence of graphs analogous to zero - dimensional Feynman diagrams.
A conventional context for supersymmetric problems arises when we consider systems containing both boson and fermion operators. In this note we consider the normal ordering problem for a string of such operators. In the general case, upon which we touch briefly, this problem leads to combinatorial numbers, the so-called Rook numbers. Since we assume that the two species, bosons and fermions, commute, we subsequently restrict ourselves to consideration of a single species, single-mode boson monomials. This problem leads to elegant generalisations of well-known combinatorial numbers, specifically Bell and Stirling numbers. We explicitly give the generating functions for some classes of these numbers. In this note we concentrate on the combinatorial graph approach, showing how some important classical results of graph theory lead to transparent representations of the combinatorial numbers associated with the boson normal ordering problem.
We solve the boson normal ordering problem for F[(a*)^r a^s], with r,s positive integers, where a* and a are boson creation and annihilation operators satisfying [a,a*]=1. That is, we provide exact and explicit expressions for the normal form wherein all a's are to the right. The solution involves integer sequences of numbers which are generalizations of the conventional Bell and Stirling numbers whose values they assume for r=s=1. A comprehensive theory of such generalized combinatorial numbers is given including closed-form expressions (extended Dobinski-type formulas)and generating functions. These last are special expectation values in boson coherent states.
In this communication, we consider the normal ordering of sums of elements of the form (a*^r a a*^s), where a* and a are boson creation and annihilation operators. We discuss the integration of the associated one-parameter groups and their combinatorial by-products. In particular, we show how these groups can be realized as groups of substitutions with prefunctions.
Conventional Bell and Stirling numbers arise naturally in the normal ordering of simple monomials in boson operators. By extending this process we obtain generalizations of these combinatorial numbers, defined as coherent state matrix elements of arbitrary monomials, as well as the associated Dobinski relations. These Bell-type numbers may be considered as power moments and give rise to positive measures which allow the explicit construction of new classes of coherent states.
We derive explicit formulas for the normal ordering of powers of arbitrary monomials of boson operators. These formulas lead to generalisations of conventional Bell and Stirling numbers and to appropriate generalisations of the Dobinski relations. These new combinatorial numbers are shown to be coherent state matrix elements of powers of the monomials in question. It is further demonstrated that such Bell-type numbers, when considered as power moments, give rise to positive measures on the positive half-axis, which in many cases can be written in terms of known functions.
We construct coherent states using sequences of combinatorial numbers such as various binomial and trinomial numbers, and Bell and Catalan numbers. We show that these states satisfy the condition of the resolution of unity in a natural way. In each case the positive weight functions are given as solutions of associated Stieltjes or Hausdorff moment problems, where the moments are the combinatorial numbers.
We consider the Hubbard model and its extensions on bipartite lattices. We define a dynamical group based on the $η$-pairing operators introduced by C.N.Yang, and define coherent pairing states, which are combinations of eigenfunctions of $η$-operators. These states permit exact calculations of numerous physical properties of the system, including energy, various fluctuations and correlation functions, including pairing ODLRO to all orders. This approach is complementary to BCS, in that these are superconducting coherent states associated with the exact model, although they are not eigenstates of the Hamiltonian.