wiki_research

commit 825a1c2d4b58abe38764ed50bd2df2c7eae3b8ad
parent f6d762c1f89a55a48756127d2182c940a1d16da1
Author: Antoine Amarilli <a3nm@a3nm.net>
Date:   Thu, 30 Apr 2026 19:14:59 +0200

commit with codex

Diffstat:
fundamental_theorem_of_arithmetic
 | 
7
+++++++
prime_decomposition
 | 
11
+++++++++++
weakly_connected_graph
 | 
2
++

3 files changed, 20 insertions(+), 0 deletions(-)
diff --git a/fundamental_theorem_of_arithmetic b/fundamental_theorem_of_arithmetic
@@ -0,0 +1,7 @@
+# Fundamental theorem of arithmetic
+
+https://en.wikipedia.org/wiki/Fundamental_theorem_of_arithmetic
+
+Up: [arithmetic]
+
+Aliases: decomposition prime numbers
diff --git a/prime_decomposition b/prime_decomposition
@@ -0,0 +1,11 @@
+# Prime decomposition
+
+The [graph_decomposition] of a [graph] in a [cartesian_product] of [graphs]
+
+Can be computed in [linear_time], cf [crespelle2013linear]
+
+Not necessarily unique but unique for [weakly_connected_digraphs] (up to graph isomorphism and reordering of factors), cf [crespelle2013linear]
+
+Up: [graph_decomposition]
+
+See also: [decomposition_prime_numbers], [prime_number], [prime_graph]
diff --git a/weakly_connected_graph b/weakly_connected_graph
@@ -5,3 +5,5 @@ A [directed_graph] which is [weakly_connected], i.e., has only one [weakly_conne
 Up: [directed_graph]
 
 See also: [strongly_connected_graph], [graph_connected]
+
+Aliases: weakly connected digraph, weakly connected digraphs