wiki_research

commit dc5f6ea856c39c9e9a8ef0ea6aebf200810a8718
parent a36e73598a23e7404a9ef293aef2e2f2b6f74484
Author: Antoine Amarilli <a3nm@a3nm.net>
Date:   Thu, 12 Jun 2025 16:53:33 +0200

commit with codex

Diffstat:
running_intersection_property
 | 
11
+++++++++++
separating_automaton
 | 
5
+++++

2 files changed, 16 insertions(+), 0 deletions(-)
diff --git a/running_intersection_property b/running_intersection_property
@@ -0,0 +1,11 @@
+# Running intersection property
+
+The *running intersection property* on a set of [hyperedges] means that we can write them in an order e_1, ..., e_m such that, for any k > 1, there is j < k with p_k cap (cup_{i<k} p_i) included in p_j
+
+In other words, the elements of p_k that were already seen before are all witnessed in a single predecessor
+
+Defined in [beeri1983desirability], equivalent to being [alpha_acyclic]
+
+See also: [alpha_acyclic]
+
+Up: [hypergraph]
diff --git a/separating_automaton b/separating_automaton
@@ -0,0 +1,5 @@
+# Separating automaton
+
+cf https://en.wikipedia.org/wiki/Separating_words_problem
+
+Up: [automata]