Background
In this thread here at MathStackExchange
"N-free" permutations of (0,...,n-1) and pairs of orthogonal vectors in n-space
Paul Sinclair kindly took the time to discuss with me a certain linear-algebraic result obtained by John Burkardt.
This discussion has led me to reformulate my original question as a new question involving the interpretation of a permutation of 0,,,n-1 as a set of n 2-dimensional vectors rather than a set of two n-dimensional vectors.
In particular, if an "N-free" permutation P of 0,...n-1 is interpreted as a set of n 2-dimensional vectors in the obvious way, then the relationship between P and an "N-free" poset Po can readily be seen from the simple diagrams of a language-theoretic derivation tree and corresponding labelled bracketting at the bottom of this page:
https://www.thesyntacticretina.com/
Further, this relationship is important because it allows the extension of certain long-standing results on "N-free" permutations to "N-free" posets, which have been extensively studied in their own right independently of N-free permutations, e.g. here:
http://www.sciencedirect.com/science/article/pii/0166218X85900307
(Note, however, that the extension of results on permutations to results on posets involves more effort than one might think, because although this extension is straightforward, it requires a fair amount of mechanics to do correctly.)
Question:
Are there any OTHER known mathematical contexts in which it is useful to think of a permutation 0,...,n-1 as a set of n 2-dimensional vectors rather than as a set of 2 n-dimensional vectors (APART from the context mentioned above involving permutations and posets?)