What If tan(1) Were Constructible?
A thought experiment: if tan(1) could be built from EML trees, what would follow? The conditional chain connects to Schanuel's conjecture and would collapse the depth hierarchy.
conjecture 3 posts
Is the EML Closure Dense in ℂ?
We enumerated EML constant trees to depth 7, tested 20 random complex targets, and tracked how close EML gets to π. Strong evidence for a density conjecture — but not yet a theorem.
The Pumping Lemma for EML Trees
Depth-k trees have at most 2^k zeros (proved). Observed maximum is O(k). The gap suggests a tighter bound — still open.