trureturingGitHub MATHEMATICAL ATLAS

Combinatorics / CONCEPT

Actual lattice-word extremal descent obligation

Define the original finite carrier for Shankar's 321-avoiding lattice words, its strict descent fiber, explicit candidate extremizers, and an all-parameter even construction. The all-k maximum and fiber-cardinality law remains unproved.

Closed Authored exposition
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES1
PROOF DEPTH0
DOCUMENT LINKS0
THEOREM

Actual even words at the proposed descent level

RELATIONSHIP ATLAS

Every connection, in context.

Explore in 3D
Direct recorded relationships
Actual lattice-word extremal descent obligationActual lattice-word extremaldescent obligationOdd lattice-word constructionOdd lattice-word construction
Proof dependencyStructural affinityDocument link

Certified topology / UPSTREAM

Prerequisites

None recorded in this release.

Certified topology / DOWNSTREAM

Consequences

RELATED KNOWLEDGE

Structural connections

Documents & exposition

None recorded in this release.

Other authored & advisory relationships

None recorded in this release.

LIBRARY / RELEASE VERSIONS

Content history

Loading release versions...
Browse the archive

Certified provenance

Exact release coordinate

Authority boundary

Dependency edges, status, and source coordinates come from the verified release and certified topology. Blueprint exposition is labeled separately. A fallback title carries no additional mathematical authority.