Global lca-DAGs: Unique Ancestry in DAGs

Updated 6 May 2026

Global lca-DAGs are finite directed acyclic graphs in which each nonempty subset of vertices has a unique least common ancestor, ensuring an unambiguous ancestral structure.
The characterization leverages order-theoretic join-semilattice properties and forbidden-minor patterns to guarantee unique LCAs across diverse clustering systems.
Algorithmic methods, including inductive add-leaf operations and closure testing, enable polynomial-time recognition and construction of these graphs for practical applications like phylogenetics and dependency analysis.

A global lca-DAG is a finite directed acyclic graph (DAG) in which every nonempty subset of vertices (or, in the context of leaf-labeled DAGs, every subset of minimal elements) has a unique least common ancestor (LCA). This structural condition is essential in diverse areas, notably phylogenetics, algebraic combinatorics, and the theory of clustering systems, as it generalizes tree-like hierarchies to arbitrarily reticulate settings while preserving a uniquely determined ancestral consensus for any collection of elements. The characterization, construction, and recognition of global lca-DAGs connect order-theoretic, combinatorial, and algorithmic methodologies.

1. Formal Definition and Equivalent Characterizations

Let $G=(V,E)$ be a finite DAG. Write $u \preceq_G v$ if there is a directed path from $v$ (the putative ancestor) down to $u$ (the putative descendant). For any nonempty subset $S \subseteq V$ , a vertex $w$ is a common ancestor of $S$ if $s \preceq_G w$ for all $s\in S$ ; $w$ is a least common ancestor if it is minimal (w.r.t. $u \preceq_G v$ 0) among all such ancestors.

Global lca-property: $u \preceq_G v$ 1 is a global lca-DAG if

$u \preceq_G v$ 2

where $u \preceq_G v$ 3 denotes the set of LCAs of $u \preceq_G v$ 4 (Lindeberg et al., 20 Mar 2025, Shanavas et al., 2023).

Several equivalent structural conditions have been established:

For rooted DAGs with unique root $u \preceq_G v$ 5, $u \preceq_G v$ 6 is global lca if and only if the poset $u \preceq_G v$ 7 is a join-semilattice — i.e., every pair $u \preceq_G v$ 8 in $u \preceq_G v$ 9 admits a unique least upper bound (join) $v$ 0 [(Lindeberg et al., 20 Mar 2025), Theorem 4.7].
In terms of cluster systems, $v$ 1 is global lca if and only if its clustering system is a $v$ 2-weak hierarchy for all $v$ 3, and every cluster corresponds to an LCA for some subset of leaves (Shanavas et al., 2023).
Combinatorially, $v$ 4 is global lca precisely when every strict topological $v$ 5-minor “carries” an $v$ 6-type or $v$ 7-type subdivision, preventing the formation of incomparable minimal ancestors for the same set [(Lindeberg et al., 20 Mar 2025), Theorem 5.17].

Thus, the global lca-property links order-theoretic uniqueness, set-theoretic closure, and forbidden minor patterns.

2. Structural, Cluster, and Forbidden-Minor Characterizations

The equivalence between global lca-DAGs and join-semilattices under the reachability order is central. If $v$ 8 is global lca, the binary operation mapping $v$ 9 defines a join satisfying semilattice axioms. The converse also holds: if $u$ 0 is a finite join-semilattice, then there is precisely one minimal common ancestor for every subset (Lindeberg et al., 20 Mar 2025).

The Hasse diagram of a finite poset $u$ 1 is global lca if and only if $u$ 2 is a join-semilattice [(Lindeberg et al., 20 Mar 2025), Theorem 4.6; (Lindeberg et al., 2024)]. Up to shortcut edges, every global lca-DAG is the Hasse diagram of its join-semilattice [(Lindeberg et al., 20 Mar 2025), Corollary 4.7].

Closure properties of set systems provide alternative characterizations:

The descendant system $u$ 3 is closed under nonempty intersection if and only if $u$ 4 is global lca [(Lindeberg et al., 20 Mar 2025), Theorem 7.4].
Similarly, the ancestor and intermediary systems are closed.

A forbidden-minor condition states: for every strict $u$ 5-minor (a digraph with two sources and two sinks, with all possible direct paths), there must exist an additional “ $u$ 6” or “ $u$ 7 $”-subdivision pattern ensuring confluence, thus excluding the occurrence of distinct minimal LCAs for the same set (<a href="/papers/2503.16186" title="" rel="nofollow" data-turbo="false" class="assistant-link" x-data x-tooltip.raw="">Lindeberg et al., 20 Mar 2025</a>). This controls the configuration of cycles and <a href="https://www.emergentmind.com/topics/additive-parallel-correction" title="" rel="nofollow" data-turbo="false" class="assistant-link" x-data x-tooltip.raw="">parallel</a> ancestry in the DAG.</p> <h2 class='paper-heading' id='construction-and-recognition-of-global-lca-dags'>3. Construction and Recognition of Global lca-DAGs</h2> <p>Global lca-DAGs can be inductively constructed from a single vertex by repeated application of a specific “add-leaf” operation:</p> <ul> <li><strong>Operation$ u$8: Given a global lca-DAG $u$9, introduce a new vertex $S \subseteq V$0 (a new leaf) and an arbitrary nonempty subset $S \subseteq V$1. Attach edges from every $S \subseteq V$2 to $S \subseteq V$3. Accept this operation only if, for every $S \subseteq V$4, the set $S \subseteq V$5 has a unique minimal element. The result is again a global lca-DAG (Lindeberg et al., 20 Mar 2025).

Every global lca-DAG can be constructed from $S \subseteq V$6 by a finite sequence of such $S \subseteq V$7 operations [(Lindeberg et al., 20 Mar 2025), Theorem 6.4].

The recognition problem is polynomial-time solvable:

Form the leaf-extended DAG by attaching a new leaf to each internal vertex.
For each pair of leaves, test whether a unique minimal common ancestor exists (e.g., via bidirectional BFS). The total complexity is $S \subseteq V$8 in the worst case, or $S \subseteq V$9 if optimized for sparse graphs [(Lindeberg et al., 20 Mar 2025), Corollary 6.5].

Algorithmically, checking closure of the descendant or ancestor system or testing uniqueness using path-cluster-comparability (PCC) and cluster-lca properties is sufficient (Lindeberg et al., 2024, Shanavas et al., 2023).

4. Cluster Systems, Weak Hierarchies, and Set-Theoretic Perspectives

The cluster-theoretic perspective is central: for each $w$0, define the cluster $w$1, where $w$2 is the set of minimal elements (leaves). The system $w$3 collects all such clusters (Shanavas et al., 2023).

Pre-$w$4-ary clustering system: $w$5 is pre-$w$6-ary if $w$7 with $w$8, the closure $w$9 belongs to $S$0. If $S$1 has unique LCAs for all $S$2, then $S$3 is pre-$S$4-ary [(Shanavas et al., 2023), Theorem 3.11].
Weak hierarchy (for all $S$5): Any $S$6 clusters $S$7 in $S$8 satisfy $S$9 such that $s \preceq_G w$0. For global lca-DAGs, $s \preceq_G w$1 is a $s \preceq_G w$2-weak hierarchy for all $s \preceq_G w$3; conversely, strong $s \preceq_G w$4-lca (unique LCA for any $s \preceq_G w$5 subset and every cluster is realized as such) is equivalent to the weak-hierarchy property [(Shanavas et al., 2023), Theorem 5.3].
Canonical $s \preceq_G w$6-ary transit function: $s \preceq_G w$7 defines a closure system on $s \preceq_G w$8, encoding the minimal cluster containing $s \preceq_G w$9 (Shanavas et al., 2023).

These set-system perspectives link directly to the algebraic and combinatorial structure of the underlying DAG and facilitate construction, simplification, and recognition.

5. Connections to Algorithms, Complexity, and Constraint Realizability

The theory of global lca-DAGs has algorithmic implications for LCA-related computational problems in DAGs:

LCA enumeration: Global lca-DAGs eliminate the ambiguity of multi-minimal ancestors. This simplifies all-pairs LCA, reducing worst-case complexities and improving interpretability in applications such as phylogenetic inference, program verification, and hierarchical clustering (Mathialagan et al., 2022, Grandoni et al., 2020).
Constraint satisfaction and DAG inference: Given a system of LCA constraints (e.g., “LCA$s\in S$0 is below LCA$s\in S$1”), the canonical construction using the $s\in S$2-closure method yields a unique (regular) DAG or network that realizes all logical consequences of the input constraints, with complexity polynomial in the number of leaves (Lindeberg et al., 11 Nov 2025).
Transformation algorithms: Any DAG can be reduced to a global lca-DAG by using a vertex suppression operator (denoted $s\in S$3), removing non-lca vertices while preserving descendant clusters (Lindeberg et al., 2024).
Recognition and simplification: The recognition and simplification algorithms for lca- and global lca-DAGs are polynomial-time (e.g., $s\in S$4 via cluster intersection and path-comparability checks) (Lindeberg et al., 20 Mar 2025, Shanavas et al., 2023).

For enumerative algorithms in general DAGs, the presence of multiple LCAs per set (i.e., non-global lca-DAG) imposes higher algorithmic complexity, and the identification of the global lca subclass allows for more efficient computation and structure discovery.

6. Applications and Broader Significance

Global lca-DAGs find concrete application in several domains:

In phylogenetic network theory, they correspond to regular networks or Hasse diagrams of join-semilattices of clusters, allowing for arbitrarily reticulate (non-treelike) but uniquely resolved ancestral structures (Lindeberg et al., 11 Nov 2025, Lindeberg et al., 2024).
In cluster analysis, global lca-DAGs model systems of sets that are closed under intersection and form weak hierarchies; this property underpins theoretical frameworks for hierarchical and overlapping clustering.
In program analysis, verification, and data provenance, global lca-DAGs capture unambiguous dependency or ancestry relationships, facilitating efficient queries and optimal storage.
The canonical construction and forbidden-minor characterizations assist in the realization problem for LCA constraints, extending classical rooted-tree algorithms (such as Aho’s BUILD) to reticulate DAGs (Lindeberg et al., 11 Nov 2025).

These theoretical advances provide a unified language for reasoning about unique ancestry, closure, and realization in complex hierarchical or overlapping systems. The polynomial recognition and transformation algorithms enable practical deployment in data-rich scientific computing and knowledge representation.