ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, and let nn denote the relevant maximum tangle order. A canonical sequence of tree-decompositions is a sequence (Ti,Vi)(T_i,\mathcal{V}_i) for 1≤i≤n1\leq i\leq n, where each (Ti,Vi)(T_i,\mathcal{V}_i) is a tree-decomposition of GG, and where refinement and torsos are understood in the usual sense. A part is inessential at stage ii if it does not contain an (i+1)(i+1)-tangle.

Canonical sequence conjecture. For every graph GG there exists a canonical sequence of tree-decompositions (Ti,Vi)(T_i,\mathcal{V}_i) for 1≤i≤n1 \leq i \leq n of GG such that:

  • (Ti,Vi)(T_i,\mathcal{V}_i) distinguishes every ii-tangle in GG for each ii;
  • (Tn,Vn)(T_n,\mathcal{V}_n) distinguishes the set of maximal tangles in GG;
  • (Ti+1,Vi+1)(T_{i+1},\mathcal{V}_{i+1}) refines (Ti,Vi)(T_i,\mathcal{V}_i) for each ii;
  • the torso of every inessential part in (Ti,Vi)(T_i,\mathcal{V}_i) has branch-width <i<i.

This is presented as the strongest form of a positive answer to the preceding question about bounding the branch-width of inessential parts. The preceding theorem establishes the existence of a canonical nested set distinguishing all tangles, but the claimed simultaneous sequence, refinement property, and branch-width bound remain conjectural.

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.