ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (c1,…,cl)(c_1,\dots,c_l) be a sequence of cluster sizes of a bounded confidence (BC) process. A subsequence is connected when its corresponding clusters are connected in the final configuration. Forbidden-subsequence conjecture. There cannot be a connected subsequence (1,1,1,1)(1,1,1,1) or (2,2,1,1,1,2,2)(2,2,1,1,1,2,2). This would constrain the possible cluster-size patterns and may help establish upper bounds on the number of connected components. The claim is presented as a conjecture, and no resolution is given in the source.

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.