Engel's inequality for Bell numbers (Q1899066): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56157590, #quickstatements; #temporary_batch_1711486624475 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Log-concavity and related properties of the cycle index polynomials / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4863412 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the average rank of an element in a filter of the partition lattice / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Stirling Behavior is Asymptotically Normal / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3226891 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3995745 / rank | |||
Normal rank | |||
Latest revision as of 16:30, 23 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Engel's inequality for Bell numbers |
scientific article |
Statements
Engel's inequality for Bell numbers (English)
0 references
4 October 1995
0 references
\textit{K. Engel} [J. Comb. Theory, Ser. A 65, No. 1, 67-78 (1994; Zbl 0795.05051)]\ conjectured that \(\tau_n= (B_{n+ 1}/ B_n) -1\) (\(B_n\) the \(n\)-th Bell number; \(\tau_n\) the average number of blocks in a partition of an \(n\)-set) is concave. The author proves the conjecture for all \(n\) sufficiently large, using the asymptotic formula for Bell numbers of Moser and Wyman. He also shows that the average number of singleton blocks in a partition of an \(n\)-set is an increasing function of \(n\).
0 references
Engel's inequality
0 references
Bell number
0 references
partition
0 references
\(n\)-set
0 references
