Skip to content

Feasible Ecologies: Complete Maple implementation for ecological sign pattern completion

scholten requested to merge public-release into main

This repository contains a comprehensive Maple implementation for computing sign pattern completions in ecological systems using oriented matroid theory and Grassmann-Plücker relations.

Key Features:

  • Tree search with sign propagation for exponential search space reduction
  • Grassmann-Plücker relation enforcement for combinatorial coherence
  • Feasibility and stability constraint checking (Routh-Hurwitz conditions)
  • Complete API with 55+ implementation files
  • Comprehensive examples demonstrating various ecological scenarios
  • Performance: 2^28 → 33 states explored (99.999988% reduction) for 4-species systems

The system takes partial sign patterns on chi function coordinates from ecological interaction matrices and outputs complete sign patterns satisfying mathematical constraints for stable, feasible ecological equilibria.

Licensed under MIT License. Ready for academic and research use.

Merge request reports