Pith. sign in

REVIEW 3 major objections 4 minor 78 references

Partition Functions and Kurepa Decomposition I: Algebraic computation and some physical Applications

T0 review · 3 major / 4 minor · reviewed 2026-08-05 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The paper claims to prove Kurepa's conjecture by showing gcd(F_n, (n+1)!) = 2 for all n.

desk verdict The paper's proof of Kurepa's conjecture is circular: Lemma 5 is the conjecture in disguise, verified only for n=3,4,5, so Theorem 16 is not a proof. read the letter →

arxiv 2509.06077 v1 pith:B6ZCTJ23 submitted 2025-09-07 math.CO

Francis Atta Howard This is my paper · ORCID
classification math.CO MSC 05A1811A0511B7311B83
keywords BellnumbersKurepaconjectureleftfactorialDobinskibinaryGCDalgorithmnormalorderingFermi-Diracdistributionpartitionfunctions
topics The Collatz Conjecture
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper tries to prove the Kurepa conjecture, a long-standing open problem in number theory, by way of a new polynomial decomposition of left factorials. The central claim is Theorem 16: for every positive integer n, the greatest common divisor of F_n = sum_{k=0}^n k! and (n+1)! is exactly 2, which is equivalent to the Kurepa conjecture. The author also derives decompositions of Kurepa sequences in terms of Bell numbers, Dobinski numbers, and complementary Bell numbers, and sketches applications to boson normal ordering and to Planck, Fermi-Dirac, and Bose-Einstein distributions. If the proof is right, a long-standing open question closes; the decisive step is a coprimality lemma that is verified for small n but asserted for all n.

What carries the argument

The load-bearing object is the Kurepa polynomial F_n(x)=sum_{k=0}^n k! S(n,1)x^k = sum_{k=0}^n k! x^k, and its half r_n(x)=F_n(x)/2; at x=1, F_n(1) is the left factorial !(n+1). The argument works by the identity gcd(2u,2v)=2gcd(u,v) from the binary GCD algorithm: it reduces the target gcd(F_n,(n+1)!) to gcd(r_n,(n+1)!/2). The paper contends this reduced gcd is 1 because r_n is odd and (n+1)!/2 is even; the proof of that coprimality is Lemma 5, which is the hinge.

What would settle it

Run the paper's own binary-GCD reduction on F_n and (n+1)! for any n above the few small cases printed in the table; the first n for which the algorithm does not terminate with gcd 2 disproves Theorem 16. Equivalently, compute gcd(r_n,(n+1)!/2) for n=6,7,... until a value greater than 1 appears.

Watch

Extended reading notes

Core claim

On the paper's own terms, the discovery is that the Kurepa factorial is governed by the polynomial F_n(x) = sum_{k=0}^n k! x^k, obtained from the Fubini polynomial by fixing the Stirling number S(n,k) at k=1 (or k=n). Setting x=1 recovers the left factorial !(n+1), and its half r_n = F_n/2 is odd for n≥3. Theorem 16 then claims gcd(F_n,(n+1)!) = gcd(2r_n,2T) = 2·gcd(r_n,T) = 2, using the binary GCD split and the assertion that gcd(r_n,(n+1)!/2)=1. The author presents this as a new equivalence to Kurepa's conjecture and as the capstone of a web of Bell and Dobinski decompositions.

Load-bearing premise

The whole argument hinges on the unproved claim that half of F_n shares no prime factor with (n+1)!/2 for every n; the paper verifies this only for n=3,4,5 and then asserts the general case.

Editorial extensions

If this is right

  • If Theorem 16 is correct, the Kurepa conjecture is settled: gcd(!n,n!) = 2 for every n≥2.
  • The proof identifies an exact equivalent target: gcd(F_n,(n+1)!) = 2 if and only if gcd(r_n,(n+1)!/2) = 1.
  • Kurepa sequences decompose as finite positive combinations of Bell numbers and Dobinski numbers; shifted alternating Kurepa sequences decompose into complementary Bell numbers.
  • In the physical reading, Kurepa normal ordering and anti-normal ordering of the boson number operator are expressible through Bell and complementary Bell polynomials, and Planck's distribution can be rewritten in terms of log Bell numbers.
  • The conjectured bound on gcds of shifted F_n ± a sequences is left open; the paper asks for all a where the bound is 2.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The real burden of the paper is not the polynomial framework but Lemma 5; a reader should treat Theorem 16 as conditional on that coprimality assertion until a general proof appears.
  • If Lemma 5 turned out to be provable by modular or p-adic methods, the Kurepa conjecture would follow immediately; conversely, a single counterexample to Lemma 5 would be a counterexample to Kurepa, which computational searches up to 10^9 do not show.
  • The physical applications are structural analogies rather than empirical predictions; linking log Bell asymptotics to occupation numbers does not by itself produce a measurable quantum-statistical effect.
  • A natural extension would be to search for a proof of Lemma 5 using the recurrence r_n = r_{n-1} + n!/2, tracking how prime divisors of r_n could descend to smaller n.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. The manuscript proposes algebraic decompositions of Kurepa factorials in terms of Dobinski/Bell numbers, introduces F_n(x) polynomials and F_n numbers, and claims a new equivalence to the Kurepa conjecture. The central result is Theorem 16: gcd(F_n,(n+1)!)=2 for all n≥1, where F_n=Σ_{k=0}^n k!. Since F_n=!(n+1), this is exactly the Kurepa conjecture for n+1. The proof rests on Lemma 5, which asserts gcd(r_n,(n+1)!/2)=1 with r_n=F_n/2. The manuscript also contains sections on logarithms of Kurepa sequences and applications to normal ordering, Planck's distribution, and Bose/Fermi statistics via newly introduced 'Fermi numbers' and 'Gas_n'.

Significance. The main claim, if proved, would resolve the longstanding Kurepa conjecture. Unfortunately, the manuscript does not prove this: Lemma 5 is verified only for n=3,4,5 and is itself equivalent to the conjecture. The physical applications are based on a variable-confusion in Proposition 35 and on formal manipulations rather than on statistical mechanics. The paper does collect relevant references and elementary identities, but these do not offset the absence of a proof of the announced theorem.

major comments (3)
  1. [§4.1, Lemma 5 and Theorem 16] Lemma 5 asserts gcd(r_n,(n+1)!/2)=1 for all n≥3. Since F_n=Σ_{k=0}^n k! = !(n+1) and r_n=F_n/2, this is exactly equivalent to gcd(!(n+1)/2,(n+1)!/2)=1, i.e. to the Kurepa conjecture gcd(!(n+1),(n+1)!)=2. The proof checks only n=3,4,5 and then asserts the general case. The observation that r_n is odd and (n+1)!/2 is even does not imply coprimality (for example gcd(9,6)=3). The set V={r_n x + T y = 1} restates Bézout's identity; it does not establish that such x,y exist. Theorem 16 therefore assumes the conjecture in the form of Lemma 5, and Theorem 17's 'equivalence' is a restatement because F_n=!(n+1) by definition.
  2. [§6.3, Proposition 35] The derivation conflates the continuous variable x=βE with the summation index n of the Dobinski numbers. Starting from 1/(e^x-1), the text rewrites it as ln e / (ln(Dob_n)-1), replacing e^x by Σ k^n/k! with no relation between x and n. Consequently the claimed identity ¯n_gas ∼ 1/ln Bell_n is not derived. Since this is the basis of the subsequent statistical-mechanics results (Theorems 36–37 and 42–43), the physical section does not establish its claims.
  3. [§6.4, Theorems 38–43] The 'Fermi numbers' and 'Gas_n' are introduced by formal definitions: Fermi_n=e·Dob_n, Gas_n=e^{e^x-σ_i}. The subsequent results are algebraic identities involving these new symbols rather than a derivation from Fermi–Dirac or Bose–Einstein statistics. In particular, Theorem 38 is simply e times an earlier Kurepa--Dobinski identity, and Lemma 12's 'Gas_n' does not interact with the Kurepa sequence except through definitions chosen to make the equations close. The claimed physical applications are therefore not supported.
minor comments (4)
  1. [§4.1, proof of Theorem 16] The proof states 'the gcd(F_n, (n+1)!/2) = 2'; the theorem's claim is gcd(F_n,(n+1)!)=2. This is likely a typo but obscures the logic.
  2. [§4.1, Definition 9 and Theorem 15] F_n(x)=2r_n(x) by definition, so Theorem 15(1) is tautological; it should not be presented as a substantive result.
  3. [§3.2, Theorems 5–9] The coefficients Φ_r are said to depend on n, but the notation suggests a fixed sequence. For example, equation (12) uses coefficients 1,8,2,56,1,4 for n=8; this dependence should be explicit, e.g. Φ_r(n).
  4. [§4.3, Conjecture 2] The function F_n(a) in Conjecture 2 is not defined for general a; only examples such as F_n(2), F_n(3), F_n(4) are given. The conjecture is therefore not precisely stated.

Circularity Check

3 steps flagged · score 10.0 of 10

Lemma 5 is the Kurepa conjecture in disguise; Theorem 16's proof reduces to it, and Theorem 17 only renames it.

  1. self definitional [Section 4.1, Lemma 5]
    "Lemma 5. For all n≥3 the gcd(r_n, (n+1)!/2) = 1, that is, r_n and (n+1)!/2 are coprime."

    By the paper's own Definition 7 and Corollary 3, F_n = ∑_{k=0}^n k! = !(n+1), and by Theorem 14/Definition 9, r_n = F_n/2. Therefore Lemma 5's assertion gcd(r_n, (n+1)!/2)=1 is equivalent, after multiplying both arguments by 2, to gcd(!(n+1),(n+1)!)=2, which is exactly Kurepa Conjecture 1 with m=n+1. The lemma's 'proof' verifies only n=3,4,5 and then asserts the general case; the observation that r_n is odd and T=(n+1)!/2 is even does not imply coprimality (e.g., gcd(9,6)=3), and the set V={r_n x+T y=1} merely restates Bezout's identity without proving such x,y exist. Thus the lemma is the target conjecture under a definitional change, not an independent input.

  2. self definitional [Section 4.1, Theorem 16 proof]
    "gcd(Fn,(n+ 1)!) = gcd(2·r n,2T) = 2·gcd(r n,T) = 2·1 = 2 since gcd(r n,T) = 1 from lemma 5"

    The proof of Theorem 16(a) concludes gcd(F_n,(n+1)!)=2 solely by invoking 'from lemma 5' that gcd(r_n,T)=1. Since Lemma 5 is the Kurepa conjecture in disguised form, the chain gcd(F_n,(n+1)!) = 2·gcd(r_n,T) = 2 reduces the theorem to its own conclusion. The subsequent binary-GCD discussion does not independently establish gcd(r_n,T)=1; it merely restates the same unproved coprimality. Thus the main result is derived by assuming the result as Lemma 5.

1 more flagged steps
  1. renaming known result [Section 4.1, Theorem 17 and its proof]
    "Now sinceF n =K n (see table 5) we have that; gcd(Fn,(n+ 1)!)∼gcd(!n, n!) = gcd(K n, n!)"

    The paper presents Theorem 16 as a new equivalence to Kurepa's conjecture, but by its own Definition 7/Corollary 3, F_n = ∑_{k=0}^n k! = !(n+1), and it explicitly identifies F_n with K_n in table 5. Consequently, gcd(F_n,(n+1)!)=2 is literally gcd(!(n+1),(n+1)!)=2, the conjecture with index n+1. The 'equivalence' is a renaming, not independent evidence. Any support for Theorem 16 therefore inherits the circularity of Lemma 5.

full rationale

The paper's central claim—Theorem 16, and hence Theorem 17's resolution of the Kurepa conjecture—is circular. The key lemma (Lemma 5) asserts gcd(r_n,(n+1)!/2)=1, where r_n=F_n/2 and F_n=∑_{k=0}^n k!=!(n+1). This is exactly the Kurepa conjecture gcd(!(n+1),(n+1)!)=2 after multiplying by 2. The lemma's proof checks three small cases and then asserts the general case; parity observations do not establish coprimality. Theorem 16 then concludes gcd=2 by citing Lemma 5, and Theorem 17 merely relabels F_n as K_n, making the equivalence a definitional restatement rather than a derivation. The Bell/Dobinski decomposition sections are independent algebraic identities, but they do not support the Kurepa claim; the purported proof of the conjecture reduces, by definition, to assuming the conjecture. This is a complete circularity of the main result.

Assumptions & free parameters 1 free parameters · 3 assumptions · 2 invented entities

The central proof relies on Lemma 5, which is the Kurepa conjecture restated, plus standard identities. No empirical parameters appear, but the unspecified constant Q in the logarithm theorems is a placeholder.

free parameters (1)
  • Q
    Appears as 'ln(Constant)' in Theorems 27-30 and Corollary 7; never defined, so the stated decompositions depend on an uncomputed quantity.
assumptions (3)
  • standard math S(n,1) = S(n,n) = 1 for all n>=1
    Used in Definition 7 and Theorem 13 to reduce Fubini polynomials to factorials.
  • ad hoc to paper Lemma 5: gcd(r_n, (n+1)!/2) = 1 for all n>=3 based on three examples
    This is the Kurepa conjecture after multiplying by 2; it is used as the key step in Theorem 16 without a general proof.
  • standard math F_n(1) = !(n+1), i.e., the Kurepa factorial sum includes n! as its last term
    Used throughout to identify F_n with Kurepa factorials; this identification makes the 'new equivalence' a tautology.
invented entities (2)
  • Fermi numbers (Fermi_n = e * Dob_n)
    purpose: To rename e times Dobinski numbers and connect to Fermi-Dirac statistics
    No new physics; it is a scaling of Bell/Dobinski numbers, with no falsifiable prediction.
  • Gas_n = e^{e^x - sigma_i} for sigma_i = +/-1
    purpose: Proposed unified generating function for Bose and Fermi statistics
    It is just the standard generating function of Bell numbers or complementary Bell numbers dressed with a sign; no claim is made that can be tested independently.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Partition Functions and Kurepa Decomposition I: Algebraic computation and some physical Applications." pith.science (2026). https://pith.science/paper/B6ZCTJ23

@misc{pith2026250906077,
  author       = {Pith},
  title        = {Pith review of: Partition Functions and Kurepa Decomposition I: Algebraic computation and some physical Applications},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/B6ZCTJ23}},
  note         = {Machine review of arXiv:2509.06077}
}
read the original abstract

This paper examines the algebraic features of notable polynomial functions and explores their combinatorial aspects by presenting precise decompositions in terms of Dobinski numbers, Bell numbers, and moments generating functions. Additionally, a new equivalence to the Kurepa factorial is developed to help investigate the Kurepa conjecture. In conclusion, we examine several physical phenomena related to Kurepa factorials, occupation number, Fermi-Dirac and Bose-Einstein distributions while exploring their algebraic characteristics.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

78 extracted references · 70 canonical work pages

  1. [1]

    Andrews, G.E.: The Theory of Partitions vol. 2. Cambridge university press, ??? (1998)

    work page 1998

  2. [2]

    Bulletin of the Australian Mathematical Society84(1), 153–158 (2011) 54

    Sun, Z.-W., Zagier, D.: On a curious property of bell numbers. Bulletin of the Australian Mathematical Society84(1), 153–158 (2011) 54

    work page 2011

  3. [3]

    Bulletin of the Belgian Mathematical Society-Simon Stevin3(4), 467–475 (1996)

    Gertsch, A., Robert, A.M.: Some congruences concerning the bell numbers. Bulletin of the Belgian Mathematical Society-Simon Stevin3(4), 467–475 (1996)

    1996

  4. [4]

    Mathematics Magazine 66(5), 299–303 (1993)

    Clarke, R.J., Sved, M.: Derangements and bell numbers. Mathematics Magazine 66(5), 299–303 (1993)

    work page 1993

  5. [5]

    Guy, R.: Unsolved Problems in Number Theory vol. 1. Springer, ??? (2004)

    work page 2004

  6. [6]

    Journal of Combinatorial Theory, Series A102(1), 63–87 (2003)

    Klazar, M.: Bell numbers, their relatives, and algebraic differential equations. Journal of Combinatorial Theory, Series A102(1), 63–87 (2003)

    work page 2003

  7. [7]

    On Kurepa's problems in number Theory

    Ivi´ c, A., Mijajlovi´ c,ˇZ.: On kurepa’s problems in number theory. arXiv preprint math/0312202 (2003)

    work page Pith review arXiv 2003

  8. [8]

    Bulletin (Acad´ emie serbe des sciences et des arts

    Mijajlovi´ c,ˇZ.: Fifty years of kurepa’s! n hypothesis. Bulletin (Acad´ emie serbe des sciences et des arts. Classe des sciences math´ ematiques et naturelles. Sciences math´ ematiques) (46), 169–181 (2021)

    work page 2021

Show all 78 references
  1. [9]

    Publications de l’Institut Math´ ematique47(67), 24–32 (1990)

    Mijajlovi´ c,ˇZ.: On some formulas involving! n and the verification of the! n- hypothesis by use of computers. Publications de l’Institut Math´ ematique47(67), 24–32 (1990)

    1990

  2. [10]

    Axioms12(8), 785 (2023)

    Petojevi´ c, A., Gordi´ c, S., Mandi´ c, M., Ranitovi´ c, M.G.: New equivalents of kurepa’s hypothesis for left factorial. Axioms12(8), 785 (2023)

    2023

  3. [11]

    PhD thesis (1999)

    Gertsch Hamadene, A.: Congruences pour quelques suites classiques de nombres; sommes de factorielles et calcul ombral. PhD thesis (1999)

    1999

  4. [12]

    Kurepa, D.-u.: On the left factorial function! n. Math. Balkanica1(1), 147–153 (1971)

    1971

  5. [13]

    Journal de th´ eorie des nombres de Bordeaux16(1), 1–17 (2004)

    Barsky, D., Benzaghou, B.: Nombres de bell et somme de factorielles. Journal de th´ eorie des nombres de Bordeaux16(1), 1–17 (2004)

    2004

  6. [14]

    Journal de th´ eorie des nombres de Bordeaux23(2), 527–527 (2011)

    Barsky, D., Benzaghou, B.: Erratum a l’article nombres de bell et somme de factorielles. Journal de th´ eorie des nombres de Bordeaux23(2), 527–527 (2011)

    2011

  7. [15]

    arXiv preprint arXiv:1312.7037 (2013)

    Meˇ strovi´ c, R.: Variations of kurepa’s left factorial hypothesis. arXiv preprint arXiv:1312.7037 (2013)

    2013 arXiv

  8. [16]

    Filomat, 31–40 (1999)

    Petojevi´ c, A., ˇZiˇ zovi´ c, M.: Trees and the kurepa hypothesis for left factorial. Filomat, 31–40 (1999)

    1999

  9. [17]

    Mathematics of Computation85(302), 3061–3068 (2016)

    Andreji´ c, V., Tatarevic, M.: Searching for a counterexample to kurepa’s conjec- ture. Mathematics of Computation85(302), 3061–3068 (2016)

    2016

  10. [18]

    Kurepa, Math

    ˇSami, Z.: On the m-hypothesis of dj. Kurepa, Math. Balkanica4, 530–532 (1974) 55

    1974

  11. [19]

    arXiv e-prints, 2209 (2022)

    Abramov, V.M.: Kurepa’s conjecture on the left factorial function is true. arXiv e-prints, 2209 (2022)

    2022

  12. [20]

    arXiv preprint math/0410477 (2004)

    Kellner, B.C.: Some remarks on kurepa’s left factorial. arXiv preprint math/0410477 (2004)

    2004 arXiv

  13. [21]

    Fabiano, N., Radenovi´ c, S., Stojiljkovi´ c, V.: Kurepa’s Function and Some Relations to Statistical Mechanics

  14. [22]

    Journal of Computational Physics1(3), 397–405 (1967)

    Stein, J.: Computational problems associated with racah algebra. Journal of Computational Physics1(3), 397–405 (1967)

    1967

  15. [23]

    Annals of Mathematics35(2), 258–277 (1934)

    Bell, E.T.: Exponential polynomials. Annals of Mathematics35(2), 258–277 (1934)

    1934

  16. [24]

    Annals of Mathematics39(3), 539– 557 (1938)

    Bell, E.T.: The iterated exponential integers. Annals of Mathematics39(3), 539– 557 (1938)

    1938

  17. [25]

    Secr´ etariat de la soci´ et´ e scientifique, ??? (1933)

    Touchard, J.: Propri´ et´ es Arithm´ etiques de Certains Nombres r´ ecurrents. Secr´ etariat de la soci´ et´ e scientifique, ??? (1933)

    1933

  18. [26]

    https://mathworld

    Weisstein, E.W.: Dobi´ nski’s formula. https://mathworld. wolfram. com/ (2002)

    2002

  19. [27]

    Spivey, M.Z.: A generalized recurrence for bell numbers. J. Integer Seq11(08.2), 5 (2008)

    2008

  20. [28]

    Journal of Mathematics and Physics18(1-4), 153–173 (1939)

    Epstein, L.F.: A function related to the series for. Journal of Mathematics and Physics18(1-4), 153–173 (1939)

    1939

  21. [29]

    The American Mathematical Monthly52(6), 323–327 (1945)

    Williams, G., Campbell, W.: Numbers generated by the function e ex-1. The American Mathematical Monthly52(6), 323–327 (1945)

    1945

  22. [30]

    In: Advances in Combinatorics: Waterloo Workshop in Computer Algebra, W80, May 26-29, 2011, pp

    Amdeberhan, T., De Angelis, V., Moll, V.H.: Complementary bell numbers: Arithmetical properties and wilf’s conjecture. In: Advances in Combinatorics: Waterloo Workshop in Computer Algebra, W80, May 26-29, 2011, pp. 23–56 (2013). Springer

    2011

  23. [31]

    The Fibonacci Quarterly7(4), 437–448 (1969)

    Rao Uppuluri, V., Carpenter, J.A.: Numbers generated by the function exp (1-ex). The Fibonacci Quarterly7(4), 437–448 (1969)

    1969

  24. [32]

    CRC press, ??? (2005)

    Wilf, H.S.: Generatingfunctionology. CRC press, ??? (2005)

    2005

  25. [33]

    Riordan, J.: An introduction to combinatorial analysis (2014)

    2014

  26. [34]

    Springer, ??? (2012)

    Comtet, L.: Advanced Combinatorics: The Art of Finite and Infinite Expansions. Springer, ??? (2012)

    2012

  27. [35]

    Probability and Mathematical Statistics30(2), 185– 205 (2010)

    Berend, D., Tassa, T.: Improved bounds on bell numbers and on moments of 56 sums of random variables. Probability and Mathematical Statistics30(2), 185– 205 (2010)

    2010

  28. [36]

    Kurepa, D.: On some new left factorial propositions. Math. Balkanica4, 383–386 (1974)

    1974

  29. [37]

    Fabiano, N., Rohen, Y.: On the gcd of left factorials and n!: Kurepa’s conjecture and evidence for a rare prime-avoiding pattern

  30. [42]

    Euler, L.: Opera Postuma: Mathematica et Physica vol. 1. Eggers & Socios, ??? (1862)

  31. [43]

    Mathematics of Computation68(225), 403– 409 (1999)

    Zivkovic, M.: The number of primes. Mathematics of Computation68(225), 403– 409 (1999)

    1999

  32. [44]

    Smarandache Notions Journal7(1-3), 52 (1996)

    Mudge, M.: Introducing the smarandache-kurepa and smarandache-wagstaff functions. Smarandache Notions Journal7(1-3), 52 (1996)

    1996

  33. [45]

    Mathematics and Informatics Quarterly7(3), 114–116 (1997)

    Ashbacher, C.: Some properties of the smarandache-kurepa and smarandache- wagstaff functions. Mathematics and Informatics Quarterly7(3), 114–116 (1997)

    1997

  34. [46]

    Infinite Study, ??? (2016)

    Cira, O., Smarandache, F.: Various Arithmetic Functions and Their Applications. Infinite Study, ??? (2016)

    2016

  35. [47]

    https://mathworld

    Weisstein, E.W.: Alternating factorial. https://mathworld. wolfram. com/ (2005)

    2005

  36. [48]

    Addison-Wesley Professional, ??? (2014)

    Knuth, D.E.: The Art of Computer Programming: Seminumerical Algorithms, Volume 2. Addison-Wesley Professional, ??? (2014)

    2014

  37. [49]

    Technical report, University of Wisconsin- Madison Department of Computer Sciences (1990) 57

    Sorenson, J.: The k-ary gcd algorithm. Technical report, University of Wisconsin- Madison Department of Computer Sciences (1990) 57

    1990

  38. [50]

    Journal of Algorithms16(1), 110–144 (1994)

    Sorenson, J.: Two fast gcd algorithms. Journal of Algorithms16(1), 110–144 (1994)

    1994

  39. [51]

    Boyadzhiev, K.N.: A series transformation formula and related poly- nomials. International Journal of Mathematics and Mathematical Sciences2005(23), 792107 https://doi.org/10.1155/IJMMS.2005.3849 https://onlinelibrary.wiley.com/doi/pdf/10.1155/IJMMS.2005.3849

    2005

  40. [53]

    The American Mathematical Monthly 69(1), 4–8 (1962)

    Gross, O.A.: Preferential arrangements. The American Mathematical Monthly 69(1), 4–8 (1962)

    1962

  41. [54]

    Canadian Mathe- matical Bulletin17(5), 733–738 (1975)

    Tanny, S.M.: On some numbers related to the bell numbers. Canadian Mathe- matical Bulletin17(5), 733–738 (1975)

    1975

  42. [55]

    Published electronically at https://oeis.org/A003422 (2025)

    OEIS Foundation Inc.: Entry A003422 in The On-Line Encyclopedia of Integer Sequences (Left factorials). Published electronically at https://oeis.org/A003422 (2025). https://oeis.org/A003422

    2025

  43. [56]

    In: 1985 IEEE 7th Symposium on Computer Arithmetic (ARITH), pp

    Brent, R.P., Rung, H.: A systolic algorithm for integer gcd computation. In: 1985 IEEE 7th Symposium on Computer Arithmetic (ARITH), pp. 118–125 (1985). IEEE

    1985

  44. [57]

    Journal of the Institute of Actuaries76(2), 152–163 (1950)

    Beard, R.: On the coefficients in the expansion of eet and e- et. Journal of the Institute of Actuaries76(2), 152–163 (1950)

    1950

  45. [58]

    Technical report, Harvard Univ.; Nuclear Development Associates, Inc

    Schwinger, J.: On angular momentum. Technical report, Harvard Univ.; Nuclear Development Associates, Inc. (US) (January 1952). https://doi.org/10.2172/ 4389568 . https://www.osti.gov/biblio/4389568

    1952

  46. [59]

    Katriel, J.: Combinatorial aspects of boson algebra. Lett. Nuovo Cimento10(13), 565–567 (1974)

    1974

  47. [60]

    Physics Letters A273(3), 159–161 (2000)

    Katriel, J.: Bell numbers and coherent states. Physics Letters A273(3), 159–161 (2000)

    2000

  48. [61]

    In: Journal of Physics: Conference Series, vol

    Mehta, C.: Sudarshan diagonal coherent state representation: Developments and applications. In: Journal of Physics: Conference Series, vol. 196, p. 012014 (2009). IOP Publishing

    2009

  49. [62]

    Mehta, C.L.: Diagonal coherent-state representation of quantum operators. Phys. Rev. Lett.18, 752–754 (1967) https://doi.org/10.1103/PhysRevLett.18.752

    1967 doi

  50. [63]

    Wilcox, R.M.: Exponential operators and parameter differentiation in quantum physics. J. Math. Phys. (N. Y.), 8: 962-82(Apr. 1967). (1966) https://doi.org/10. 58 1063/1.1705306

    1967

  51. [64]

    arXiv preprint quant-ph/0507206 (2005)

    Blasiak, P.: Combinatorics of boson normal ordering and some applications. arXiv preprint quant-ph/0507206 (2005)

    2005 arXiv

  52. [65]

    American Journal of Physics75(7), 639–646 (2007)

    Blasiak, P., Horzela, A., Penson, K.A., Solomon, A.I., Duchamp, G.H.: Combi- natorics and boson normal ordering: A gentle introduction. American Journal of Physics75(7), 639–646 (2007)

    2007

  53. [66]

    Mansour, T., Schork, M.: Commutation Relations, Normal Ordering, and Stirling Numbers vol. 2. CRC Press Boca Raton, ??? (2016)

    2016

  54. [67]

    Entropie144(190), 164 (1900)

    Planck, M.: The theory of heat radiation. Entropie144(190), 164 (1900)

    1900

  55. [68]

    Springer, ??? (2012)

    Greiner, W., Neise, L., St¨ ocker, H.: Thermodynamics and Statistical Mechanics. Springer, ??? (2012)

    2012

  56. [69]

    Pramana66(3), 485–494 (2006)

    Srivatsan, C., Murthy, M., Bhaduri, R.: Gentile statistics and restricted partitions. Pramana66(3), 485–494 (2006)

    2006

  57. [70]

    Annals of Physics309(2), 295–305 (2004)

    Dai, W.-S., Xie, M.: Gentile statistics with a large maximum occupation number. Annals of Physics309(2), 295–305 (2004)

    2004

  58. [71]

    Il Nuovo Cimento (1924-1942)17(10), 493–497 (1940)

    Gentile j, G.: Itosservazioni sopra le statistiche intermedie. Il Nuovo Cimento (1924-1942)17(10), 493–497 (1940)

    1924

  59. [72]

    Revista mexicana de Fisica E52(1), 13–16 (2006)

    Vargas-Mart ´ ınez, J., Moya-Cessa, H., Fern´ andez Guasti, M.: Normal and anti- normal ordered expressions for annihilation and creation operators. Revista mexicana de Fisica E52(1), 13–16 (2006)

    2006

  60. [73]

    arXiv preprint quant-ph/0211028 (2002)

    Penson, K.A., Solomon, A.I.: Combinatorics of boson normal ordering: the dobinski formula revisited. arXiv preprint quant-ph/0211028 (2002)

    2002 arXiv

  61. [74]

    Louisell, W.H.: Quantum statistical properties of radiation (1973)

    1973

  62. [75]

    Physics Letters A364(3), 214–220 (2007) https://doi.org/10.1016/j.physleta

    Mansour, T., Schork, M., Severini, S.: A generalization of boson normal order- ing. Physics Letters A364(3), 214–220 (2007) https://doi.org/10.1016/j.physleta. 2006.12.016

    2007 doi

  63. [76]

    Czechoslovak Journal of Physics56(10), 1093– 1098 (2006)

    Blasiak, P., Gawron, A., Horzela, A., Penson, K., Solomon, A.: Dobi´ nski relations and ordering of boson operators. Czechoslovak Journal of Physics56(10), 1093– 1098 (2006)

    2006

  64. [77]

    Journal of Statistical Mechanics: Theory and Experiment2018(2), 023105 (2018)

    Zhou, C.-C., Dai, W.-S.: Canonical partition functions: ideal quantum gases, interacting classical gases, and interacting quantum gases. Journal of Statistical Mechanics: Theory and Experiment2018(2), 023105 (2018)

    2018

  65. [78]

    59 arXiv preprint arXiv:2502.11600 (2025)

    Shinde, D.: Large deviation theory for bose gas of photons and planck’s oscillators. 59 arXiv preprint arXiv:2502.11600 (2025)

    2025 arXiv

  66. [79]

    Journal of Mathematical Physics11(9), 2691–2697 (1970)

    Katsura, S., Kaminishi, K., Inawashiro, S.: Intermediate statistics. Journal of Mathematical Physics11(9), 2691–2697 (1970)

    1970

  67. [80]

    Planck, M.: On the law of the energy distribution in the normal spectrum. Ann. Phys4(553), 1–11 (1901)

    1901

  68. [81]

    Lov´ asz, L.: Combinatorial Problems and Exercises vol. 361. American Mathemat- ical Soc., ??? (2007)

    2007

  69. [82]

    Courier Corporation, ??? (2014)

    De Bruijn, N.G.: Asymptotic Methods in Analysis. Courier Corporation, ??? (2014)

    2014

  70. [83]

    Annals of Physics214(1), 152–159 (1992) 60

    Weldon, H.A.: Thermal phase space. Annals of Physics214(1), 152–159 (1992) 60

    1992

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.