No label defined (Q3029052)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4016963
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4016963

      Statements

      0 references
      1986
      0 references
      asymptotic enumeration
      0 references
      number of partial orders
      0 references
      [For the entire collection see Zbl 0608.00004.] The number \(P_ n\) of partial orders on a set of n elements has been estimated by \textit{D. Kleitman} and \textit{B. Rothschild} [Trans. Am. Math. Soc. 205, 205-220 (1975; Zbl 0302.05007)] as log \(P_ n=n^ 2/4+3n/2+O(\log n)\) where log refers to logarithm with base 2, and where \(P_ n\) was shown to be \[ P_ n=(1+O(1/n))\sum_{0\leq i+j\leq n}\left( \begin{matrix} n\\ i;\quad j;\quad n-i-j\end{matrix} \right)(2^ i-1)^ j(2^ j-1)^{n-i-j}=(1+O(1/n))T_ n. \] In this paper it is shown that \[ P_ n=(1+O(1/n))\sqrt{2/\pi n}2^{n^ 2/4+3n/2}c(n), \] \[ c(n)= \begin{cases} \sum^{\infty}_{k=-\infty}2^{-((k+1)/2)^ 2} &\text{ if n even; } \\ \sum^{\infty}_{k=-\infty}2^{-k^ 2} &\text{ if n odd.}\end{cases} \] This result is obtained by estimating \(T_ n\) from [loc. cit.] with approximations of binomial and multinomial coefficients.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references