commit 692e449a77f42f94d1212bdcc2f1b631a632e797
parent f8e5625ffd7c921eb56d48a9f01aced865e63d16
Author: Antoine Amarilli <a3nm@a3nm.net>
Date: Thu, 2 Jan 2025 10:48:41 +0100
commit with codex
Diffstat:
13 files changed, 36 insertions(+), 5 deletions(-)
diff --git a/bag_semantics b/bag_semantics
@@ -4,4 +4,4 @@ when [query] returns results with multiset of occurrences
Up: [database_theory]
-See also: [set_semantics], [containment_bag_semantics]
+See also: [set_semantics], [containment_bag_semantics], [multiset]
diff --git a/formal_language_theory b/formal_language_theory
@@ -40,6 +40,7 @@ Studies [formal_language]
- [parikh_automaton], [parikh_image]
- [formal_language_separation]
- [determinism_language]
+- [unambiguity]
## Results
diff --git a/multiset b/multiset
@@ -0,0 +1,9 @@
+# Multiset
+
+A [set] where each [element] may occur some number of times which is greater than 1
+
+Up: [set]
+
+See also: [bag_semantics]
+
+Aliases: multisets
diff --git a/probabilistic_circuit b/probabilistic_circuit
@@ -25,4 +25,6 @@ we want to do [maximum_a_posteriori] on such circuits
connections to other kinds of polynomials than [probability_distribution]: see [broadrick2024polynomial]
-See also: [arithmetic_circuit], [probabilities], [circuit_algebraic]
+See also: [arithmetic_circuit], [circuit_algebraic]
+
+Up: [circuit], [probabilities]
diff --git a/range_query b/range_query
@@ -7,3 +7,5 @@ Maintain a collection of points and answer queries asking about all the points i
- [gupta1995further]: range color counting/reporting in [rectangle]
See also: [skyline], [2d_range_reporting], [range_reporting], [range_tree]
+
+Up: [query], [interval]
diff --git a/set_function b/set_function
@@ -9,3 +9,5 @@
- [modular]
See also: [statistical_profile], [entropic_vector]
+
+Up: [function], [set]
diff --git a/set_intersection b/set_intersection
@@ -5,5 +5,8 @@ Given sets S_1, ..., S_m, preprocess them such that given any two sets you can e
[goldstein2019hardness], [kopelowitz2020towards], [fischer2024deterministicb]
- [sorted_list_intersection]
+- [set_intersection_2] for 2 [sets]
See also: [ov_conjecture], [set_union]
+
+Up: [computational_problem], [intersection]
diff --git a/set_intersection_2 b/set_intersection_2
@@ -1,5 +1,9 @@
# Intersection of two sets
-[munro1976sorting], lower bound on two sets (not ordered)
+[Computational_problem] of computing the [set_intersection] of two [sets]
+
+- [munro1976sorting], [lower_bound] on two [multisets] (not ordered)
See also: [sorted_list_intersection], [set_intersection]
+
+Up: [set_intersection]
diff --git a/test b/test
diff --git a/topk b/topk
@@ -3,3 +3,5 @@
- [ranking_function]
See also: [ranked_access], [enumeration_ordered]
+
+Up: [query]
diff --git a/unambiguity b/unambiguity
@@ -1,6 +1,6 @@
# Unambiguity
-An [automata] is unambiguous if every word that it accepts has at most one accepting run. In particular see [word_automaton_unambiguous]
+An [automata] is [unambiguous] if every word that it accepts has at most one accepting run. In particular see [word_automaton_unambiguous]
## Generalization
@@ -32,4 +32,6 @@ pas de conversion polynomiale de 2-UFA vers [unambiguous_finite_automaton] par [
- [satisfiability_unambiguous]
-See also: [ddnnf], [unambiguous]
+See also: [ddnnf], [unambiguous], [determinism_language]
+
+Up: [formal_language_theory]
diff --git a/unambiguous b/unambiguous
@@ -8,3 +8,5 @@
- [word_automaton_unambiguous]
See also: [unambiguity]
+
+Up: [formal_language_theory]
diff --git a/universal_word b/universal_word
@@ -5,3 +5,5 @@
[word] containing all words of length n exactly once as contiguous [subword]
See also: [superpermutation], [random_universal_word], [de_bruijn_sequence], [universal_tree]
+
+Up: [word], [word_combinatorics]
