On the number of extension closed additive subcategories for uniformly oriented $A_n$ quivers

Abstract: We provide a recurrence for computing the terms of the OEIS sequence A393920, introduced in \cite{KS}. We also describe a surprising connection between A393920 and the Fibonacci sequence A000045, obtain non-trivial lower and upper exponential bounds for its growth, and investigate connections with partial orders, Catalan numbers, and convex topologies on finite chains. For the representation-theoretic lattice underlying A393920, we describe its atoms, coatoms, join-irreducible and meet-irreducible elements.

• The paper presents an effective recurrence for enumerating extension closed additive subcategories in Aₙ₊₁ quivers, connecting the counts to classical integer sequences.
• It employs recursive combinatorial models to reveal explicit links with Fibonacci and Catalan numbers, enhancing computational efficiency.
• The study establishes sharp exponential bounds and analyzes the poset structure, offering deep insights into the interplay between algebra and combinatorics.

Extension Closed Additive Subcategories in Uniformly Oriented $A_n$ Quivers

Introduction and Scope

This paper provides a comprehensive study of the enumeration of extension closed, additive, idempotent split subcategories in the representation category of uniformly oriented $A_{n+1}$ quivers, connecting this problem to recurrences, exponential bounds, and several classical integer sequences. The author establishes an effective recurrence governing OEIS sequence A393920, articulates its relation to Fibonacci and Catalan numbers, explores structural combinatorics of the corresponding poset, and analyzes both lower and upper exponential asymptotics for the sequence's growth. Methodologically, the work leverages recursive combinatorial models and relates algebraic concepts in quiver representation theory to concrete combinatorial and enumerative data.

Combinatorial Model and Main Results

The essential construction is the set $\mathcal{Q}(n)$, a finite subset of $\mathbb{Z}^2$ organized into a triangular array, together with the family $\mathcal{R}(n)$: collections of subsets of $\mathcal{Q}(n)$ satisfying an extension-closure-like condition (Condition $(\star)$) analogous to the axioms satisfied by extension closed additive subcategories. Specifically, Condition $(\star)$ forces closure under taking coordinate-wise minima and, in certain cases, maxima (“neighboring” intervals in the quiver sense).

The principal enumeration, $R_n = |\mathcal{R}(n)|$, is shown to count the full, additive, idempotent split extension closed subcategories in the module category of the uniformly oriented $A_{n+1}$ quiver. The paper articulates a mutually recursive system governing the sequence via auxiliary functions $A_{n+1}$0 and $A_{n+1}$1, and provides their explicit initial conditions and interlacing recurrences. The result is a practical recurrence for efficient computation of $A_{n+1}$2 and $A_{n+1}$3, with correctness established by translating the combinatorial recurrences into equivalent statements on extension closure in representation categories.

Enumeration: Recurrences and Connections to Classical Sequences

The recurrences for $A_{n+1}$4 and $A_{n+1}$5 enable a sharp computational approach, extending the explicit computation from previously accessible $A_{n+1}$6 to values of $A_{n+1}$7 at least in the hundreds. The computational efficiency and scalability are directly addressed, excising the naive powerset algorithm via a recursive graph-based dynamic program. The author highlights a surprising connection: the quotient state graph describing the recursive structure admits a stratification whose vertices at level $A_{n+1}$8 are counted by the classical Fibonacci numbers with odd indices, i.e., $A_{n+1}$9. This connection is rigorously established via an isomorphism between recursively constructed quotient graphs and an explicitly defined “state graph” $\mathcal{Q}(n)$0 whose stratification and enumeration are shown, by induction, to match the Fibonacci counts.

Furthermore, boundary cases of the auxiliary recurrences yield connections to the Catalan numbers, specifically $\mathcal{Q}(n)$1 recovers the standard formula for $\mathcal{Q}(n)$2, and convex topologies on finite chains are interpreted combinatorially as a specialized case of the overall enumeration, directly relating $\mathcal{Q}(n)$3 to OEIS sequence A234268.

Asymptotic Growth: Exponential Lower and Upper Bounds

A detailed analysis of the sequence’s growth is provided, establishing that $\mathcal{Q}(n)$4 grows strictly exponentially. The lower bound is obtained via construction of an explicit truncated recurrence and computer-assisted majorization, ultimately proving $\mathcal{Q}(n)$5. The upper bound emerges from analytic combinatorics, specifically the analysis of a nonlinear generating function system for the weighted version of the recurrence, which yields an exponential bound with base approaching $\mathcal{Q}(n)$6. Both bounds are quantitatively tight via a combination of symbolic manipulation and asymptotic analysis using generating functions, yielding the sandwich

$\mathcal{Q}(n)$7

The methods illustrate robust cross-fertilization between algebraic representation theory and analytic combinatorics.

Lattice Structure and Poset Analysis

The paper also investigates the poset and lattice structure of $\mathcal{Q}(n)$8. The main results include explicit enumeration and characterization of atoms (singleton subsets), coatoms (removal of columns or rows corresponding to certain subsets), join- and meet-irreducibles, and the non-distributivity of the resulting lattice. The author details the description of substructures, including the criteria for meet-irreducibility and the combinatorics of closure operators, with proofs balancing recursive combinatorics and careful consideration of the implications of the extension closure condition.

Theoretical and Structural Implications

The combinatorial model constructed provides a bridge between additive subcategory structure in representation theory and classical objects in enumerative combinatorics. The recurrence supplied not only allows for new computational access to previously intractable cases, but also reveals hidden combinatorial symmetries and incidences with canonical integer sequences. The structural theory uncovered, particularly the stratification by state graphs, the connection with naturally labeled posets, and the intricate behavior of the lattice of extension closed sets, deepens our conceptual understanding of the interplay between representation theory, category theory, and discrete mathematics.

Future Directions

Possible future directions include a full characterization of the generating function for $\mathcal{Q}(n)$9, closed forms for $\mathbb{Z}^2$0 (modulo the recurrence), extensions to other types (e.g., $\mathbb{Z}^2$1, $\mathbb{Z}^2$2) or to quivers with more general orientation or relation, as well as exploration of higher order homological or categorical closure operators in this context. Investigation of spectral properties or additional combinatorial invariants of the state graphs $\mathbb{Z}^2$3 may yield further deep connections to Coxeter combinatorics and cluster theory.

Conclusion

This work provides a rigorous, algorithmically effective, and structurally rich treatment of the enumeration problem for extension closed additive subcategories in the module categories of $\mathbb{Z}^2$4 quivers. By integrating analytic, combinatorial, and categorical approaches, the paper yields not only sharp computational tools but also reveals strong connections to Fibonacci, Catalan, and other integer sequences, enriching the interface between representation theory and enumerative combinatorics. The exact and asymptotic analysis established here sets the foundation for further exploration into the combinatorics of categorical lattices and the enumeration of algebraically defined substructures.