The Exponential Canonical Form (ECF) is a canonical representation of this trajectory, without necessarily depending on n. ECF is defined as a list, with elements ordered in ascending order:
{x0ā,x0ā+x1ā,ā¦,x0ā+x1ā+ā¦+xmā}
Notice that elements are in accumulated sums as we iterate the list. Alternatively, we can write the trajectory as:
The ECF of this trajectory is written a lot cleaner this way:
{p0ā,p1ā,p2āā¦,pmā}
ECF of a reduced trajectory 30ā31ā54ā1 looks like {0,1,5}.
Prefix
Consider ECFs of two trajectories, {p0ā,p1ā,ā¦,pmā} and {q0ā,q1ā,ā¦,qkā}. The prefix of these trajectories (or ECFs) is defined as:
{Ļ0ā,Ļ1ā,ā¦,Ļtā}
where āi:0ā¤iā¤t we have piā=qiā=Ļiā for largest t. In simpler terms, if we think of ECFs as strings, the prefix is the common prefix in both of these strings. Prefix can be an empty list, in which case we say that there is no prefix. Prefix itself is also an ECF!
For example, the sequences of 3 and 11 are as follows:
30ā31ā54ā1 with ECF {0,1,5}.
110ā111ā172ā133ā54ā1 with ECF {0,1,3,6,10}.
Their prefix is thus {0,1}.
Bijective Mapping
Any ECF {p0ā,p1ā,ā¦,pmā} can be represented by a unique positive integer. They are defined as follows:
2p0ā+2p1ā+ā¦+2pmā
The sequence of 3 was shown by ECF {0,1,5}, which can be represented by 35=20+21+25.