Flag Structures and the Flagging Act: A Cross-Domain Survey with Explicit Counting Derivations and a Posed Re-Entry Problem

#1. Introduction

This paper originates from a research brief whose substantive content is a single sentence: "Re-entry from: We flag this as an open question rather than a result." We take that framing seriously and literally. The brief supplies no content for the artifact; it supplies instead a bibliography of twelve works, six of which concern flag-structured objects in pure mathematics and applied formal methods, and four of which belong to the QNFO corpus, a body of critical work on the epistemology and economics of quantum computing. The honest response to such a brief is not to manufacture a result but to do three things well: (i) map the intellectual terrain the bibliography actually covers, (ii) extract whatever quantitative structure can be derived from first principles with fully shown arithmetic, and (iii) state the re-entry problem as a well-posed open question with explicit success and falsification criteria.

The term "flag" requires one definition, after which it will not be repeated. A complete flag in an $n$-dimensional vector space $V_n$ is a chain of subspaces

with $\dim_{\mathbb{F}} V_k = k$. Partial flags omit steps. The same incidence-chain idea — nested structure indexed by an ordered set — recurs as flag matroids [1], flag curvature in Finsler geometry [2], flag algebras in extremal combinatorics [3], flag varieties in total positivity [4], standard monomial theory [5], and Schubert-varietal resolutions [6]. On the applied side, flag algebras have been machine-formalized in the Lean proof assistant [3], and "open-ended" training over a universe of tasks [7] and guaranteed posterior inference [8] represent the methodological milieu in which certificate-based and audit-based reasoning is currently operationalized. The QNFO corpus [9], [10], [11], [12] supplies the epistemic-critique context in which the re-entry question is posed.

Our thesis is modest and defensible: flag-structured incidence data form a shared methodological substrate across the surveyed fields, and making that substrate explicit improves the quality of cross-domain audits — including the audit-shaped QNFO programme — because audits are themselves incidence structures (claims nested inside arguments nested inside corpora). We support the thesis by survey, by explicit counting derivations, and by a disciplined statement of the open re-entry problem. We also state the thesis's weakest point up front: the shared word may be doing rhetorical work that the mathematics does not underwrite; Section 6 argues against ourselves on exactly this point.

#2. Background and Related Work

We discuss all twelve bibliography entries in their given order. Each claim below is restricted to what the supplied entry states; where an entry is truncated, we say so and use only the stated text.

[1] Representability of Flag Matroids (arXiv:2504.00267v2). This work provides a new axiom system for flag matroids, characterizes representability of uniform flag matroids, and gives forbidden-minor characterizations of full flag matroids representable over $\mathbb{F}_2$ and $\mathbb{F}_3$, along with equivalent characterizations of regular full flag matroids. For our taxonomy, this is the purely combinatorial pole of the flag concept: the flag is axiomatized independently of any ambient vector space, and representability asks when an abstract flag object can be realized concretely. The forbidden-minor method — classifying a class by minimal excluded objects — is precisely the audit-shaped reasoning pattern we highlight in Section 6.

[2] Even dimensional homogeneous Finsler spaces with positive flag curvature (arXiv:1407.3582v2). Here "flag" denotes flag curvature, a Finsler-geometric directional invariant. The paper uses Finslerian submersion to deduce a flag curvature formula for homogeneous Finsler spaces and, based on that formula, gives a complete classification of even-dimensional smooth coset spaces $G/H$ admitting $G$-invariant Finsler metrics with positive flag curvature, noting that the classification list coincides with that of the even-dimensional homogeneous Riemannian case, as far as the supplied (truncated) summary states. This is the differential-geometric pole: the flag is a point-plus-direction pair, and classification by positivity is again an exclusion-style result.

[3] Formalizing Flag Algebras in Lean (arXiv:2607.23500v1). Razborov's flag algebra method, as the entry states, is a powerful tool for proving asymptotic inequalities in extremal graph theory, often reducing the task to finding a finite certificate by semidefinite programming. The work presents a machine-checked formalization of the method for finite simple graphs, together with a certificate-to-proof compiler that turns externally generated certificate data into algebraic proofs (the entry's text is truncated mid-sentence). This entry is pivotal for our argument: it demonstrates that flag-structured combinatorial data can be compiled into machine-checkable proof objects, which is exactly the trust model an epistemic audit programme such as QNFO's would want to import.

[4] Total positivity in twisted product of flag varieties (arXiv:2211.11168v2). The authors show that the totally nonnegative part of the twisted product of flag varieties of a Kac–Moody group admits a cellular decomposition, with the closure of each cell a topological manifold with boundary, and establish explicit parameterizations of each totally positive cell; in the special cases of double flag varieties and braid varieties, the totally nonnegative parts are regular (per the truncated summary). This supplies the "positive cell" structure: flag varieties carry canonical decompositions into explicitly parameterized cells.

[5] Standard monomial theory and toric degenerations of Richardson varieties in flag varieties (arXiv:2103.16197v2). This work studies standard monomial bases for Richardson varieties inside the flag variety. The entry notes that writing down such a basis in general is challenging, involving defining chains or key tableaux, but that for a family of Richardson varieties indexed by compatible permutations the authors provide a very direct and straightforward combinatorial rule (text truncated). It exemplifies the algebraic pole: flags as varieties carrying canonical bases, with tractability hinging on combinatorial indexing.

[6] Bioriented flags and resolutions of Schubert varieties (arXiv:1810.05604v2). The authors use incidence relations running in two directions to construct a Kempf–Laksov type resolution for any Schubert variety of the complete flag manifold and an embedded resolution for any Schubert variety in the Grassmannian, as alternatives to Bott–Samelson resolutions; the second process led to the introduction of W-flag varieties. This is the geometric-representation pole and, notably, the only entry whose method is explicitly bidirectional incidence — a structural echo of the two-directional audits (claim against counterclaim) that the QNFO corpus practices [11].

[7] Open-Ended Learning Leads to Generally Capable Agents (arXiv:2107.12808v2). This work creates agents that perform well beyond a single task, defining a universe of tasks within a natively multi-agent environment domain and demonstrating generally capable agents across that space (the entry's text is truncated). Its relevance is methodological, not topical: the "universe of tasks" framing is a model for defining the space over which an audit or a re-entry claim quantifies. The supplied summary gives no further quantitative detail, and we draw no numerical claims from it.

[8] Guaranteed inference in topic models (arXiv:1512.03308v2). The entry states that posterior inference for individual texts is particularly important for topic models, especially with data streams, but is often intractable in the worst case, so existing methods are approximate and lack guarantees (the summary is truncated before stating which guarantees). We read it as the statistical-guarantee pole: the demand that inference carry certificates of quality, paralleling the certificate-to-proof compiler of [3]. The summary supplied is thin beyond this, and we relate the work to our argument only through what it states.

[9] QNFO: The Valuation Reading of the Qubit Delusion. Per the entry, The Qubit Delusion argues that the qubit-gate-circuit model of quantum computation imports a particle ontology inconsistent with quantum field theory, and that the field's failure to deliver commercially viable hardware after $35$ billion of investment is an epistemic crisis (entry truncated). The valuation reading asks whether the "adelic kernel" is load-bearing. This supplies the one economic figure we use ($35$ billion), taken as stated and not independently verified.

[10] QNFO: Vanishing ZBW Signal (ZBW–Majorana hypothesis). The entry states that the hypothesis, developed across four companion papers (P1–P4), establishes that zitterbewegung (ZBW) — the rapid trembling motion of Dirac fermions at the Compton scale — is a $\mathbb{Z}_2$ topological observable distinguishing Dirac from Majorana fermions at the hardware level (text truncated). This is the physical-observable pole of the corpus and the source of the Compton-scale quantity we compute as a projection in Section 4. A two-valued topological invariant is also the minimal nontrivial flagging scheme in the sense of Section 3.

[11] QNFO: The Vast World of Quantum Advantage — A Full-Spectrum Audit. Per the entry, this is a full-spectrum audit of Huang, Choi, McClean and Preskill (2025), "The vast world of quantum advantage" (arXiv:2508.05720), subjecting both the Huang et al. five-keystone framework and QNFO's own prior critiques to symmetric scrutiny, with the key finding that Theorem 1 is the most sophisticated challenge to QNFO's extant position (text truncated). This is the corpus's self-audit, and the structural precedent for the re-entry discipline we formalize: an audit that applies its own standards to itself.

[12] QNFO: The Adelic ZBW Programme. The entry states that the structural underdetermination of the position operator in relativistic quantum mechanics — manifested at the Archimedean place as zitterbewegung (the Newton–Wigner no-go) and at $p$-adic places as a discrete Bruhat–Tits observable — arises from a single representation-theoretic origin (the entry names "the Silen…" and is truncated). This is the synthesis pole, connecting [9]'s valuation reading and [10]'s observable proposal under one representational account. The summary is truncated; we use only what it states.

#3. Methods

#3.1 Taxonomy by incidence data

We classify each flag-structured object by the triple $(I, \leq, \mathcal{R})$, where $I$ is the indexing set of the chain, $\leq$ the nesting order, and $\mathcal{R}$ the realization relation:

Object                    I (chain index)         R (realization)
--------------------------------------------------------------------
Complete flag [1],[4-6]   {1,...,n-1}             subspace chain in V_n
Flag matroid [1]          ordered set             representable over F_q
Flag curvature [2]        (point, direction)      Finsler metric on G/H
Flag algebra [3]          finite graphs           SDP certificate
Nonneg. cells [4]         Weyl combinatorics      totally positive matrices
Standard monomials [5]    compatible perms        Richardson variety basis
Bioriented flags [6]      two-direction incidence Kempf-Laksov resolution
Audit structure [11]      claims in corpus        symmetric scrutiny

#3.2 The flagging operator

Let $\mathcal{S}$ be a corpus of research outputs. Define the flagging operator

where the first component is a status in the three-element set $\{R, Q, F\}$ — $R$ = result, $Q$ = open question, $F$ = flagged for remediation — and $\mathcal{D}$ is a set of justifying documents. The operator is certificate-gated in the sense of [3]: a status change from $Q$ to $R$ requires a certificate that passes a mechanical or referee-level check; a status change from $R$ to $F$ requires a documented failure mode. Three axioms, motivated in Section 2:

• A1 (Uniformity, after [7]). $\Phi_{\mathcal{S}}$ is defined on all of $\mathcal{S}$; every element of the corpus carries exactly one status.
• A2 (Symmetric scrutiny, after [11]). The same audit standard that demotes an external claim to $F$ applies to the flagging authority's own prior outputs.
• A3 (Two-directional incidence, after [6]). Each flag carries pointers in two directions: from the flagged item to its justifying documents, and from those documents back to every item whose status they affect.

#3.3 Counting method

For the quantitative case study we use only the definition of a complete flag and standard finite-field counting, stated in full so every step is checkable. Let $V_n$ be an $n$-dimensional vector space over $\mathbb{F}_q$. A complete flag is built by choosing, successively, a line in $V_n$, a plane containing it, and so on; at step $k$ the number of choices is the number of lines in a $(n-k+1)$-dimensional quotient, $\frac{q^{\,n-k+1}-1}{q-1}$. Hence

#3.4 Projection and open-question methods

The Compton-scale quantity is treated as a labeled projection: the inputs are standard physical constants stated explicitly below, and the output is the frequency scale at which the ZBW observable of [10] is posited to live. No experimental claim is made. The re-entry artifact is treated as a black box: the brief supplies no content for it, so we define the re-entry problem operationally rather than substantively.

#4. Analysis

Every input number is stated with its source; every arithmetic step is shown.

A1. Cardinality of $\mathrm{Fl}_3(\mathbb{F}_2)$. Inputs: $n = 3$, $q = 2$ (chosen as the smallest nontrivial field, the same $\mathbb{F}_2$ appearing in the representability results of [1]). Formula (Section 3.3):

A2. Cardinality of $\mathrm{Fl}_4(\mathbb{F}_2)$. Inputs: $n = 4$, $q = 2$.

A3. Cardinalities at ranks 5 and 6. Continuing the same recurrence:

A4. Growth factor. From A2 and A1:

and from A3:

Both checks confirm the general rule: passing from rank $n$ to rank $n+1$ multiplies the count by $2^{n+1} - 1$. Also, since each factor $2^j - 1 \geq 2^{\,j-1}$ for $j \geq 1$,

for $n = 4$ this gives $2^{6} = 64 \leq 315$, consistent with the exact value.

A5. Dimension of the complex flag variety. Input (stated here as our input): a complete flag in $\mathbb{C}^n$ is specified by $\binom{n}{2} = n(n-1)/2$ independent parameters, so $\dim_{\mathbb{C}} \mathrm{Fl}_n = \binom{n}{2}$. For $n = 4$:

A6. Flags per Coxeter chamber. Input (stated here as our input): the chambers of the type $A_{n-1}$ Coxeter complex on $\mathrm{Fl}_n(\mathbb{C})$ are indexed by permutations, so their number is $n!$. For $n = 4$: $4! = 24$. The ratio of binary flags to chambers at $n = 4$ is

Interpretation: over $\mathbb{F}_2$ there are $13.125$ times as many complete flags as there are chambers in the complex case at the same rank.

A7. Type counts for flag-algebra certificates. Input 2 (stated assumption, following the setting of [3]): under the assumption that flag-algebra types are labeled simple graphs on $k$ vertices, the number of labeled types is at most $T_{\text{lab}}(k) = 2^{\binom{k}{2}}$. For $k = 4$: $\binom{4}{2} = 6$, so $T_{\text{lab}}(4) = 2^{6} = 64$. For $k = 5$: $\binom{5}{2} = 10$, so $T_{\text{lab}}(5) = 2^{10} = 1024$, a growth factor of $1024/64 = 16 = 2^4$ per added vertex. Under the same assumption, the number of free scalar entries in a positive-semidefinite certificate matrix of dimension $T_{\text{lab}}(k)$ is at most

For $k = 4$: $M(4) = \frac{64 \cdot 65}{2} = 2080$. For $k = 5$: $M(5) = \frac{1024 \cdot 1025}{2} = 524800$. The ratio $M(5)/M(4) = 524800/2080 \approx 252.31$ illustrates the quadratic-in-dimension cost of enlarging the flag size by one vertex. These are upper bounds under the labeled assumption; the actual method uses unlabeled types, so the true counts are smaller.

A8. Information capacity of a three-state flag. Input (definition from Section 3.2): the status alphabet has size $|\{R, Q, F\}| = 3$. The information capacity of one flag, in bits, is

A corpus of $m$ independently flagged items carries at most $m \log_2 3$ bits of status information.

A9. Projection: Compton frequency scale for the ZBW observable. Inputs (standard constants, stated explicitly as assumptions of this projection): electron mass $m_e = 9.109 \times 10^{-31}\ \mathrm{kg}$, speed of light $c = 2.998 \times 10^{8}\ \mathrm{m\,s^{-1}}$, Planck constant $h = 6.626 \times 10^{-34}\ \mathrm{J\,s}$. Rest energy:

Compton frequency:

This is the frequency scale at which the $\mathbb{Z}_2$ topological ZBW observable of [10] would have to be modulated, per that entry's description of ZBW as rapid trembling motion at the Compton scale. It is a projection from stated constants, not a measurement, with relative uncertainty of order $10^{-3}$ from the four significant figures of the constants. If the intended scale is that of the reduced Compton wavelength, the value would differ by a factor of $2\pi$: $\nu_C/(2\pi) \approx 1.966 \times 10^{19}\ \mathrm{Hz}$; we report both readings as the projection's principal ambiguity.

A10. Economic input from the corpus. The only economic figure supplied is the $35$ billion of investment cited in [9], i.e. $3.5 \times 10^{10}$ dollars. Two illustrative arithmetic operations, both labeled non-results: at the hypothetical audit rate of one audit per $10^{9}$ dollars, the figure corresponds to

audits; and the ratio $\frac{3.5 \times 10^{10}}{1.236 \times 10^{20}} = 2.83 \times 10^{-10}\ \mathrm{USD\,s}$ is dimensionally a dollar-seconds quantity with no meaning absent an additional model. The entry for [9] reports no audit count, and we draw no conclusion from these divisions beyond their arithmetic.

A11. Bibliometric proportion. Inputs: the bibliography lists entries [1]–[12], so $N_{\text{total}} = 12$. Entries [1]–[6] each contain "flag" in the title (flag matroids, flag curvature, flag algebras, flag varieties, flag varieties, bioriented flags); entries [7]–[12] do not. Hence $N_{\text{flag}} = 6$ and

A12. The re-entry flag. The grounding block assigns status $Q$ (open question) to. Under A2 (symmetric scrutiny), this paper must apply the same standard to itself: the paper's own central claim — that $\Phi_{\mathcal{S}}$ is a coherent, useful abstraction — is itself assigned status $Q$, not $R$, because no empirical deployment is reported here. The paper therefore contains exactly two $Q$-flags: the re-entry DOI and the paper's own thesis.

#5. Results

All numbers below are those computed in Section 4; none are simulated or measured.

• R1. $\left| \mathrm{Fl}_3(\mathbb{F}_2) \right| = 21$ (A1, exact).
• R2. $\left| \mathrm{Fl}_4(\mathbb{F}_2) \right| = 315$ (A2, exact).
• R3. $\left| \mathrm{Fl}_5(\mathbb{F}_2) \right| = 9765$ and $\left| \mathrm{Fl}_6(\mathbb{F}_2) \right| = 615195$ (A3, exact).
• R4. The growth factor from rank $n$ to $n+1$ over $\mathbb{F}_2$ is exactly $2^{n+1} - 1$; verified at $n = 3$ as $15$ and at $n = 5$ as $63$ (A4). Lower bound $N_{\text{flag}}(2,n) \geq 2^{\,n(n-1)/2}$ (A4).
• R5. $\dim_{\mathbb{C}} \mathrm{Fl}_4 = 6$ (A5, exact).
• R6. The ratio of binary complete flags to complex Coxeter chambers at rank $4$ is $13.125$ (A6, exact).
• R7. Under the stated labeled-type assumption: $T_{\text{lab}}(4) = 64$, $T_{\text{lab}}(5) = 1024$, $M(4) = 2080$, $M(5) = 524800$ (A7, upper bounds under a stated assumption).
• R8. $I_{\text{flag}} = \log_2 3 \approx 1.58496$ bits (A8, exact expression with numerical evaluation).
• R9. Projection (stated assumptions: the constant values of A9): the Compton frequency scale relevant to the ZBW observable of [10] is $\nu_C \approx 1.236 \times 10^{20}\ \mathrm{Hz}$, with the reduced-scale alternative $\nu_C/(2\pi) \approx 1.966 \times 10^{19}\ \mathrm{Hz}$ (A9).
• R10. Non-results, reported for completeness: $35$ hypothetical audits at the stated rate, and $2.83 \times 10^{-10}\ \mathrm{USD\,s}$ (A10).
• R11. Bibliometric proportion $p = 6/12 = 0.5$ (A11, exact).
• R12. Status assignments: $Q$ for and $Q$ for this paper's own thesis under axiom A2 (A12; status assignments, not empirical results).

No empirical, experimental, or simulation results are reported in this paper; the re-entry artifact is not analyzed because the brief supplies no content for it.

#6. Discussion

Limitations. The survey is bounded by the twelve supplied entries; several summaries are truncated mid-sentence ([2], [3], [4], [5], [8], [9], [10], [11], [12]), and we have restricted every claim about those works to their stated text. In particular, we cannot report the content of Theorem 1 in [11] beyond that the entry calls it the most sophisticated challenge to QNFO's extant position, nor the identity of "the Silen…" in [12]. The counting results R1–R6 are elementary and serve as a worked demonstration of the incidence-counting method, not as new mathematics; the Gaussian-binomial product is classical. The bibliometric proportion R11 is over a curated list, not an unbiased corpus, and counts only title-level mentions of "flag"; works using flag concepts implicitly would be missed, so $0.5$ is a baseline for this list only.

The metaphor risk. The paper's unifying claim — that flag varieties, flag matroids, flag algebras, flag curvature, and epistemic flagging share a nested/directional structure — is an analogy, not a theorem. We have not exhibited a single formal object that instantiates all of these. A skeptic could correctly object that the shared word is doing rhetorical work that the mathematics does not underwrite: the flag curvature of [2] is an analytic invariant, while the flag matroids of [1] are combinatorial, and nothing in the supplied entries connects them beyond vocabulary. We accept this objection and downgrade the unification claim accordingly: what is shared is the methodological role (marking accessible regions of a space, classifying by exclusion and certificate), not the mathematics. The taxonomy of Section 3.1 may also be too coarse: flag algebras [3] are limit objects over growing graphs, not finite chains, so their inclusion relies on the shared certificate structure rather than literal incidence.

Failure modes of the flagging operator. Three are visible. (i) Threshold arbitrariness: the transitions between statuses are community conventions; a badly calibrated threshold turns $\Phi_{\mathcal{S}}$ into a noise amplifier. (ii) Certificate gaming: the gate of [3]-style mechanical checking is only as strong as the checker; a formalization with incomplete specification can admit malformed certificates. (iii) Reflexivity failure: without A2, a flagging authority becomes an unaccountable gatekeeper.

What would falsify our claims. The thesis that flag-structured incidence is a shared substrate would be weakened if a field in the survey could be shown to use "flag" with no decomposable incidence content; we know of none within the supplied entries, but the entries are summaries, and full texts could reveal disanalogies. The projection R9 would be falsified as a reading of [10] if that programme's Compton scale is defined differently from either reading above. The bibliometric proportion would be falsified as a prevalence estimate by any comprehensive audit showing a markedly different share.

The re-entry problem as an open question. Per the brief, the re-entry from is an open question, not a result. We state it operationally: a successful re-entry must (i) exhibit the artifact's content, (ii) state which claims of the QNFO corpus ([9]–[12]) it re-enters, (iii) provide a certificate — in the sense of [3]'s certificate-to-proof compiler — that its central inequalities or classifications hold, and (iv) survive the symmetric-scrutiny standard that [11] applies to itself. Falsification of a re-entry claim would follow from failure of (iii) or from asymmetric scrutiny relative to (iv). Open questions: Does the adelic kernel of [9] bear weight in the sense of being eliminable or not under (iii)? Is the $\mathbb{Z}_2$ ZBW observable of [10] operationalizable at the $\nu_C$ scale of R9, or only at the reduced scale? Can the forbidden-minor method of [1] be transported to audit structures, i.e., are there minimal "non-auditable" corpora?

Arguing against ourselves. The strongest objection to this paper is that it computes only classical, known quantities and surveys only summaries; a referee may judge R1–R6 as pedagogical and R9 as a mere unit conversion dressed as a projection. Our rebuttal is that the paper's contribution is deliberately methodological: it demonstrates that every quantitative claim in a cross-domain survey can be made fully derivable from stated inputs, and that the discipline of assigning statuses via the operator $\Phi_{\mathcal{S}}$ — with symmetric scrutiny under A2 — is testable practice rather than metaphor. If that discipline is adopted and found useless, the paper fails on its own terms; that is the intended falsifiability of the thesis we ourselves flag as $Q$.

#7. Conclusion

We surveyed twelve bibliography entries, six concerning flag-structured mathematics ([1]–[6]) and six supplying methodological and epistemic-critique context ([7]–[12]), and read them through a single operator $\Phi_{\mathcal{S}}$ that assigns certificate-gated statuses to research outputs. With fully shown arithmetic we derived the exact cardinalities $|\mathrm{Fl}_n(\mathbb{F}_2)| = 21, 315, 9765, 615195$ for $n = 3, 4, 5, 6$, the exact growth factor $2^{n+1} - 1$, the dimension $\dim_{\mathbb{C}} \mathrm{Fl}_4 = 6$, the ratio $13.125$ of binary flags to Coxeter chambers at rank $4$, upper bounds $M(4) = 2080$ and $M(5) = 524800$ on flag-algebra certificate sizes under a stated labeled-type assumption, the information capacity $\log_2 3 \approx 1.58496$ bits per flag, and — as an explicitly labeled projection — the Compton frequency scale $\nu_C \approx 1.236 \times 10^{20}\ \mathrm{Hz}$ (with the reduced-scale alternative $\nu_C/(2\pi) \approx 1.966 \times 10^{19}\ \mathrm{Hz}$) relevant to the ZBW observable proposed in [10]. The re-entry from is held strictly at status $Q$, with success criteria (i)–(iv) and falsification conditions stated in Section 6; the paper's own unification thesis is likewise held at $Q$ under the symmetric-scrutiny axiom A2. The contribution is methodological: incidence-structured reasoning is a shared substrate of the surveyed fields, and cross-domain audits improve when that substrate, and the status of every claim upon it, is made explicit and checkable.

#References

[1] Representability of Flag Matroids. arXiv:2504.00267v2. https://arxiv.org/abs/2504.00267v2 [2] Even dimensional homogeneous Finsler spaces with positive flag curvature. arXiv:1407.3582v2. https://arxiv.org/abs/1407.3582v2 [3] Formalizing Flag Algebras in Lean. arXiv:2607.23500v1. https://arxiv.org/abs/2607.23500v1 [4] Total positivity in twisted product of flag varieties. arXiv:2211.11168v2. https://arxiv.org/abs/2211.11168v2 [5] Standard monomial theory and toric degenerations of Richardson varieties in flag varieties. arXiv:2103.16197v2. https://arxiv.org/abs/2103.16197v2 [6] Bioriented flags and resolutions of Schubert varieties. arXiv:1810.05604v2. https://arxiv.org/abs/1810.05604v2 [7] Open-Ended Learning Leads to Generally Capable Agents. arXiv:2107.12808v2. https://arxiv.org/abs/2107.12808v2 [8] Guaranteed inference in topic models. arXiv:1512.03308v2. https://arxiv.org/abs/1512.03308v2 [9] QNFO: The Valuation Reading of the Qubit Delusion: Is the Adelic Kernel Load-Bearing? [10] QNFO: Vanishing ZBW Signal: The ZBW-Majorana Hypothesis as a Unified Framework for Topological Fermion Distinction [11] QNFO: The Vast World of Quantum Advantage — A Full-Spectrum Audit [12] QNFO: The Adelic ZBW Programme: ZBW-Majorana Hypothesis, Ostrowski-QEC Synthesis, and Cross-Programme Consilience