commit c7c7831b68e360db3fbc4e375ca7d22f1f324746
parent 044b63c660ff6812f6d12abd235f8ab6be601dcf
Author: Antoine Amarilli <a3nm@a3nm.net>
Date: Sat, 1 Nov 2025 21:55:01 +0100
commit with codex
Diffstat:
5 files changed, 18 insertions(+), 1 deletion(-)
diff --git a/linear_extension b/linear_extension
@@ -0,0 +1,9 @@
+# Linear extension
+
+[linear_extension_counting]
+
+Asymptotics of the number of elements required to achieve a specific number of linear extensions: cf https://math.stackexchange.com/questions/793098/small-posets-with-prescribed-number-of-linear-extensions/5106386
+
+Up: [partial_order]
+
+Aliases: linear extensions
diff --git a/linear_extension_counting b/linear_extension_counting
@@ -0,0 +1,6 @@
+# Linear extension counting
+
+[brightwell1991counting]: it's [SharpP_complete]
+- also for [height_2_posets], cf [dittmer2018counting]
+
+Up: [counting_problem], [linear_extension]
diff --git a/packing_problem b/packing_problem
@@ -10,6 +10,7 @@
- conjecture that you can pack any set of [tree] into [clique]: Gyárfás tree packing conjecture
- [ringels_conjecture]
- [circle_packing_theorem]
+- [circles_in_rectangles]
Up: [computational_geometry]
diff --git a/partial_order b/partial_order
@@ -21,6 +21,7 @@ Variants:
- [greatest_lower_bound]
- [dilworths_theorem] for [chain_partitioning]
+- [linear_extension]
- [poset_width]: largest [antichain] cardinality
Up: [mathematics], [order]
diff --git a/topological_sorting b/topological_sorting
@@ -9,6 +9,6 @@ https://en.wikipedia.org/wiki/Topological_sorting
Up: [graph_algorithm], [directed_acyclic_graph]
-See also: [strongly_connected_component_algorithm]
+See also: [strongly_connected_component_algorithm], [linear_extension]
Aliases: topological sort, topological ordering, topological orderings
