Domino tilings of odd-height rectangles up to symmetry: a 16-page preprint, reproducible computations, and Lean 4 M1-M11 formalization.
Exploratory numerical extension of strict m-gonal cactus graph enumeration to mixed cycle-length sets (Ω = {5, 6}), via split-decomposition.
Algebraic generating functions, permutation bases, and formal proofs for generalized stack sorting.
Proof that the numbers of hairpins and basepairs in a random RNA secondary structure are asymptotically jointly normal, with correlation sqrt(5 sqrt5 - 11)/2 (a conjecture of Bu, Kauers and Zeilberger)
Exhaustive enumeration of unlabeled Riordan graphs, i.e. graphs whose adjacency matrix is a Riordan array (g,f) over Z₂. Computes u(n) for n≤17 by two independent C++/nauty methods (a third for n≤10), lists every graph with its generating functions and matrices, and samples them uniformly. Data, logs and tests included for full reproducibility.(OEI
Verification code for "Strict Monotonicity and a Lambert-W Asymptotic for Growth Rates of Non-Plane Strict m-Gonal Cacti" - 7 independent verification routes (Python, SymPy, PARI/GP, Coq)
Verification code for "Enumeration and Asymptotic Analysis of Unlabelled Vertex-Rooted Strict Non-Plane Cactus Graphs" — extends the companion single-length paper to finite mixed \(\Omega\). Includes an exact grammar solver, high-precision critical-point solver, Table 1 reproduction, and a 14-test regression suite.
Independent verification code for "Enumeration of Non-Plane m-Gonal Cactus Graphs via Split-Decomposition"
To associate your repository with the enumerative-combinatorics topic, visit your repo's landing page and select "manage topics."