Year: 2026
Type: preprint
Abstract: We introduce split-free cable expressions and their sequential restriction. Live cables are vertex blocks that future operations cannot split. The main result identifies sequential split-free cable width, up to an additive two, with active neighborhood-width, the minimum number of distinct nonzero future-neighborhood classes across a linear layout. The lower bound extracts such a layout from every cable play and includes a parity argument for prefixes inside a birth group. The upper bound compiles any active-neighborhood layout into a singleton-birth play. This gives an exponential upper bound and a linear lower bound in terms of linear rank-width. We prove that the complement of the seven-vertex cycle has linear rank-width two and sequential cable width exactly eight. This disproves the proposed affine upper estimate already at rank two. We also prove an unbounded separation between branching expression width and sequential width on trees.
Source: arXiv (Cornell University)
Author: Kalampakas, Antonios
Institution: American University of the Middle East
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7167613613
Cites:
Cited by:
Related to: