2012
DOI: 10.1088/1751-8113/45/15/155204
|View full text |Cite
|
Sign up to set email alerts
|

General ordering problem and its combinatorial roots

Abstract: We introduce the general method of converting a given operator function into its s-ordered form. We state and prove a theorem representing the fact that any ordered expansion of some operator function might be considered as the combinatorial problem of counting the number of contractions. This will also unify the two essentially distinct notions of ‘taking an operator into some ordered form’ and ‘reordering, or formally, ordering an operator’. In this way, we reduce the general ordering problem into a purely c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
13
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 12 publications
(13 citation statements)
references
References 25 publications
0
13
0
Order By: Relevance
“…[11][12][13] When Θ(x) is set to unity, this integral is simply the usual Weyl transform of p m q n . Indeed, generalized Weyl transform (14) arises as a consequence of Hermiticity condition.…”
Section: Generalized Weyl Transformmentioning
confidence: 99%
See 3 more Smart Citations
“…[11][12][13] When Θ(x) is set to unity, this integral is simply the usual Weyl transform of p m q n . Indeed, generalized Weyl transform (14) arises as a consequence of Hermiticity condition.…”
Section: Generalized Weyl Transformmentioning
confidence: 99%
“…The solution is straightforward from direct use of (14) to the application of Baker-Campbell-Hausdorff formula e A+B = e B e 1 2 [A,B] e A for operators A = i(αp + βq) and B = i(ρp + σq). The commutator and anticommutator are then…”
Section: General Commutation and Anticommutation Relationsmentioning
confidence: 99%
See 2 more Smart Citations
“…[3] However, in a recent work the authors have introduced the most general theorem regarding orderings of operators which will be referred to as the general ordering theorem or just GOT. [4] In this regard, one may t-order any multiplicative sequence of s j -ordered functions with j ∈ {2, 3, . .…”
Section: Introductionmentioning
confidence: 99%