Divisor generating functions and insertion into a heap (Q1093664): Difference between revisions

The main result is an identity involving \(\sigma_ r(n)\) and the Bell polynomial. This is a generalization of the author's previous result concerning \(\sigma_ 0(n)\). Application to the analysis of heaps is shown.

0 references

zbMATH Keywords

sum of divisor function

0 references

identities for divisor generating functions

0 references

expected value

0 references

asymptotic values

0 references

higher moments of number of exchanges

0 references

Bell polynomial

0 references

heaps

0 references

reviewed by

Štefan Znám

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q4146776

0 references

Repeated random insertion into a priority queue

0 references

Inserting a new element into a heap

0 references

Q5538132

0 references

Q3259107

0 references

Priority queues with update and finding minimum spanning trees

0 references

0 references

0 references

0 references

0 references

An identity for the divisor generating function arising from sorting theory

0 references

Identifiers

zbMATH Open document ID

0629.10005

0 references

DOI

10.1016/0166-218X(87)90043-6

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1093664

@@ Property / reviewed by @@
-Q750484
@@ Property / reviewed by: Q750484 / rank @@
-Normal rank
@@ Property / reviewed by @@
+Štefan Znám
@@ Property / reviewed by: Štefan Znám / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4146776
@@ Property / cites work: Q4146776 / rank @@
+Normal rank
@@ Property / cites work @@
+Repeated random insertion into a priority queue
@@ Property / cites work: Repeated random insertion into a priority queue / rank @@
+Normal rank
@@ Property / cites work @@
+Inserting a new element into a heap
@@ Property / cites work: Inserting a new element into a heap / rank @@
+Normal rank
@@ Property / cites work @@
+Q5538132
@@ Property / cites work: Q5538132 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3259107
@@ Property / cites work: Q3259107 / rank @@
+Normal rank
@@ Property / cites work @@
+Priority queues with update and finding minimum spanning trees
+Normal rank
@@ Property / cites work @@
+Q5585020
@@ Property / cites work: Q5585020 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3893324
@@ Property / cites work: Q3893324 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5589310
@@ Property / cites work: Q5589310 / rank @@
+Normal rank
@@ Property / cites work @@
+An identity for the divisor generating function arising from sorting theory
+Normal rank