Search arXivSearch

arXiv · 2609.16776

Exact Labelled Layer-Order Classification for Period-2 Mountain--Valley Assignments on 2 x 2k Maps

Abstract

We classify the labelled final layer orders of ordinary orthogonal 2 x 2k maps whose mountain-valley assignments are periodic with period two in each crease family. For k >= 2, local flat-foldability leaves 16 of the 64 formal period words. Eight pleat words have a unique labelled state. The remaining eight words reduce, under labelled symmetries, to two constant-row families described by row pivots. For the canonical word MMMMVV, an ordered pivot pair (a,b) is realizable exactly when a = 1, a = m, or a = b, where m = 2k - 1. For MVMMMM, realizability is equivalent to BR(a) = BR(b). In both families each compatible ordered pivot pair determines a unique labelled state. The resulting state counts are 0, 1, 6k - 5, and 4k - 3. The case k = 1 is treated separately because two formal period bits have no physical crease carriers.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michael Fofonov. 2026-09-15. Exact Labelled Layer-Order Classification for Period-2 Mountain--Valley Assignments on 2 x 2k Maps. https://arxiv.org/abs/2609.16776

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO