arXiv subjects

Andrzej Horzela

Publications and source records attributed to Andrzej Horzela.

10 recordsLinked to original sources

arXiv2017

Comments on the Properties of Mittag-Leffler Function

The properties of Mittag-Leffler function is reviewed within the framework of an umbral formalism. We take advantage from the formal equivalence with the exponential function to define the relevant semigroup properties. We analyse the relevant role in the solution of Schrödinger type and heat-type fractional partial differential equations and explore the problem of operatorial ordering finding appropriate rules when non-commuting operators are involved. We discuss the coherent states associated with the fractional Schödinger equation, analyze the relevant Poisson type probability amplitude and compare with analogous results already obtained in the literature.

math-ph↗

arXiv2014

Combinatorial interpretation and proof of Glaisher-Crofton identity

We give a purely combinatorial proof of the Glaisher-Crofton identity which derives from the analysis of discrete structures generated by iterated second derivative. The argument illustrates utility of symbolic and generating function methodology of modern enumerative combinatorics and their applications to computational problems.

math.CO↗

arXiv2012

A generic Hopf algebra for quantum statistical mechanics

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.

math-ph↗

arXiv2010

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.

math-ph↗

arXiv2009

Ladder Operators and Endomorphisms in Combinatorial Physics

Starting with the Heisenberg-Weyl algebra, fundamental to quantum physics, we first show how the ordering of the non-commuting operators intrinsic to that algebra gives rise to generalizations of the classical Stirling Numbers of Combinatorics. These may be expressed in terms of infinite, but {\em row-finite}, matrices, which may also be considered as endomorphisms of $\C[[x]]$. This leads us to consider endomorphisms in more general spaces, and these in turn may be expressed in terms of generalizations of the ladder-operators familiar in physics.

math.CO↗

arXiv2007

A Three Parameter Hopf Deformation of the Algebra of Feynman-like Diagrams

We construct a three-parameter deformation of the Hopf algebra $\LDIAG$. This is the algebra that appears in an expansion in terms of Feynman-like diagrams of the {\em product formula} in a simplified version of Quantum Field Theory. This new algebra is a true Hopf deformation which reduces to $\LDIAG$ for some parameter values and to the algebra of Matrix Quasi-Symmetric Functions ($\MQS$) for others, and thus relates $\LDIAG$ to other Hopf algebras of contemporary physics. Moreover, there is an onto linear mapping preserving products from our algebra to the algebra of Euler-Zagier sums.

math-ph↗

arXiv2006

A multipurpose Hopf deformation of the Algebra of Feynman-like Diagrams

We construct a three parameter deformation of the Hopf algebra $\mathbf{LDIAG}$. This new algebra is a true Hopf deformation which reduces to $\mathbf{LDIAG}$ on one hand and to $\mathbf{MQSym}$ on the other, relating $\mathbf{LDIAG}$ to other Hopf algebras of interest in contemporary physics. Further, its product law reproduces that of the algebra of polyzeta functions.

cs.OH↗

arXiv2005

Feynman graphs and related Hopf algebras

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.

cs.SC↗

arXiv2004

Partition functions and graphs: A combinatorial approach

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.

quant-ph↗

arXiv2004

Normal Order: Combinatorial Graphs

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.

quant-ph↗