Generating functions for coherent intertwiners
نویسندگان
چکیده
منابع مشابه
Probability Generating Functions for Sattolo’s Algorithm
In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...
متن کاملArbitrary-Order Hermite Generating Functions for Coherent and Squeezed States
For use in calculating higher-order coherentand squeezedstate quantities, we derive generalized generating functions for the Hermite polynomials. They are given by ∑∞ n=0 z Hjn+k(x)/(jn + k)!, for arbitrary integers j ≥ 1 and k ≥ 0. Along the way, the sums with the Hermite polynomials replaced by unity are also obtained. We also evaluate the action of the operators exp[a(d/dx)] on well-behaved ...
متن کاملOn composition of generating functions
In this work we study numbers and polynomials generated by two type of composition of generating functions and get their explicit formulae. Furthermore we state an improvementof the composita formulae's given in [6] and [3], using the new composita formula's we construct a variety of combinatorics identities. This study go alone to dene new family of generalized Bernoulli polynomials which incl...
متن کاملPartition Functions, Intertwiners and the Coxeter Element
The partition functions of Pasquier models on the cylinder, and the associated intertwiners, are considered. It is shown that earlier results due to Saleur and Bauer can be rephrased in a geometrical way, reminiscent of formulae found in certain purely elastic scattering theories. This establishes the positivity of these intertwiners in a general way and elucidates connections between these obj...
متن کاملGenerating functions for generating trees
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the object. Generating trees lead to a fast computation of enumeration sequences (sometimes, to explicit formulae as well) and provide efficient random generation al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Classical and Quantum Gravity
سال: 2013
ISSN: 0264-9381,1361-6382
DOI: 10.1088/0264-9381/30/5/055018