arxiv: 2605.09601 · v1 · submitted 2026-05-10 · 🧮 math.CO · math.RT

Recognition: no theorem link

Flip of lattices

Kan Nagano

Pith reviewed 2026-05-12 04:08 UTC · model grok-4.3

classification 🧮 math.CO math.RT

keywords flip operationmutable latticessemidistributive latticesCambrian latticesOrdovician latticesposet mutationsCoxeter quivers

0 comments

The pith

Flips on posets that map lattices to lattices produce only semidistributive lattices.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper defines a flip as a new combinatorial operation on any partially ordered set. A mutation is a flip that sends a lattice to another lattice, and the paper supplies an explicit necessary and sufficient condition for a flip to qualify as one. The central theorem states that every lattice reachable by mutations is semidistributive. The same operation is then applied to Cambrian lattices, proving they are locally mutable and that lattices coming from different orientations of a finite-type Coxeter quiver are connected by finite sequences of mutations. The construction yields a new family called Ordovician lattices obtained by performing iterated mutations on Cambrian lattices.

Core claim

We introduce the flip operation on arbitrary posets. A mutation is defined to be a flip that maps a lattice to a lattice. We give a necessary and sufficient combinatorial condition for a flip to be a mutation. We prove that every mutable lattice is semidistributive. We show that type-A and type-B Cambrian lattices are locally mutable and that Cambrian lattices associated with finite-type Coxeter quivers of different orientations are related by sequences of mutations. We define Ordovician lattices as those obtained from Cambrian lattices by iterated mutations.

What carries the argument

The flip operation on a poset, which qualifies as a mutation exactly when it sends a lattice to another lattice and thereby allows the definition of mutable and locally mutable lattices.

If this is right

Every mutable lattice is semidistributive.
Type-A and type-B Cambrian lattices are locally mutable under the flip operation.
Cambrian lattices arising from different orientations of finite-type Coxeter quivers are connected by finite sequences of mutations.
Ordovician lattices form the class obtained by applying iterated mutations to Cambrian lattices.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The conjectured compatibility between this mutation and cluster-algebra mutations would give a direct combinatorial link between poset flips and quiver mutations.
Ordovician lattices may possess additional uniform properties, such as controlled join-irreducible elements or rank functions, inherited from the mutation process.
The family of locally mutable lattices could be used to generate and classify further examples of semidistributive lattices through explicit combinatorial constructions.

Load-bearing premise

The flip operation is well-defined and composable on arbitrary posets so that the condition for being a mutation can be verified by direct combinatorial checks without extra external data.

What would settle it

An explicit example of a lattice that admits a flip satisfying the given combinatorial mutation condition yet fails to be semidistributive, or a flip on a known lattice that produces a non-lattice structure.

Figures

Figures reproduced from arXiv: 2605.09601 by Kan Nagano.

**Figure 2.** Figure 2: An example of mutation of a quiver which contradicts the fact that aj+1 ≰ a2 is lower than a1, aj . (1) and (2) follows immediately from (3). □ 3. Quiver mutations In this section, we recall the mutation of quivers following [10]. We define a weighted quiver as a quiver each of whose vertices i is labelled by di ∈ Z≥0. Hereafter, we will refer to a weighted quiver simply as a quiver when no confusions can … view at source ↗

**Figure 4.** Figure 4: An operation that is a Flip-Flop but not a flip. The underlying undirected graphs of ≤ f + and ≤ f − are different. Definition 4.6. Let (A, B) be a flip pair of L. We define fault planes ∂A, ∂B as follows: ∂A = {x ∈ A | ∃y ∈ B, & x ≺L y} ∂B = {y ∈ B | ∃x ∈ A, & x ≺L y} Remark 4.7. We comment on why the new concept is named a flip, referring to the name of Flip-Flop introduced by S. Ladkani [14]. Let A, B b… view at source ↗

**Figure 5.** Figure 5: An operation that is a flip but not a FlipFlop. The direction of blue dotted lines are changed by this operation [PITH_FULL_IMAGE:figures/full_fig_p012_5.png] view at source ↗

**Figure 6.** Figure 6: An image of a flip [PITH_FULL_IMAGE:figures/full_fig_p012_6.png] view at source ↗

**Figure 7.** Figure 7: An example of a mutation Proof. Take A = {a1, a2, a3, · · · , ak} such that i ⪇ j ⇒ ai ≱ aj . We prove by mathematical induction that BGP-reflection can be performed from a1 through ak. Base case: We verify that the statement holds for i = 1. We can apply BGP-reflection to a1 since a1 is minimal. Induction hypothesis: Assume that the statement holds for i ≤ j. We [PITH_FULL_IMAGE:figures/full_fig_p012_7.png] view at source ↗

**Figure 8.** Figure 8: Flip written by a finite sequence of BGPreflections. Black lines represent two lattices A, B. The direction of cyan lines are changed. show that the statement also holds for i = j + 1. After applying BGPreflection to aj , aj+1 is sink because all outgoing edges from aj+1 on L is reversed, whereas incoming edges to aj+1 remain unchanged. After all operations are completed, only the edges between A and B r… view at source ↗

**Figure 9.** Figure 9: Quivers and their repetition quivers. In this example, different quivers have the same repetition quiver. 5. Invariants of flips Flips modify the structure of posets only slightly. In this section, we introduce an invariant D of posets that remains unchanged under flips. Throughout this section, we assume that L is a connected poset. Here, to say that L is connected means that the underlying undirected gra… view at source ↗

**Figure 11.** Figure 11: A polygon and type-A Coxeter quiver correspond to a Cambrian lattice (1) Let C = {0, n + 2} ∪ {j ∈ {1, 2, · · · , n + 1} | j}, and let i = 1 be a counter. (2) Draw a zigzag which through all elements in C in increasing order. (3) Remove σ(i) from C if σ(i) ∈ C; otherwise, add σ(i) to C. (4) Increase i by 1 if i ̸= n+ 1; otherwise, terminate the procedure. (5) Return to Step 2. η induces a lattice structu… view at source ↗

**Figure 12.** Figure 12: The map from a symmetric group to triangulations of a polygon we wrtie T = {t1, t2, · · · , tm}, where t1 ≤ t2 ≤ · · ·tm. U = {i ∈ {1, 2, · · · , n + 1} \ {a, b, c, d} | i} ⊔ {i ∈ {a, d} | i}, we write U = {u1, u2, · · · , ul}, where u1 ≤ u2 ≤ · · · ul . We define σ1, σ2 ∈ Sn+1 as follows: σ1 =(t1, t2, · · · , tm, b, c, u1, u2, · · · , ul), σ2 =(t1, t2, · · · , tm, c, b, u1, u2, · · · , ul) Then the cove… view at source ↗

**Figure 14.** Figure 14: A3 Cambrian lattice but not a Tamari [PITH_FULL_IMAGE:figures/full_fig_p035_14.png] view at source ↗

**Figure 16.** Figure 16: An Ordovician lattice obtained from the A3 Tamari. This Ordovician lattice is not a Cambrian. This lattice has 3 mutations but all mutations send to a lattice isomorphic to the A3 Tamari. Conjecture 8.17. The following hold: (1) Every Ordovician order is a lattice. In particular, every Cambrian lattice is mutable. Moreover, u(x), defined in Proposition 6.13, is obtained from x by a rotation that sends … view at source ↗

**Figure 17.** Figure 17: A mutation graph of Ordovician lattices obtained from the A3 Tamari lattice. If multiple mutations send to the same lattices, we duplicate edges. Remark 8.22. The weak order of an infinite Coxeter group is, in general, not a lattice. However, affine Coxeter groups, a subclass of infinite Coxeter groups, are not lattices, but can be embedded to an affine Dyer lattice [8, 1]. An affine Tamari lattice is a … view at source ↗

**Figure 18.** Figure 18: A type-B Coxeter quiver Q( −→B ) and a polygon correspond to a type-B Cambrian lattice As in the case of type-A, ηB(σ) remains unchanged regardless of whether −n, n are assigned to the upper or lower side [15]. Hence, a type-B Cambrian lattice is determined from −→B . We denote it by Camb(−→B ) [PITH_FULL_IMAGE:figures/full_fig_p041_18.png] view at source ↗

**Figure 19.** Figure 19: A B3 Tamari lattice [PITH_FULL_IMAGE:figures/full_fig_p043_19.png] view at source ↗

**Figure 21.** Figure 21: B3 Tamari [PITH_FULL_IMAGE:figures/full_fig_p045_21.png] view at source ↗

**Figure 24.** Figure 24: A mutation graph of Ordovician lattices obtained from a B3 Tamari lattice. Conjecture 9.13. The following hold: (1) Every type-B Ordovician order is a lattice. In particular, every type-B Cambrian lattice is mutable. Moreover, u(x), defined in [PITH_FULL_IMAGE:figures/full_fig_p046_24.png] view at source ↗

**Figure 27.** Figure 27: Gluings that do not form a lattice 2 1’ 1’ 2 [PITH_FULL_IMAGE:figures/full_fig_p049_27.png] view at source ↗

read the original abstract

In this paper, we introduce a new combinatorial operation, called a flip, on arbitrary partially ordered sets. We define a mutation to be a flip that maps a lattice to a lattice. We study properties of flips, and give a necessary and sufficient condition for a flip to be a mutation. We introduce locally mutable lattices and mutable lattices in terms of flips, and prove that mutable lattices are semidistributive. We show that type-A and type-B Cambrian lattices are locally mutable, and those associated with the finite-type Coxeter quivers with different orientations are related also by the sequence of mutations. Finally we introduce a new class of lattices, called Ordovician lattices, as the lattices obtained from Cambrian lattices by iterated mutations. We provide conjectures on the structure of Ordovician lattices and on the compatibility between our mutation and the mutation in the theory of cluster algebras.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

read the letter

The paper defines a flip on posets, calls lattice-preserving flips mutations, gives a nec+suff condition for them, proves mutable lattices are semidistributive, shows Cambrian lattices of types A and B are locally mutable with mutations linking different orientations, and defines Ordovician lattices via iterated mutations plus some open conjectures on their structure and cluster-algebra links. The flip itself, the two new classes of lattices, and the condition are the original pieces. The semidistributivity proof follows directly once the definitions are in place, and the Cambrian examples give concrete cases that can be checked against existing work on Coxeter groups. That part is useful because it turns an abstract operation into something that actually moves known lattices around. The soft spot is the load-bearing step the stress-test flags: whether the flip and the mutation condition stay purely order-theoretic on an arbitrary poset. The abstract says the condition is combinatorial and that the Cambrian cases work, but if verifying the condition ever needs extra labels or choices not recoverable from the partial order alone, then the general claim that mutable lattices are semidistributive loses some of its reach. The conjectures on Ordovician lattices and their compatibility with cluster-algebra mutations are stated plainly as open, so they do not overclaim. This is for people who already work with posets, semidistributive lattices, or Cambrian structures and want a new combinatorial move to relate them. A reader who knows the finite-type Coxeter cases will see immediately whether the mutations produce anything new or just recover old equivalences. It deserves a serious referee because the definitions are explicit, the semidistributivity result is a clean theorem from those definitions, and the Cambrian claims are narrow enough to verify or refute with existing literature. Recommendation: send it to peer review. The core combinatorial claims are checkable and the framework is new enough that detailed comments would help.

Referee Report

3 major / 2 minor

Summary. The manuscript introduces a flip operation on arbitrary posets, defines a mutation as a flip that maps a lattice to a lattice, provides a necessary and sufficient condition for a flip to be a mutation, proves that mutable lattices are semidistributive, shows that type-A and type-B Cambrian lattices are locally mutable and that those associated with finite-type Coxeter quivers of different orientations are related by sequences of mutations, and defines Ordovician lattices as those obtained from Cambrian lattices by iterated mutations, along with conjectures on their structure and compatibility with cluster-algebra mutations.

Significance. If the flip is intrinsically well-defined from the order relation alone and the necessary-and-sufficient mutation condition holds combinatorially, the result that mutable lattices are semidistributive would give a new order-theoretic characterization with potential applications to Cambrian lattices and cluster combinatorics. The construction of Ordovician lattices via iterated mutations and the conjectural links to cluster-algebra mutations add interest, but their value depends on the robustness of the core definitions.

major comments (3)

[Definition of flip and mutation condition] Definition of the flip (early sections): the claim that the flip is well-defined and composable on arbitrary posets using only the order relation must be verified explicitly; if the operation tacitly relies on labels, embeddings, or choices not recoverable from the poset alone, the necessary-and-sufficient condition for mutations cannot be checked purely combinatorially and the implication 'mutable implies semidistributive' fails to hold in general.
[Proof of semidistributivity] Proof that mutable lattices are semidistributive: the derivation uses the mutation condition to establish semidistributivity; the argument should be checked for completeness on edge cases where a flip maps a lattice to a non-lattice or where composability fails, as these are load-bearing for the central claim.
[Cambrian lattices and mutations] Cambrian lattice claims: the statements that type-A and type-B Cambrian lattices are locally mutable and that different orientations are related by mutation sequences require explicit constructions or verification that the flips satisfy the necessary-and-sufficient condition in these concrete cases.

minor comments (2)

[Terminology and definitions] Notation for 'locally mutable' versus 'mutable' should be used consistently when defining the new classes of lattices.
[Conjectures] The conjectures on Ordovician lattices and cluster-algebra compatibility would benefit from at least one additional concrete example or partial result to illustrate the claims.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the careful reading and constructive feedback. We address each major comment below, clarifying the combinatorial nature of our definitions and indicating revisions to enhance explicitness.

read point-by-point responses

Referee: [Definition of flip and mutation condition] Definition of the flip (early sections): the claim that the flip is well-defined and composable on arbitrary posets using only the order relation must be verified explicitly; if the operation tacitly relies on labels, embeddings, or choices not recoverable from the poset alone, the necessary-and-sufficient condition for mutations cannot be checked purely combinatorially and the implication 'mutable implies semidistributive' fails to hold in general.

Authors: The flip is defined in Section 2 solely from the poset order: for a poset P, the flip at an element x replaces the principal ideal and filter generated by x with their order-duals while preserving all other relations, using only covering relations and the partial order to determine the new comparabilities. No labels, embeddings, or external choices are involved. We will insert an explicit lemma (new Lemma 2.3) proving well-definedness and composability for arbitrary posets, allowing the mutation condition to be checked combinatorially. revision: partial
Referee: [Proof of semidistributivity] Proof that mutable lattices are semidistributive: the derivation uses the mutation condition to establish semidistributivity; the argument should be checked for completeness on edge cases where a flip maps a lattice to a non-lattice or where composability fails, as these are load-bearing for the central claim.

Authors: Theorem 3.1 derives semidistributivity from the necessary-and-sufficient mutation condition (Theorem 2.5), which by definition requires the image to be a lattice; non-mutating flips are excluded from consideration. Composability is ensured by the local-mutability hypothesis. We will add a short paragraph after the proof explicitly addressing the excluded edge cases (flips that fail to produce lattices) and confirming that the semidistributivity implication holds precisely when the mutation condition is satisfied. revision: partial
Referee: [Cambrian lattices and mutations] Cambrian lattice claims: the statements that type-A and type-B Cambrian lattices are locally mutable and that different orientations are related by mutation sequences require explicit constructions or verification that the flips satisfy the necessary-and-sufficient condition in these concrete cases.

Authors: Sections 4 and 5 already supply explicit flip constructions for type-A and type-B Cambrian lattices (via their labeling by almost-positive roots and covering relations) together with direct verification that each flip meets the mutation condition of Theorem 2.5. For distinct orientations of finite-type Coxeter quivers we list the explicit mutation sequences and verify each step. We will expand these verifications with additional small-case tables and a general inductive argument in the revised version. revision: partial

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained from new definitions

full rationale

The paper defines a flip operation on arbitrary posets, defines mutation as a flip preserving the lattice property, introduces locally mutable and mutable lattices via these operations, and proves semidistributivity directly from the necessary-and-sufficient combinatorial condition on flips. Cambrian lattices are shown locally mutable by explicit verification, and Ordovician lattices are defined as iterated mutations. No self-citations, fitted parameters renamed as predictions, ansatzes smuggled via prior work, or reductions of the central claims to their own inputs by construction appear. The load-bearing steps (well-definedness of flip, the nec+suff mutation criterion, and the semidistributivity proof) are presented as combinatorial verifications internal to the new framework, making the derivation independent of external fitted data or self-referential loops.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 2 invented entities

The central claims rest on the newly introduced definitions of flip and mutation together with standard background results from poset and lattice theory; no free parameters are fitted and no new physical entities are postulated.

axioms (1)

standard math Standard axioms and properties of partially ordered sets and lattices (e.g., reflexivity, antisymmetry, transitivity, existence of meets and joins where required).
Invoked throughout the definitions of flip, mutation, and semidistributivity.

invented entities (2)

Flip operation no independent evidence
purpose: New combinatorial operation on arbitrary posets that may or may not preserve lattice structure.
Defined in the paper as the central new construction.
Ordovician lattices no independent evidence
purpose: New class of lattices obtained by iterated mutations starting from Cambrian lattices.
Introduced as a new family with conjectured structural properties.

pith-pipeline@v0.9.0 · 5431 in / 1533 out tokens · 31102 ms · 2026-05-12T04:08:50.256361+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

20 extracted references · 20 canonical work pages

[1]

preprint

Grant Barkley and David Speyer.Affine extended weak order is a lattice. preprint. arXiv:2311.05737, 2025

work page arXiv 2025
[2]

arXiv:2502.07198, 2025

Grant Barkley and Colin Defant.The affine tamari lattice.preprint. arXiv:2502.07198, 2025

work page arXiv 2025
[3]

Emily Barnard, Emily Gunawan, Emily Meehan, and Ralf Schiffler.Cambrian combinatorics on quiver representations (typeA). Adv. in Appl. Math., Vol. 143, pp. Paper No. 102428, 37, 2023

work page 2023
[4]

Arkady Berenstein, Sergey Fomin, and Andrei Zelevinsky.Cluster algebras. III. Upper bounds and double Bruhat cells. Duke Math. J., Vol. 126, No. 1, pp. 1–52, 2005

work page 2005
[5]

Brian Davey and Hilary Priestley.Introduction to Lattices and Order.Cam- bridge University Press, 2 edition, 2002. 312pp

work page 2002
[6]

Laurent Demonet, Osamu Iyama, Nathan Reading, Idun Reiten, and Hugh Thomas.Lattice theory of torsion classes: beyondτ-tilting theory. Trans. Amer. Math. Soc. Ser. B, Vol. 10, pp. 542–612, 2023

work page 2023
[7]

Harm Derksen, Jerzy Weyman, and Andrei Zelevinsky.Quivers with potentials and their representations. I. Mutations. Selecta Math. (N.S.), Vol. 14, No. 1, pp. 59–119, 2008

work page 2008
[8]

Matthew Dyer.On the weak order of Coxeter groups. Canad. J. Math., Vol. 71, No. 2, pp. 299–336, 2019

work page 2019
[9]

Selecta Math

Rei Inoue, Tsukasa Ishibashi and Hironori Oya.Cluster realizations of Weyl groups and higher Teichm¨ uller theory. Selecta Math. (N.S.), Vol. 27, No. 3, Paper No. 37, 84 pp, 2021

work page 2021
[10]

Sergey Fomin and Andrei Zelevinsky.Cluster algebras. I. Foundations. J. Amer. Math. Soc., Vol. 15, No. 2, pp. 497–529, 2002

work page 2002
[11]

Sergey Fomin and Andrei Zelevinsky.Cluster algebras. II. Finite type classifi- cation. Invent. Math., Vol. 154, No. 1, pp. 63–121, 2003

work page 2003
[12]

Sergey Fomin and Andrei Zelevinsky.Cluster algebras. IV. Coefficients. Com- pos. Math., Vol. 143, No. 1, pp. 112–164, 2007

work page 2007
[13]

Cambridge University Press, 1990

James Humphreys.Reflection Groups and Coxeter Groups.Cambridge Studies in Advanced Mathematics. Cambridge University Press, 1990. 220pp

work page 1990
[14]

preprint

Sefi Ladkani.Universal derived equivalences of posets of tilting modules. preprint. arXiv:0708.1287, 2007

work page arXiv 2007
[15]

Nathan Reading.Cambrian lattices. Adv. Math., Vol. 205, No. 2, pp. 313–353, 2006

work page 2006
[16]

Nathan Reading.Lattice theory of the poset of regions.In:Lattice theory: special topics and applications. Vol. 2.Birkh¨auser/Springer, Cham, 2016, pp. 399–487

work page 2016
[17]

Nathan Reading and David Speyer.Cambrian fans.In:J.Eur. Math. Soc. (JEMS), 11.2 (2009), pp. 407–447. FLIP OF LATTICES 51

work page 2009
[18]

Selecta Math

Nathan Reading, David Speyer, and Hugh Thomas.The fundamental theorem of finite semidistributive lattices. Selecta Math. (N.S.), Vol. 27, No. 4, pp. Paper No. 59, 53, 2021

work page 2021
[19]

Nieuw Arch

Dov Tamari.The algebra of bracketings and their enumeration. Nieuw Arch. Wisk. (3), Vol. 10, pp. 131–146, 1962

work page 1962
[20]

Kyoritsu Shuppan Co., Ltd., 2009

Tsurane Iwamura.Sokuron. Kyoritsu Shuppan Co., Ltd., 2009. 162pp. Reprint. Originally published: Tsurane Iwamura, Kyoritsu Shuppan Co., Ltd., 1965

work page 2009