---
title: 'Separated-Ordering: A Decompositional Approach'
url: https://www.emergentmind.com/topics/separated-ordering
type: topic
---

# Separated-Ordering: A Decompositional Approach

Separated-ordering is not a single standardized term across research areas. In the cited literature it appears most explicitly as a data-transmission method in NoC-based DNN accelerators, where weights and inputs are ordered according to their own `'1'`-bit counts, respectively [2509.00500]. In other contexts the phrase is used more descriptively for situations in which ordering is experimentally, combinatorially, or categorically split into distinguishable components: rare-earth and transition-metal magnetic sublattices in multiferroics [1304.1355], pairs of constrained linearizations of partial orders [2110.02809], or kernel-versus-quotient order in split extensions of preordered groups [2212.07064]. A plausible synthesis is that separated-ordering denotes frameworks in which order is not treated as a single undifferentiated object, but as a structure with components that can be isolated, compared, or optimized separately.

## 1. Terminological scope and recurrent structure

One recurrent feature of the literature is that several papers explicitly do **not** define a formal problem named “Separated-Ordering,” yet supply a closely related formalism. In partial-order alignment, the task is to choose linear extensions of two partial orders on the same ground set so that the resulting total orders maximize common adjacencies or minimize breakpoints [2110.02809]. In forbidden-pattern graph ordering, the closest explicit analogue is the bipartite side-respecting problem \(BIORD(F)\), where the two sides of a fixed bipartition are ordered separately subject to forbidden ordered patterns [1408.1461]. In split extensions of preordered groups, the lexicographic order separates the order on the quotient from the order on the kernel and becomes the central existence criterion for compatible orders [2212.07064].

A second recurrent feature is that separation may be physical, algorithmic, or logical. In condensed-matter systems it can refer to different magnetic or structural order parameters with different temperature dependences and different experimental signatures [1304.1355]. In permutation-pattern and forbidden-ordering theory it can refer to ordinal sums, disjoint sums, or forbidden local interleavings of ordered substructures [2510.18761]. In optimization and learning it can refer to ordering information acting as a signal distinct from content, as in the decomposition of training dynamics into content and ordering terms [2603.25047].

This breadth makes the term context-sensitive. In some fields it denotes a named procedure; in others it is best understood as an interpretive label for a decomposition of ordering constraints or order parameters. The common denominator is the explicit treatment of order as something that can be factored into separately meaningful components.

## 2. Separated ordering in condensed-matter systems

In multiferroic HoFe\(_3\)(BO\(_3\))\(_4\), separated-ordering denotes experimentally distinguishable ordering of the Ho and Fe magnetic sublattices [1304.1355]. Resonant X-ray scattering at the Ho \(L_3\) edge isolates the Ho contribution and shows a screw-type order: Ho moments form a basal-plane spiral around the \(c\) axis, propagating with a 60\(^\circ\) rotation from one crystallographic plane to the next along \(c\). High-energy non-resonant X-ray magnetic scattering at \((0\,0\,1.5)\) tracks the basal-plane component dominated by Fe and reveals a distinct Fe spin rotation within the \(ab\) plane near \(22.5\) K. The temperature sequence is \(T_N \approx 38\)–39 K for long-range magnetic order, onset of spontaneous polarization around \(22.5\)–23 K, and a final spin-reorientation transition at \(T_{SR}\approx 4.5\)–5 K. The Ho resonant intensity scales with \(P_c\), while the Fe-dominated non-resonant intensity scales with \(P_a\), so different components of the ferroelectric polarization are associated with different magnetic sublattices. The Ho order is initially induced by Fe order, but the rapid growth of the Ho sublattice at lower temperature feeds back on Fe and drives a competing anisotropy-controlled rearrangement. In that setting, “separated” does not mean uncoupled; it means experimentally isolated, temperature-differentiated, and only partially cooperative.

A related but distinct two-stage ordering occurs in kagome spin ice [1109.0275]. There the low-energy manifold contains both microscopic Ising spins and emergent magnetic charges \(Q_\alpha=\pm \sum_{i\in\alpha}\sigma_i\). In the short-range model \(H_1+H_2\), the system displays an intermediate critical phase bounded by Kosterlitz–Thouless transitions. In the dipolar model \(H_1+H_{\mathrm d}\), the intermediate phase instead has long-range staggered charge order, with an upper transition in the 2D Ising class and a lower transition expected asymptotically in the 2D 3-state Potts class. Here ordering is separated because charges order before the spins fully select one of the six \((\sqrt3\times\sqrt3)\) magnetic ground states.

In CeFeAsO, the relevant separation is between structural and Fe magnetic transitions [1001.4349]. The best single crystals show \(T_0=151\) K and \(T_N=145\) K, so \(\Delta T=T_0-T_N=6\) K, while earlier reports had values near \(18\) K. The decrease of \(\Delta T\) with sample quality was used to argue that a large split is not an intrinsic fixed property of the 1111 pnictides. In superconducting phase-separated Cs\(_{0.72}\)Fe\(_{1.57}\)Se\(_2\), the main ordered phase and a secondary phase coexist throughout the measured pressure range up to \(19\) GPa, while the main phase undergoes an \(I4/m \rightarrow I4/mmm\) Fe-vacancy order-disorder transition near \(10.5\)–11 GPa with kinetics on the order of hours [1402.7286]. In \(\mathrm{Ca_{1-x}Y_xMnO_3}\), separated ordering appears either as ferromagnetic domains of about \(7\,\mu\mathrm m\) embedded in a G-type antiferromagnetic matrix at \(x=0.1\), or as structural coexistence of orthorhombic Pnma and monoclinic \(P2_1/m\) phases carrying G-type and C-type antiferromagnetic orders at \(x=0.2\) [1602.02479].

Spatially fragmented variants also occur. In the frustrated honeycomb-lattice \(J_1\)-\(J_2\) Ising antiferromagnet for \(R=J_2/J_1>1/4\), Monte Carlo simulations indicate frozen stripe-type antiferromagnetic domains separated by zero-energy domain walls, with local order inside domains but no conventional magnetic long-range order across the whole lattice [1905.11487]. For driven skyrmions on random pinning, strong pinning and strong Magnus force produce either density phase separation into dense moving bands and depleted regions, or dynamically phase-separated states with nearly uniform density but motion localized in bands [1808.08214]. Across these examples, separated-ordering describes either multiple coupled order parameters with different observables, or ordered regions that remain spatially or dynamically segregated.

## 3. Separated linearization, pattern avoidance, and ordering complexity

In algorithmic order theory, one of the clearest nearby formalizations is the partial-order alignment problem [2110.02809]. Given partial orders \(\Gamma\) and \(\Pi\) on the same marker set \(\Sigma\), a linear extension must satisfy
\[
a\prec b \implies a\prec' b.
\]
The optimization problems are Max-Adj, maximizing the number of common adjacencies between chosen linearizations, and Min-Brk, minimizing breakpoints. They are equivalent through
\[
n_{\text{brk}} = n-1-n_{\text{adj}}.
\]
The paper proves that \(\text{Max-Adj}(\mathcal L,\mathcal I)\) and \(\text{Min-Brk}(\mathcal L,\mathcal I)\) are APX-hard, and that \(\text{Max-Adj}(\mathcal W,\mathcal W)\) and \(\text{Min-Brk}(\mathcal W,\mathcal W)\) remain APX-hard even when every bucket of each weak order has size at most two. It also gives a polynomial-time exact algorithm for \(\text{Max-Adj}(\mathcal L,\mathcal W)\) and \(\text{Min-Brk}(\mathcal L,\mathcal W)\) via dynamic programming over weak-order buckets. In this line of work, separated-ordering is a natural label for choosing two constrained total orders jointly while optimizing agreement on local consecutive structure.

Forbidden-pattern ordering provides another formal analogue [1408.1461]. For a set \(F\) of ordered graph patterns, \(ORD(F)\) asks whether a graph admits an \(F\)-free ordering. In the bipartite version \(BIORD(F)\), a bipartite graph \(H\) with fixed bipartition \(U\cup V\) is given, and the task is to order \(U\) and \(V\) separately so that no forbidden bipartite pattern occurs. For \(F\subseteq \mathcal B_4\), Theorem 3 states that \(H\) has an \(F\)-free ordering of its parts if and only if no strong component of the constraint digraph \(H^+\) contains a circuit; hence every \(BIORD(F)\) with \(F\subseteq \mathcal B_4\) is polynomial-time solvable. When “separated” means side-respecting or partition-respecting, \(BIORD(F)\) is the closest explicit formalism in that paper.

Partially ordered patterns extend this viewpoint through ordinal and disjoint sums of labeled posets [2510.18761]. The ordinal sum \(p\oplus q\) preserves the internal orders of \(p\) and \(q\) and forces every element of the first summand below every element of the second. The disjoint sum \(p+q\) preserves only internal orders and imposes no cross-block comparabilities. The paper reinterprets earlier shape-Wilf-equivalence results as ordinal-sum statements, proves disjoint-sum analogues, establishes \(p+q\sim q+p\), and completely classifies POPs of sizes \(3,4,5\) whose connected components are all chains. The distinction between layered separation (\(\oplus\)) and independent separation (\(+\)) makes “separated” literal at the level of poset composition.

A broader complexity-theoretic result shows that ordering problems defined by finitely many forbidden ordered subgraphs capture the class \(NP\) [2504.13268]. This refutes a general dichotomy conjecture for such ordering problems. At the same time, finite sets of biconnected ordered patterns do satisfy a tractability-versus-\(NP\)-completeness dichotomy, and a single forbidden biconnected ordered graph is \(NP\)-complete unless it is the ordered complete graph. A plausible implication is that separated-order constraints built from disconnected or marker-like patterns can be substantially more expressive than local biconnected ordering constraints.

## 4. Separated-ordering in NoC-based DNN accelerators

The most explicit technical use of the term occurs in NoC-based DNN accelerators [2509.00500]. There, separated-ordering is defined as follows: **“weights and inputs are ordered according to their own ‘1’-bit counts, respectively.”** Unlike affiliated-ordering, which sorts weights and moves the paired inputs with them, separated-ordering independently sorts the weight stream and the input/activation stream by descending population count. Because the positional pairing between inputs and weights is broken, a minimal-bit-width index is required for recovery.

The method operates at flit granularity. A flit is divided into an input half and a weight half, and separated-ordering applies the same descending `'1'`-bit-count principle independently to each half. The mathematical rationale is derived from the expected bit-transition count between consecutive 32-bit words and then between consecutive flits. For two flits containing \(N\) words each, with popcounts \(x_i\) and \(y_i\),
\[
E_t = \sum_{i=1}^{N} x_i + \sum_{i=1}^{N} y_i - \frac{\sum_{i=1}^{N}(x_i y_i)}{16}.
\]
Since the sums of one-bit counts are fixed for a given payload, minimizing \(E_t\) is equivalent to maximizing
\[
F = \sum (x_i y_i).
\]
The paper provides the proof for the generic count-based ordering principle and then applies that principle independently to the input and weight streams. It does **not** provide a separate theorem proving global optimality of separated-ordering for the full DNN scheduling problem.

Architecturally, the ordering unit is placed near off-chip memory rather than inside routers, and ordering latency is intended to be hidden between layers [2509.00500]. The same hardware used for affiliated-ordering can be used for separated-ordering “with double time consumption.” In full NoC experiments, the methods are compared as O0 (baseline), O1 (affiliated-ordering), and O2 (separated-ordering). Across different NoC sizes, separated-ordering yields **23.30% to 32.01%** bit-transition reduction for float-32 data and **16.95% to 35.93%** for fixed-8 data. Across DNN models including LeNet and a DarkNet-like model, the strongest reductions are up to **35.93%** for LeNet and **40.85%** for DarkNet. The headline NoC results are up to **32.01%** BT reduction for float-32 and **40.85%** for fixed-8. Using a synthesized link model with bit-transition energy \(0.173\text{ pJ}\), the paper estimates that with **40.85%** BT reduction link power falls from **155.008 mW** to **91.688 mW**, or from **476.672 mW** to **281.951 mW** in Banerjee’s model. In this literature, separated-ordering is therefore a concrete low-level transmission policy: independent ordering of semantically coupled streams to reduce switching activity.

## 5. Abstract order-theoretic and topological uses

In the theory of split extensions of preordered groups, the central separated-order construction is the lexicographic order on a semidirect product [2212.07064]. For a split extension
\[
(X,P_X)\xrightarrow{(1,0)} X\rtimes_\varphi B \mathrel{\substack{\xrightarrow{\pi_2}\\[-0.35em]\xleftarrow[(0,1)]{}}} (B,P_B),
\]
the product cone is \(P_{\mathrm{prod}}=P_X\times P_B\), while the lexicographic cone is
\[
P_{\mathrm{lex}} = \{(x,b)\in X\times B \mid b>0 \text{ or } (b\sim 0 \text{ and } x\ge 0)\}.
\]
Proposition 3.1 states that a positive cone \(P\) is compatible with the split extension if and only if
\[
P_{\mathrm{prod}} \subseteq P \subseteq P_{\mathrm{lex}}.
\]
Theorem 3.2 then shows that a compatible order exists if and only if the lexicographic order is compatible, which is equivalent to every action map \(\varphi_b\) being monotone and every \(b\sim 0\) acting pointwise as \(\varphi_b\sim \mathrm{id}\). The lexicographic order is thus the maximal compatible separated order, while the submonoid generated by \(P_{\mathrm{prod}}\) is the minimal compatible one. The same paper proves that the Split Short Five Lemma holds for stably strong split extensions.

A topological use of separation language appears in left-separated spaces [1609.09695]. A well-order \(<\) of a space \(X\) is left-separating if \(\{x'\in X:x'<x\}\) is closed for every \(x\in X\), and \(ord_l(X)\) is the minimum order type of such a well-order. For a regular cardinal \(\kappa\) and each \(\alpha<\kappa^+\), there is a \(T_2\) space \(X\) with
\[
ord_l(X)=\kappa\cdot\alpha.
\]
Under stronger hypotheses there are 0-dimensional examples, and in additional cases there are locally compact, locally countable, 0-dimensional examples with the same exact type. The union of two left-separated spaces is not necessarily left-separated, but if \(X\) is countably tight, \(X=Y\cup Z\), and \(ord_l(Y),ord_l(Z)<\omega_1\cdot\omega\), then \(X\) is left-separated and
\[
ord_l(X)\le ord_l(Y)+ord_l(Z).
\]
It is also consistent that a first countable, 0-dimensional space is not left-separated in the ground model but becomes left-separated in type \(\omega_1\cdot\omega\) after c.c.c. forcing.

Two neighboring but non-identical notions further illustrate the breadth of separation vocabulary. In group theory, a group \(G\) is order separable if non-conjugate and non-inverse-conjugate elements can be sent to a finite quotient with different orders; for free products, \(A*B\) is order separable if and only if \(A\) and \(B\) are order separable [1003.1116]. In linear-order theory, there exist non-isomorphic linear orders \(X\) and \(Y\) with
\[
X \cong AY = Y\omega,\qquad Y \cong AX = X\omega,
\]
for \(A=\omega_1^*+\omega_1\), so each order divides the other on both left and right under lexicographic product [1810.10913]. These are not instances of the NoC or multiferroic notion, but they show how separation language repeatedly arises when order is decomposed into asymmetric sides, factors, or stages.

## 6. Ordering as an independent information channel

A recent learning-theoretic development makes the separation of order from content completely explicit [2603.25047]. In modular addition with \(p=9973\), the model, initialization, optimizer, hyperparameters, training set, epoch budget, and compute budget are fixed; only the permutation of the \(300{,}000\) training pairs changes. The full input space has \(9973^2\) pairs, so the training set is about **0.3%** of the input space, and test performance is measured on **1,000,000** held-out pairs. Under Stride ordering, test accuracy reaches **99.5%** by epoch **487**; under Fixed-Random, it reaches **99.5%** by epoch **659**; the IID Random baseline reaches only **0.30%** after **5,000** epochs; and the adversarial Target ordering remains at **0.01%** test accuracy with **0.02%** train accuracy. The paper interprets this as evidence that order is a distinct information channel.

The formal mechanism is a decomposition of the gradient seen by batch \(B\) after an update on batch \(A\):
\[
\nabla L_B(\theta') \approx \nabla L_B(\theta) - \eta\, H_B(\theta)\cdot \nabla L_A(\theta).
\]
The first term is the content term; the second is the ordering or entanglement term. A counterfactual shuffled baseline is then used to define
\[
g_{\mathrm{ordering}} = g_{\mathrm{actual}} - g_{\mathrm{content}}.
\]
Measured this way, the ordering fraction accounts for **83%** of gradient energy under Stride, **84%** under Fixed-Random, **87%** under Random, and **89%** under Target. In the Stride case with \(s=\lfloor\sqrt{p}\rfloor=99\), the learned embedding spectrum concentrates on a fundamental Fourier mode
\[
F=\lfloor p/s \rceil = 101,
\]
and the same fundamental emerges across all tested seeds. The paper’s phrase “the order is the message” is therefore literal: ordering information is separable from example content and can determine both optimization trajectory and learned representation. A plausible implication is that separated-ordering can also mean the explicit isolation of sequence structure as its own causal variable.

Taken together, these literatures show that separated-ordering is best understood not as one universally fixed definition, but as a family of constructions in which order is decomposed into experimentally isolated sublattices, independently sorted data streams, separately constrained linearizations, lexicographically prioritized components, or content-independent temporal signals. The persistence of the idea across such different settings suggests that “separated” names a structural operation on order itself: isolating the parts of an ordering problem that can be treated as distinct without becoming irrelevant.

Source: https://www.emergentmind.com/topics/separated-ordering