Sparsity is Combinatorial Depth: Quantifying MoE Expressivity via Tropical Geometry

While Mixture-of-Experts (MoE) architectures define the state-of-the-art, their theoretical success is often attributed to heuristic efficiency rather than geometric expressivity. In this work, we present the first analysis of MoE through the lens of tropical geometry, establishing that the Top-k routing mechanism is algebraically isomorphic to the k-th elementary symmetric tropical polynomial. This isomorphism partitions the input space into the Normal Fan of a Hypersimplex, revealing that sparsity is combinatorial depth which scales geometric capacity by the binomial coefficient binomNk. Moving beyond ambient bounds, we introduce the concept of textitEffective Capacity under the Manifold Hypothesis. We prove that while dense networks suffer from capacity collapse on low-dimensional data, MoE architectures exhibit textitCombinatorial Resilience, maintaining high expressivity via the transversality of routing cones. Translating these theoretical bounds into architectural principles, we derive asymptotic capacity limits for optimal expert granularity and prove that shared experts are geometrically necessary to prevent routing collapse.