REVIEW 3 cited by
Combinatorics of boson normal ordering and some applications
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We provide the solution to the normal ordering problem for powers and exponentials of two classes of operators. The first one consists of boson strings and more generally homogeneous polynomials, while the second one treats operators linear in one of the creation or annihilation operators. Both solutions generalize Bell and Stirling numbers arising in the number operator case. We use the advanced combinatorial analysis to provide closed form expressions, generating functions, recurrences, etc. The analysis is based on the Dobi\'nski-type relations and the umbral calculus methods. As an illustration of this framework we point out the applications to the construction of generalized coherent states, operator calculus and ordering of deformed bosons.
Forward citations
Cited by 3 Pith papers
-
Two-photon coupling via Josephson element II: Interaction dressing, cross-Kerr coupling, and limits of low-energy bosonic model
Cross-Kerr coupling in the two-photon bosonic regime of a SQUID-coupled phase qubit never vanishes due to potential asymmetry and coupler nonlinearity, with explicit limits on the number of coherent states needed for ...
-
pyBoLaNO: A Python symbolic package for normal ordering involving bosonic ladder operators
pyBoLaNO is a SymPy-based Python package that normal-orders bosonic ladder-operator polynomials using Blasiak's formula, and extends to commutators and Lindblad expectation-value evolution.
-
Partition Functions and Kurepa Decomposition I: Algebraic computation and some physical Applications
The alleged proof of gcd(F_n, (n+1)!)=2 collapses because F_n is simply the Kurepa factorial and the key lemma is the conjecture itself.
Discussion (0). Continue with ORCID to comment.