Efficient methods of calculating the number of heapable permutations (Q2691575): Difference between revisions

@@ Property / describes a project that uses @@
+OEIS
@@ Property / describes a project that uses: OEIS / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2023.01.025
+Normal rank
@@ Property / OpenAlex ID @@
+W4320186796
@@ Property / OpenAlex ID: W4320186796 / rank @@
+Normal rank
@@ Property / cites work @@
+On the heapability of finite partial orders
@@ Property / cites work: On the heapability of finite partial orders / rank @@
+Normal rank
@@ Property / cites work @@
+From Hammersley's lines to Hammersley's trees
@@ Property / cites work: From Hammersley's lines to Hammersley's trees / rank @@
+Normal rank
@@ Property / cites work @@
+Heapable Sequences and Subseqeuences
@@ Property / cites work: Heapable Sequences and Subseqeuences / rank @@
+Normal rank
@@ Property / cites work @@
+Some results on Dyck paths and Motzkin paths
@@ Property / cites work: Some results on Dyck paths and Motzkin paths / rank @@
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+The Surprising Mathematics of Longest Increasing Subsequences
+Normal rank
@@ Property / cites work @@
+Q4443440
@@ Property / cites work: Q4443440 / rank @@
+Normal rank