ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let K{\cal K} be a simplicial complex of type {3,4}\{3,4\}, meaning that every (d−2)(d-2)-face is contained in 33 or 44 faces of dimension d−1d-1. Let (P1,…,Pt)(P_1,\ldots,P_t) be the corresponding partition of {1,…,d}\{1,\ldots,d\}, and let lil_i denote zigzag lengths. Type-{3,4}\{3,4\} zigzag conjecture. The complex is not zz-uniform if and only if the part sizes are (d2,d2)(\frac d2,\frac d2) or all even, except for the simplex; in every non-zz-uniform case, gcd⁡(l1,l2)=min⁡(l1,l2)\gcd(l_1,l_2)=\min(l_1,l_2) for any two zigzag lengths. In the two specified extreme partitions, the maximum and minimum lengths are respectively d(d+2)2\frac{d(d+2)}2 and d+2d+2, or 3d3d and 3d2\frac{3d}2. For partition {1},{2,…,d}\{1\},\{2,\ldots,d\}, the complex is BPyr(αd−1)BPyr(\alpha_{d-1}). For partition {1},{2},…,{d−2},{d−1,d}\{1\},\{2\},\ldots,\{d-2\},\{d-1,d\}, it has the stated orbit counts, zigzag length 6d6d, intersection vectors, and parity-dependent orbit sizes from the source. The supplied text gives no resolution.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.