ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Σ\Sigma be a two-letter alphabet, let w,v∈Σ+w,v\in\Sigma^+ with w≠vw\neq v, and let n≥2n\geq 2. Write w↔vw\leftrightarrow v when ww and vv differ by one adjacent swap, and let ∼n\sim_n denote equivalence in UTn(T)\mathcal{UT}_n(\mathbb{T}). Adjacent-swap connectivity conjecture.

w∼nvw\sim_n v

if and only if there exists a positive integer kk and words u(0),…,u(k)u(0),\ldots,u(k) such that

w=u(0)↔u(1)↔⋯↔u(k)=vw=u(0)\leftrightarrow u(1)\leftrightarrow\cdots\leftrightarrow u(k)=v

and

u(0)∼nu(1)∼n⋯∼nu(k).u(0)\sim_n u(1)\sim_n\cdots\sim_n u(k).

The conjecture is asserted only for binary alphabets; the paper notes that it fails for alphabets of size greater than two, while it holds trivially for the previously known identities arising from a single adjacent swap.

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.