Split-Free Cable Expressions: Active Neighborhood Profiles and Linear Rank-Width

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.

Microwave Linear Analog Computer (MiLAC) for Simultaneous Active and Passive Beamforming
Matteo Nerini, Bruno Clerckx
arXiv22 Sep 2026PreprintCC BY 4.0Full textGeneral mathematicsarXiv
The kernel-block rank profiles of the ℤ₂ℤ₄-linear and the ℤ_2^s-linear Hadamard codes, and a complete classification of the ℤ₂ℤ₄ℤ₈-linear Hadamard codes
Dipak K. Bhunia
arXiv2 Oct 2026PreprintarXiv licenceFull textGeneral mathematicsarXiv
Degree profiles of uniform polynomial consequences: Linear lower bounds for Nullstellensatz and Polynomial Calculus
Søren Riis
arXiv5 Nov 2026PreprintCC BY 4.0Full textLogic & foundationsarXiv
On the Optimal Linear Minimization Oracle Complexity of Active-Hull Methods for Minimizing Convex Hölder Smooth Functions
Renbo Zhao
arXiv1 Oct 2026PreprintarXiv licenceFull textOptimisation & controlarXiv
Differential-linear profiles over finite fields of arbitrary characteristic
Kirpa Garg, Constanza Riera, Pantelimon Stănică
arXiv14 Sep 2026PreprintarXiv licenceFull textGeneral mathematicsarXiv

Cite

BibTeX RIS

BibTeX

@misc{kalampakas2026splitfree,
  title = {{Split-Free Cable Expressions: Active Neighborhood Profiles and Linear Rank-Width}},
  author = {Antonios Kalampakas},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2607.04141},
  eprint = {2607.04141},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2607.04141},
}

RIS

TY  - UNPB
TI  - Split-Free Cable Expressions: Active Neighborhood Profiles and Linear Rank-Width
AU  - Antonios Kalampakas
PY  - 2026
DA  - 2026/09/05
PB  - arXiv
DO  - 10.48550/arxiv.2607.04141
UR  - https://arxiv.org/abs/2607.04141
AB  - 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.
ER  -

Abstract

Related

Cite