{"id":"e5e5f9c5-9375-42ea-afac-93723de92946","arxiv_id":"1908.03394","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Every finite simplicial complex is stably homotopy equivalent to a permutation complex, two-permutation complexes are wedges of spheres, and the complex of injective words Γ(K) admits an explicit wedge decomposition.","lead":"This paper proves that any finite shape can be built, up to a standard suspension operation, from a permutation complex of ordered words, and that two-permutation complexes are always wedges of spheres. It also gives an explicit formula for the topology of the complex of injective words associated to any connected simplicial complex.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified: Eq. (12) is valid; for proper I the poset Q(η_i : i∈I) is a total order, so its order complex is contractible.","rationale":"The paper's headline claim, Theorem 2.5 / Theorem 1.5, is the stable realization of arbitrary finite simplicial complexes by permutation complexes. The proof rests on Lemma 2.3 and on the claim in Eq. (12) that for every nonempty proper I the order complex of Q(η_i:i∈I) is contractible. The reader identified Eq. (12) as the weakest assumption. An independent check shows the claim is actually stronger than stated: for proper I, Q(η_i:i∈I) is the ordinal sum of the d transposition pairs, each pair being a two-element chain, so the entire poset is a total order and its order complex is a simplex. Thus all proper intersections in the family {X(σ_i)} are contractible, exactly as Lemma 2.3 requires, and the induction producing X(σ_1,…,σ_d)≃Σ^{2d−1}Y is sound. I also checked the full intersection: for I=[d], each pair becomes an antichain while cross-pair comparabilities remain, giving the join of d two-point sets, i.e. S^{d−1}, so the total intersection is Y*S^{d−1}=Σ^dY. No flaw in the central argument emerged. Two minor convention issues remain: the treatment of the empty complex in Theorem 2.5, and the wedge index in Theorem 1.8 where σ=∅ requires D(0)=1 and lk(K,∅)=K. These are clarifications rather than correctness risks. The reader's conditional verdict is therefore not overturned; the requested confirmation of Eq. (12) can be answered affirmatively, and the remaining wedge-index convention is a minor revision.","tokens_in":12258,"tokens_out":31571,"duration_ms":329878,"concrete_test":"As a check, implement a small script that, for d=6 and every nonempty proper I⊂[d], constructs the relation matrix of Q(η_i:i∈I) from the transpositions η_i and verifies that the transitive closure is a total order (every pair comparable and antisymmetric). The script should also verify for I=[d] that each pair {2i−1,2i} is an antichain and all cross-pair comparisons are positive, recovering S^{d−1}. This directly settles whether Eq. (12) fails for any proper subset.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The reader's flagged concern, Eq. (12), is the pivotal point but it holds. Fix nonempty proper I⊂[d] and j∉I. For every active transposition η_i with i∈I, the pair {2i−1,2i} lies wholly before or wholly after the fixed elements 2j−1 and 2j, and the absent transposition η_j fixes both. Hence for any x in pair i and y in pair j with i<j, every coordinate defining the poset Q(η_i:i∈I) puts x before y; within each pair the two elements form a two-element chain (reversed if the pair is active, natural if inactive). Therefore Q(η_i:i∈I) is the ordinal sum of d two-element chains, i.e. a total order, and its order complex is a simplex. Contractibility of every proper intersection in Lemma 2.3 follows, and the induction in Theorem 2.5 goes through. The only residual caveats are conventions: the empty simplicial complex is not explicitly handled in Theorem 2.5, and the wedge index in Theorem 1.8 needs the conventions D(0)=1 and lk(K,∅)=K; neither affects the central stable-realization claim for nonempty Y.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies complexes of injective words, focusing on permutation complexes, which are order complexes of subposets of injective words generated by one or more permutations. The main results are: (1) Theorem 1.5/2.5, stating that every finite simplicial complex, after a sufficiently high suspension, is homotopy equivalent to a permutation complex; (2) Theorem 1.6/3.4, classifying complexes generated by two permutations as wedges of spheres and showing that every finite wedge of spheres can be so realized; (3) Theorem 1.8, an explicit homotopy decomposition of the complex of injective words Γ(K) associated to a simplicial complex K, with an application to a connectivity result of Randal-Williams and Wahl; and (4) probabilistic results for random permutation complexes, including an asymptotic estimate for the expected reduced Euler characteristic and a bound for the expected homological dimension. The proofs use standard tools: order complexes, the Björner-Wachs-Welker poset fiber theorem, Dushnik-Miller order dimension, the nerve lemma, and an induction on permutation pairs.","tokens_in":12523,"tokens_out":51527,"duration_ms":520902,"significance":"If the results are correct, the stable realization theorem is a striking flexibility result: a very restricted class of complexes of injective words is shown to realize all stable homotopy types, with an explicit suspension bound in terms of the order dimension of the face poset. The two-permutation classification is clean and complete, and the Γ(K) decomposition is elegant and gives a short proof of a previously known connectivity statement. The paper is well organized, gives detailed proofs, and properly credits the external results on which it builds. The probabilistic sections are secondary but provide useful quantitative information about random permutation complexes.","major_comments":[{"comment":"The proof of Theorem 2.5 fails when d=1, which occurs in particular when Y is a single point. The equality Δ(Q(η_1,...,η_d)) ≃ S^{d-1} in Eq. (13) is false for d=1: the poset Q(η_1) is a two-element chain, whose order complex is an edge and hence contractible, not a 0-sphere. Consequently the construction in the proof gives X(σ_1) contractible, not Σ^{1}Y ≃ S^1 as claimed, so Theorem 2.5 is false as stated for Y a point. The empty complex is also not covered, since d=0 makes Σ^{2d-1}Y undefined. This is load-bearing because Theorem 2.5 is the detailed form of the headline Theorem 1.5, which is stated for every finite simplicial complex. I recommend restricting Theorem 2.5 to nonempty Y with at least two nonempty faces, or handling Y a point separately (for instance via the two-permutation realization of S^1 from Theorem 3.4(b)), and explicitly excluding the empty complex; the stable realizability claim for all nonempty complexes remains intact after such a patch.","section":"§2, Theorem 2.5 and Eq. (13)"}],"minor_comments":[{"comment":"The word \"premutations\" in the statement of Theorem 1.5 is a typo and should read \"permutations\".","section":"§1, Theorem 1.5"},{"comment":"The sentence \"Therefore Δ(f^{-1}(P(K)_{<σ})) is (|σ|-2)-connected\" should refer to Δ(f^{-1}(P(K)_{≤σ})) instead of the strict lower fiber. The lower fiber need not be (|σ|-2)-connected: for a 2-simplex σ it is the disjoint union of two vertices. What is needed for the Björner-Wachs-Welker theorem is the connectivity of the ≤-fiber, and that is what was established in the previous sentence.","section":"§4, proof of Theorem 1.8"},{"comment":"In the displayed decomposition following Eq. (26), the index \"∅≠σ∈X\" contains a typo: it should be \"∅≠σ∈K\".","section":"§4, Eq. (26)"},{"comment":"The wedge in formula (2) is over all σ∈K including the empty simplex, which requires conventions D(0)=1, lk(K,∅)=K, and Σ^0K=K. These conventions are not stated explicitly; the proof separately derives K ∨ (wedge over nonempty σ). Adding a sentence clarifying these conventions would prevent confusion.","section":"§1, Theorem 1.8 and §4, Corollary 4.2"},{"comment":"The k=0 term in formula (3) involves (-1)^{-1}, which is formally acceptable but unconventional. For readability, consider writing the sum from k=1 and adding the k=0 contribution -1 explicitly.","section":"§5, Eq. (3)"}],"recommendation":"major_revision","confidential_remarks":"The paper's main ideas are sound and the central realization theorem is likely correct after a small repair to the d=1 edge case. However, Theorem 2.5 is currently false as stated for Y a point, and since this theorem is the detailed version of the paper's headline result, the manuscript needs revision before it can be accepted."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dear Colleague,\n\nRead the Chacholski–Levi–Meshulam paper. The thing to know: the stable realization theorem (every finite complex shows up as a suspension of a permutation complex) and the two-permutation wedge classification are genuinely new, and the Γ(K) decomposition is a useful general formula. The point the reader flagged as load-bearing, Eq. (12), actually holds — for a proper family of transpositions the poset is a total order, so contractible. The paper is sound; the only real fixes are conventions.\n\nThe proofs are mostly standard poset-topology ingredients, but the packaging and results are worth it. Theorem 2.5 gives an explicit construction using order dimension and transposition blocks; the induction in Lemma 2.3 is clean. Theorem 3.4 reduces pairs of permutations to intersection triples and alternating sequences, and shows exactly which wedges of spheres occur. That's a satisfying answer. As a bonus, Theorem 1.8 gives a short proof of the Randal-Williams–Wahl connectivity bound, which suggests the decomposition is the right way to see that result.\n\nSoft spots, in order of real softness. First, the wedge in Theorem 1.8 must include the empty face with D(0)=1 and lk(K,∅)=K; without that convention the K summand that the proof actually produces is missing from the statement. Second, Theorem 2.5 states 'any finite simplicial complex Y' but the proof only covers the nonempty case (P(Y) ≠ ∅); the empty case is trivial but should be said. Neither affects the substantive claims. The flagged Eq. (12) is not a gap, though it is the place to check if the construction is going to break.\n\nCitations are appropriate. [12] is Levi's own neuroscience paper used only as motivation; the core results are cited to Farmer, Björner–Wachs, Björner–Wachs–Welker, Brown, and Szegő. No citation-pattern problem.\n\nThis paper is for combinatorial topologists and people working with order complexes of injective words. It deserves serious peer review. I would accept it with minor revision: state the empty-face convention in Theorem 1.8, and add a line on the empty complex in Theorem 2.5.","headline":"New stable realizability and two-permutation classification, with a useful decomposition formula; the one load-bearing lemma that looks fragile actually checks out, and the only fixes are conventions.","tokens_in":13061,"tokens_out":5258,"would_cite":true,"duration_ms":49617,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["55P15","05E45","55U10"],"pacs":[],"model":"deepseek-v4-flash","headline":"Every stable homotopy type is a permutation complex","keywords":["injective words","permutation complexes","stable homotopy types","order complexes","order dimension","suspension","derangements","random permutations"],"falsifier":"A direct check of that fact would settle the construction: compute the order complex of $Q(\\eta_i:i\\in I)$ for a fixed $d\\ge 4$ and every nonempty proper subset $I$ of the transposition pairs; any non-contractible outcome would invalidate the proof of Theorem 2.5.","tokens_in":12055,"feed_emoji":"🔀","tokens_out":14741,"duration_ms":160553,"temperature":0.7,"pith_summary":"This paper proves that stable homotopy types are not exotic: for every finite simplicial complex $Y$, there are positive $r,n,m$ and permutations $\\sigma_1,\\dots,\\sigma_m$ of $n$ symbols such that the iterated suspension $\\Sigma^r Y$ is homotopy equivalent to a permutation complex—a space built purely from ordered words of distinct symbols. The construction is explicit and uses the order dimension of the face poset of $Y$ to choose the permutations; the resulting complex is exactly $\\Sigma^{2d-1}Y$ for $d$ equal to that dimension. If the result is right, every stable shape that appears in algebraic topology can be encoded by a finite collection of permutations, giving an unexpected combinatorial universality. The paper also classifies the two-permutation case (wedges of spheres), decomposes the complex of injective words of a connected complex into suspensions of its links, and derives asymptotics for random permutation complexes.","feed_headline":"Every stable homotopy type is a permutation complex","feed_subtitle":"Suspended enough times, any finite complex is encoded purely by permutations—no extra geometric data needed.","key_machinery":"The load-bearing object is the intersection poset $Q(\\sigma_1,\\dots,\\sigma_m)$: its order complex is exactly the intersection of the individual complexes $X(\\sigma_i)$. The corresponding identity for unions is Lemma 2.3: if $d$ complexes have all proper intersections contractible, their union is homotopy equivalent to the $(d-1)$-fold suspension of the total intersection. The construction's hinge is a combinatorial fact about the transpositions $\\eta_k$ that swap $2k-1$ and $2k$: any proper subfamily of the posets $Q(\\eta_i:i\\in I)$ has contractible order complex, while the full family is a sphere $S^{d-1}$. Concatenating these transpositions with linear orders that encode the face poset of $Y$ forces every proper intersection to be contractible and the total intersection to be $\\Sigma^dY$, so Lemma 2.3 delivers the desired suspension.","core_discovery":"On the paper's own terms, the central discovery is Theorem 2.5: if $Y$ is a finite simplicial complex whose face poset has $n$ elements and order dimension $d$, then there are permutations $\\sigma_1,\\dots,\\sigma_d$ of $n+2d$ symbols with $X(\\sigma_1,\\dots,\\sigma_d)\\simeq \\Sigma^{2d-1}Y$. In other words, every finite complex becomes, after enough suspensions, a permutation complex. The proof constructs each $\\sigma_k$ by concatenating a linear order that encodes the face poset with a transposition of a fresh pair of symbols; proper intersections of the individual complexes are contractible, the total intersection is homotopy equivalent to $\\Sigma^d Y$, and Lemma 2.3 converts the union into the iterated suspension. A second main result decomposes $\\Gamma(K)$, the complex of injective words on a connected complex $K$, as a wedge of suspensions of links: $\\Gamma(K)\\simeq \\bigvee_{\\sigma\\in K}\\bigvee_{D(|\\sigma|)}\\Sigma^{|\\sigma|}\\operatorname{lk}(K,\\sigma)$, where $D(|\\sigma|)$ is the number of derangements of a set of size $|\\sigma|$ and a wedge means gluing the pieces at one common point.","pith_inferences":["Because the construction encodes the face poset by linear orders, the minimal suspension needed for a given complex is plausibly controlled by the order dimension of its face poset; one could test whether the $2d-1$ bound can be lowered for specific families such as spheres or projective planes.","The same encoding by permutations may extend beyond simplicial complexes: any finite regular CW complex has a face poset, and the construction suggests its stable homotopy type is also realizable by a permutation complex.","The 15-permutation example in $S_4$ realizing $\\Sigma\\mathbb{RP}^2$ that the authors mention suggests the general suspension bound is far from optimal; one might conjecture that every finite complex $Y$ admits a stable realization with suspension bounded linearly in the dimension of $Y$, rather than in the size of its face poset.","The near-zero expected Euler characteristic for two random permutations is a statistical hint, not a proof, that odd and even dimensional spheres balance in large random permutation complexes; direct simulation of $X_{2,n}$ for moderate $n$ could test whether the balance holds for homology rather than only for Euler characteristic."],"forward_implications":["Every finite stable homotopy type has a finite, purely combinatorial representative: a finite list of permutations, with no geometric data beyond the ordering of symbols.","The suspension degree needed for a complex $Y$ is at most $2\\dim(P(Y))-1$, so complexes whose face posets have small order dimension are realized by small permutation complexes.","For two permutations, every permutation complex is either contractible or a wedge of spheres of dimension at least $1$, and every finite wedge of spheres $S^{k_1}\\vee\\dots\\vee S^{k_m}$ occurs.","For a connected complex $K$, the homology of $\\Gamma(K)$ is the sum, over faces $\\sigma$, of the homology of the link $\\operatorname{lk}(K,\\sigma)$ shifted by $|\\sigma|$, with multiplicity the derangement number $D(|\\sigma|)$.","For random two-permutation complexes, the expected reduced Euler characteristic has absolute value $O(n^{-1/4})$, matching the intuition that odd and even spheres appear in nearly equal numbers."],"supporting_citations":[{"why":"Supplies the pair-of-spaces suspension fact used as the induction base for Lemma 2.3, the identity that turns the union into an iterated suspension.","marker":"[2]"},{"why":"Proves that $\\Delta(\\mathrm{Inj}([n]))$ is a wedge of $D(n)$ spheres of dimension $n-1$, the fiber model behind the $\\Gamma(K)$ decomposition.","marker":"[3]"},{"why":"Provides the poset fiber theorem that produces the wedge decomposition of $\\Gamma(K)$ into suspensions of links.","marker":"[4]"},{"why":"Introduces order dimension and the bound $\\dim(P)\\le |P|$, guaranteeing the permutations that encode the face poset of $Y$ in Theorem 2.5.","marker":"[5]"}],"fun_headline_variants":["Permutation complexes realize every stable homotopy type","Stable homotopy types arise from permutation complexes","All finite complexes are stably permutation complexes","Every finite complex suspends to a permutation complex"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The construction rests on one combinatorial contractibility fact about the transposition posets: for every nonempty proper subset $I$ of the chosen transpositions, the order complex of $Q(\\eta_i:i\\in I)$ is contractible, and if that fact failed the union would not collapse to the required iterated suspension.","fun_headline_variants_meta":{"raw":{"variants":["Permutation complexes realize every stable homotopy type","Stable homotopy types arise from permutation complexes","All finite complexes are stably permutation complexes","Every finite complex suspends to a permutation complex"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001886,"raw_usage":{"total_tokens":7447,"prompt_tokens":1049,"completion_tokens":6398,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":665,"completion_tokens_details":{"reasoning_tokens":6350}},"tokens_in":665,"tokens_out":6398,"duration_ms":51819,"temperature":1.0,"reasoning_tokens":6350,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T14:18:16.237314+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"A direct check of that fact would settle the construction: compute the order complex of $Q(\\eta_i:i\\in I)$ for a fixed $d\\ge 4$ and every nonempty proper subset $I$ of the transposition pairs; any non-contractible outcome would invalidate the proof of Theorem 2.5.","supporting_citations":[{"cited_title":"Brown, Topology and groupoids, BookSurge, LLC, Charleston, SC, 2006","cited_arxiv_id":null,"evidence_quote":"Supplies the pair-of-spaces suspension fact used as the induction base for Lemma 2.3, the identity that turns the union into an iterated suspension."},{"cited_title":"Bj¨ orner and M","cited_arxiv_id":null,"evidence_quote":"Proves that $\\Delta(\\mathrm{Inj}([n]))$ is a wedge of $D(n)$ spheres of dimension $n-1$, the fiber model behind the $\\Gamma(K)$ decomposition."},{"cited_title":"Bj¨ orner, M","cited_arxiv_id":null,"evidence_quote":"Provides the poset fiber theorem that produces the wedge decomposition of $\\Gamma(K)$ into suspensions of links."},{"cited_title":"Dushnik and E","cited_arxiv_id":null,"evidence_quote":"Introduces order dimension and the bound $\\dim(P)\\le |P|$, guaranteeing the permutations that encode the face poset of $Y$ in Theorem 2.5."}],"review_version":1}