The boson normal ordering problem and generalized Bell numbers

From MaRDI portal
Publication:1407494

DOI10.1007/S00026-003-0177-ZzbMath1030.81004arXivquant-ph/0212072OpenAlexW1970032515MaRDI QIDQ1407494

Allan I. Solomon, Karol A. Penson, Pawel Blasiak

Publication date: 16 September 2003

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0212072




Related Items (22)

\((p, q)\)-analogues of the generalized Touchard polynomials and Stirling numbersNormal ordering for nonlinear deformed ladder operators and the f-generalization of the Stirling and Bell numbersSome formulas for Bell numbersOn an unconditional basis with parentheses for generalized subordinate perturbations and application to Gribov operators in Bargmann spaceA simple combinatorial interpretation of certain generalized Bell and Stirling numbersWalks, partitions, and normal orderingTop to random shuffles on colored permutationsGeneralized Stirling numbers and hyper-sums of powers of binomials coefficientsThe commutation relation \(xy=qyx+hf(y)\) and Newton's binomial formulaUnnamed ItemCombinatorially interpreting generalized Stirling numbersA NEW SYMMETRIC EXPRESSION OF WEYL ORDERINGDuality triads of higher rank: further properties and some examplesRepresenting elements of the Weyl algebra by labeled treesWick ordering associated with the \((p, q)\)-Gaussian white noise processNoncrossing normal ordering for functions of boson operatorsOn a generalization of duality triadsLaguerre-type derivatives: Dobiński relations and combinatorial identitiesThe solution of the recurrence relationfn(t)=an(tfn−1(t)−bn(t)(∂/∂tfn−1(t)Normal ordering problem and the extensions of the Stirling grammarPath decompositions of digraphs and their applications to Weyl algebraCounting the number of non-equivalent vertex colorings of a graph







This page was built for publication: The boson normal ordering problem and generalized Bell numbers