REVIEW 2 major objections 5 minor 11 references
A hidden Condorcet domain in Loday's realisation of the associahedron
T0 review · 2 major / 5 minor · reviewed 2026-08-10 · deepseek-v4-flash
Pith's one-line read The common vertices of the permutohedron and Loday's associahedron are exactly the $2^{n-1}$ permutations of the maximal never-middle Condorcet domain.
desk verdict A correctable overstatement hides a genuinely new polytopal realization of a known Condorcet domain. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The machinery is Loday's coordinate assignment $M_n$ for full binary trees. To each internal vertex of a tree with leaves $0,1,\dots,n$, the vertex between leaves $i-1$ and $i$ carries the weight $a_i b_i$, where $a_i$ and $b_i$ are the numbers of leaf descendants of its left and right children; the point $M_n(t)$ has these weights as coordinates. The associahedron is the convex hull of these $M_n(t)$ points. The proof's load-bearing inequality is the root-weight bound $(i+1)(n-i)\le n$, which is forced by membership in the permutohedron; it leaves only $i=0$ or $i=n-1$, reducing any common vertex to a common vertex of $\mathrm{Perm}_{n-1}$ and $\mathrm{Asso}_{n-1}$ and matching the recursive star construction.
What would settle it
For some $n\ge 5$, compute the Loday coordinates of all $2^{n-1}$ permutations obtained by iterating the star operation; if any resulting coordinate vector is not a vertex of $\mathrm{Perm}_n$ (i.e., not a permutation of $1,\dots,n$), the equality fails. Equivalently, search the common vertices of $\mathrm{Asso}_n$ and $\mathrm{Perm}_n$ for a permutation containing the pattern 132 or 231.
Extended reading notes
Core claim
The paper's central claim is that $\mathrm{Perm}_n\cap\mathrm{Asso}_n = ((1\star 2)\star 3)\cdots\star n$, where $\star$ is the doubled-concatenation operation $D_1\star D_2=\{u_1u_2,u_2u_1: u_i\in D_i\}$. The set on the right has size $2^{n-1}$, is maximal among Condorcet domains, and satisfies the never-middle condition. In pattern terms, these are exactly the permutations that avoid 132 and 231. The proof works by induction: a tree vertex of Loday's associahedron has root weight $(i+1)(n-i)$, and membership in the permutohedron forces this weight to be at most $n$, which forces $i=0$ or $i=n-1$, so the largest alternative sits at one of the two ends and the remaining coordinates form a common vertex in dimension $n-1$.
Load-bearing premise
The induction step assumes without proof that if a point of $\mathrm{Perm}_n$ has a coordinate equal to $n$, then deleting that coordinate leaves a point of $\mathrm{Perm}_{n-1}$ on the remaining coordinates; this facet property of the permutohedron is standard but load-bearing.
Editorial extensions
If this is right
- For each $n$, exactly $2^{n-1}$ of the vertices of Loday's associahedron are also vertices of the permutohedron, and they are precisely the permutations that avoid 132 and 231.
- The maximal never-middle Condorcet domain therefore has a geometric realisation: it appears as the common vertex set of two classical polytopes, so voting-theoretic questions about the domain can be studied through polytope combinatorics.
- Membership in the domain has a simple recursive test: generate the $2^{n-1}$ rankings by repeatedly placing the next largest alternative at either the left or the right end, or check pattern avoidance.
- Because the domain is maximal, no additional ranking can be added to this common-vertex set without creating a cycle in pairwise majority voting.
- The induction identifies the common vertices recursively: in any shared vertex, the largest alternative sits in first or last position, and removing it leaves another shared vertex in one dimension lower.
Reading between the lines
- Beyond the paper, the proof's root-weight bound suggests the same intersection pattern may persist for other Loday-type realisations built from product coordinates, since the bound depends only on the shape of the root subtree rather than on the internal tree structure.
- Beyond the paper, the common-vertex count $2^{n-1}$ makes explicit a binary-choice encoding of the domain: each new largest alternative is placed left or right, yielding a natural bijection between the domain and all subsets of $\{2,\dots,n\}$, which the paper does not spell out.
- Beyond the paper, the recursive structure raises the question, not addressed here, of whether the $2^{n-1}$ common vertices form the vertex set of a common subpolytope of $\mathrm{Perm}_n$ and $\mathrm{Asso}_n$, and if so, which polytope that is.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies Loday's polytopal realization of the associahedron Asso_n and its intersection with the permutohedron Perm_n. It states (Theorem 2) that Perm_n ∩ Asso_n equals the iterated ⋆-composition domain ((...(1⋆2)⋆3)...⋆n), a maximal never-middle Condorcet domain of size 2^{n-1}, equivalently the set of permutations avoiding the patterns 132 and 231. The proof is an induction on the root weight of the binary tree corresponding to a vertex of Asso_n.
Significance. The proposed connection between Loday's coordinates, pattern avoidance, and maximal Condorcet domains is attractive and potentially useful. The inductive argument is elementary and, once the statement is corrected to concern common vertices rather than the full polytope intersection, it gives a clean proof of a genuine combinatorial fact. The paper also explicitly identifies the domain as the known maximal never-middle domain, relying on the cited Karpov–Slinko result rather than reproving maximality, which is appropriate for a short note. However, the main theorem as stated is mathematically false, so the contribution needs a substantive correction before it can be accepted.
major comments (2)
- [Theorem 2, §4] The statement 'Perm_n ∩ Asso_n = (...((1⋆2)⋆3)...⋆n)' is false as written. Since Perm_n and Asso_n are convex polytopes, their intersection is convex and hence infinite for n ≥ 3. For example, when n = 3, the points (1,2,3) and (2,1,3) are common vertices lying in D, so their midpoint (1.5,1.5,3) belongs to Perm_3 ∩ Asso_3 by convexity, but it is not a permutation and is not in D. The proof in §4 only establishes that the common vertex sets coincide, i.e. that the set of vertices of Asso_n that lie in Perm_n equals D (and conversely). The theorem and the abstract should be restated accordingly, for example as 'the set of common vertices of Perm_n and Asso_n equals D'.
- [Proof of Theorem 2, §4] The induction step implicitly uses the facet property of the permutohedron: if a point of Perm_n has a coordinate equal to n, then deleting that coordinate leaves a point of Perm_{n-1} on the remaining coordinates. This property is standard, but it is load-bearing: without it, the condition M_n(t) ∈ Perm_n does not by itself place the reduced coordinate vector into Perm_{n-1}. The same reduction for Asso_n follows directly from Loday's coordinate definition, but the permutohedron side should be stated and justified explicitly. This is not the same as the theorem's claim, so it does not create circularity, but it must be made visible in the proof.
minor comments (5)
- [§2] The text says that S_n is in a bijection with full binary trees with levels, but then defines a surjective map ψ : S_n → Y_n; the terminology should be adjusted to distinguish the level-labeled trees from the unlabeled ones in Y_n.
- [§4, displayed trees] The notation t−n is used before it is clearly defined; writing t_-n and explicitly stating t_-n ∈ Y_{n-1} would improve readability.
- [§4, proof] The expression 'Mt−1(t−n)' should be 'M_{n-1}(t_-n)' to avoid confusion between the index and the argument.
- [Note 1] The sentence 'Perm_n ∩ Asso_n consists of all permutations of S_n that avoid patterns 132 and 231' inherits the false equality from Theorem 2; after the theorem is corrected to 'common vertices', this note should be updated to match.
- [Example 1] The sentence 'For the tree t on Figure 1 we have M_3(t) = (1,4,1)' refers to a specific tree, but Figure 1 is not described precisely enough to identify which tree is meant; a small clarifying phrase would help.
Circularity Check
No circularity: the main derivation is self-contained and the only self-citation is used for labeling, not as an input.
full rationale
The proof of Theorem 2 begins from Loday's coordinate definition M_n(t) = (a_1 b_1, ..., a_n b_n) and the elementary fact that every coordinate of a point of the permutohedron Perm_n lies between 1 and n. It then solves (i+1)(n-i) <= n to force the root of the tree to be at an end, and applies the induction hypothesis to the remaining tree. This is a direct geometric-combinatorial derivation; the claimed equality with ((...(1⋆2)⋆3)...⋆n) is obtained from the ⋆ construction rather than assumed. The cited Karpov-Slinko result is used only after this equality is established, to attach the labels 'maximal never-middle Condorcet domain' and cardinality 2^{n-1}; although it is a self-citation (shared authorship), it is an independent published theorem and is not load-bearing for the geometric equality. Two non-circular caveats: (i) the stated theorem Perm_n ∩ Asso_n = D overclaims, because both polytopes are convex and their intersection is generally convex and infinite, while the proof establishes only the common vertices; (ii) the induction silently uses the standard facet property that deleting a coordinate equal to n from a point of Perm_n leaves a point of Perm_{n-1}. Neither caveat makes the derivation circular.
Assumptions & free parameters
assumptions (3)
- domain assumption Loday's coordinate map M_n is a polytopal realization of the Tamari lattice (associahedron).
- standard math A point in the permutohedron Perm_n has every coordinate between 1 and n, and the face where one coordinate equals n is the (n-1)-dimensional permutohedron on the remaining coordinates.
- domain assumption The domain ((...(1⋆2)⋆3)...⋆n) is a maximal never-middle Condorcet domain of size 2^{n-1} (equivalently, permutations avoiding 132 and 231).
Cite this review
Pith. "Pith review of A hidden Condorcet domain in Loday's realisation of the associahedron." pith.science (2026). https://pith.science/paper/UCW6NHOV
@misc{pith2026250113374,
author = {Pith},
title = {Pith review of: A hidden Condorcet domain in Loday's realisation of the associahedron},
year = {2026},
howpublished = {\url{https://pith.science/paper/UCW6NHOV}},
note = {Machine review of arXiv:2501.13374}
}
read the original abstract
We prove that Loday's polytopal realisation of the nth Tamari lattice T_n, called associahedron, has 2^{n-1} common points with the permutohedron, which form a maximal never-middle (symmetric) Condorcet domain.
Figures
Reference graph
Works this paper leans on
-
[1]
V.I. Danilov and G.A. Koshevoy. Maximal C ondorcet domains. Order, 30 0 (1): 0 181--194, 2013
work page 2013
-
[2]
V.I. Danilov, A.V. Karzanov, and G.A. Koshevoy. Condorcet domains of tiling type. Discrete Applied Mathematics, 160 0 (7-8): 0 933--940, 2012
work page 2012
-
[3]
A. Galambos and V. Reiner. Acyclic sets of linear orders via the B ruhat orders. Social Choice and Welfare, 30 0 (2): 0 245--264, 2008
work page 2008
-
[4]
Symmetric maximal condorcet domains
Alexander Karpov and Arkadii Slinko. Symmetric maximal condorcet domains. Order, 40 0 (2): 0 289--309, 2023
work page 2023
-
[5]
Cambrian acyclic domains: counting c-singletons
Jean-Philippe Labb \'e and Carsten EMC Lange. Cambrian acyclic domains: counting c-singletons. Order, 37 0 (3): 0 571--603, 2020
work page 2020
-
[6]
Realization of the S tasheff polytope
Jean-Louis Loday. Realization of the S tasheff polytope. Arch. Math., 83: 0 267--278, 2004
work page 2004
-
[7]
Clemens Puppe and Arkadii Slinko. Maximal condorcet domains. a further progress report. Games and Economic Behavior, 145: 0 426--450, 2024
work page 2024
-
[8]
A combinatorial representation of arrow's single-peaked domains
Arkadii Slinko. A combinatorial representation of arrow's single-peaked domains. arXiv preprint arXiv:2412.05406, 2024
arXiv 2024
Show all 11 references
-
[9]
Homotopy associativity of H -spaces
James Dillon Stasheff. Homotopy associativity of H -spaces. I , II . Transactions of the American Mathematical Society, 108 0 (2): 0 293--312, 1963
1963
-
[10]
The algebra of bracketings and their enumeration
Dov Tamari. The algebra of bracketings and their enumeration. Nieuw Arch. Wisk, 3 0 (10): 0 131--146, 1962
1962
-
[11]
Lectures on polytopes, volume 152
G \"u nter M Ziegler. Lectures on polytopes, volume 152. Springer Science & Business Media, 2012
2012
Reviewed August 10, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.