Manuscript En03-A@1 · En03-A.tex · section · 5398614e

Event germs, guard, transport, and finite code

External conical geometry and certified local moves › Event germs, guard, transport, and finite code · lines 2178–2191

En03-A@1#eq:counter-permutation

With no encoded locations, the event mode/counter action is

f (0, k) = (1, k - 1), f (1, k - 1) = (0, k), 1 \leq k \leq 2^{r} - 1,

with $(0, 0)$ , $(1, 2^{r} - 1)$ fixed. For the exchange, this action is enabled only on valid $j = 0$ event data; other strings remain fixed. The reverse action is a reversible completion, not another forward geometric rule.

Displayed formulas in this passage

En03-A@1#eq:counter-permutation · line 2181
$f (0, k) = (1, k - 1), f (1, k - 1) = (0, k), 1 \leq k \leq 2^{r} - 1,$

Nearby in this section

section: Event germs, guard, transport, and finite code
definition: Definition: Exact event guard
section: Event germs, guard, transport, and finite code
proposition: Proposition: Geometric rule and blind control
section: Event germs, guard, transport, and finite code
lemma: Lemma: Injective event encoding
section: Event germs, guard, transport, and finite code
proposition: Proposition: Decoder-correct event permutation