19 research outputs found

    Hopf Algebras in General and in Combinatorial Physics: a practical introduction

    Full text link
    This tutorial is intended to give an accessible introduction to Hopf algebras. The mathematical context is that of representation theory, and we also illustrate the structures with examples taken from combinatorics and quantum physics, showing that in this latter case the axioms of Hopf algebra arise naturally. The text contains many exercises, some taken from physics, aimed at expanding and exemplifying the concepts introduced

    A product formula and combinatorial field theory

    Get PDF
    We treat the problem of normally ordering expressions involving the standard boson operators a, ay where [a; ay] = 1. We show that a simple product formula for formal power series | essentially an extension of the Taylor expansion | leads to a double exponential formula which enables a powerful graphical description of the generating functions of the combinatorial sequences associated with such functions | in essence, a combinatorial eld theory. We apply these techniques to some examples related to specic physical Hamiltonians

    Dobinski-type relations: Some properties and physical applications

    Full text link
    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

    Heisenberg-Weyl algebra revisited: Combinatorics of words and paths

    Full text link
    The Heisenberg-Weyl algebra, which underlies virtually all physical representations of Quantum Theory, is considered from the combinatorial point of view. We provide a concrete model of the algebra in terms of paths on a lattice with some decomposition rules. We also discuss the rook problem on the associated Ferrers board; this is related to the calculus in the normally ordered basis. From this starting point we explore a combinatorial underpinning of the Heisenberg-Weyl algebra, which offers novel perspectives, methods and applications.Comment: 5 pages, 3 figure

    Laguerre-type derivatives: Dobinski relations and combinatorial identities

    Get PDF
    We consider properties of the operators D(r,M)=a^r(a^\dag a)^M (which we call generalized Laguerre-type derivatives), with r=1,2,..., M=0,1,..., where a and a^\dag are boson annihilation and creation operators respectively, satisfying [a,a^\dag]=1. We obtain explicit formulas for the normally ordered form of arbitrary Taylor-expandable functions of D(r,M) with the help of an operator relation which generalizes the Dobinski formula. Coherent state expectation values of certain operator functions of D(r,M) turn out to be generating functions of combinatorial numbers. In many cases the corresponding combinatorial structures can be explicitly identified.Comment: 14 pages, 1 figur

    Hopf algebras: motivations and examples

    Full text link
    This paper provides motivation as well as a method of construction for Hopf algebras, starting from an associative algebra. The dualization technique involved relies heavily on the use of Sweedler's dual

    A generic Hopf algebra for quantum statistical mechanics

    Get PDF
    In this paper, we present a Hopf algebra description of a bosonic quantum model, using the elementary combinatorial elements of Bell and Stirling numbers. Our objective in doing this is as follows. Recent studies have revealed that perturbative quantum field theory (pQFT) displays an astonishing interplay between analysis (Riemann zeta functions), topology (Knot theory), combinatorial graph theory (Feynman diagrams) and algebra (Hopf structure). Since pQFT is an inherently complicated study, so far not exactly solvable and replete with divergences, the essential simplicity of the relationships between these areas can be somewhat obscured. The intention here is to display some of the above-mentioned structures in the context of a simple bosonic quantum theory, i.e. a quantum theory of non-commuting operators that do not depend on space-time. The combinatorial properties of these boson creation and annihilation operators, which is our chosen example, may be described by graphs, analogous to the Feynman diagrams of pQFT, which we show possess a Hopf algebra structure. Our approach is based on the quantum canonical partition function for a boson gas.Comment: 8 pages/(4 pages published version), 1 Figure. arXiv admin note: text overlap with arXiv:1011.052

    Hierarchical Dobinski-type relations via substitution and the moment problem

    Full text link
    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

    Some useful combinatorial formulae for bosonic operators

    Get PDF
    We give a general expression for the normally ordered form of a function F(w(a,a*)) where w is a function of boson annihilation and creation operators satisfying [a,a*]=1. The expectation value of this expression in a coherent state becomes an exact generating function of Feynman-type graphs associated with the zero-dimensional Quantum Field Theory defined by F(w). This enables one to enumerate explicitly the graphs of given order in the realm of combinatorially defined sequences. We give several examples of the use of this technique, including the applications to Kerr-type and superfluidity-type hamiltonians.Comment: 8 pages, 3 figures, 17 reference
    corecore