Here's the definition: an ($n$-dimensional) cartographic set is an action of the cartographic group on some set $X$. The $n$-dimensional cartographic group is given by generators and relations \[ (\sigma_0, \ldots, \sigma_n \st \sigma_i^2 = (\sigma_i\sigma_j)^2 = 1,\ (|i - j| > 1)) \] The intuition behind this definition is that a $n$-dimensional space is made up of cells: 0-dimensional vertices, 1-dimensional edges, 2-dimensional faces (which, since this isn't a simplicial complex, can be generally polygons, rather than merely triangles), 3-dimensional volumes, etc.
The elements of the set $X$ on which the group acts are not cells but flags: a flag is a choice of a 0-cell $c_0$ and a 1-cell $c_1$, and $\cdots$ and an $n$-cell $c_n$, such that all the $(c_i)_{i\in \{0,\ldots,n\}}$ are incident to one another. For example, here is a depiction of a 2-dimensional space, (it's 2-dimensional because the space itself is constituted out of at most 2-dimensional stuff, though I've depicted it as a surface embedded in 3-dimensions) with some flags indicated by short lines attached to the face and edge that they belong to, drawn nearer to the vertex they belong to:
The fact that non-adjacent generators are supposed to commute ($\sigma_i\sigma_j = 1$ when $|i - j| > 2$) here means specifically that $\sigma_0$ and $\sigma_2$ commute, so we always end up with squares of blue and green edges in the above diagram, with blue and green edges alternating around each square.
A cartographic space is defined to be a vector space $V$ together with a homomorphism from the $n$-dimensional cartographic group to the group of linear maps $V \to V$.
For example, if we have a cartographic set $X$, we can trivially define a cartographic space from it: simply let the space $V$ be the space of all linear combinations of elements of $X$, and let the action of $\sigma_i$ on $V$ be the natural extension from its action on basis elements to general elements of $V$.
Here is an example of a $0$-vector field on $V$, i.e. a scalar field on the vertices of the space. The condition above requires $\sigma_1 v = v$ and $\sigma_2 v = v$; flipping the edge we're sitting on shouldn't change the coefficient of the flag we're looking at, and neither should flipping the face. All that matters is the vertex.
Curiously, I think both of these operations in this setting — at least when the cartographic space in question arises from a cartographic set — can be realized (when we fix the dimension $k$) as projection operators on $V$, i.e. linear idempotent maps $V \to V$. Given the involutivity of $\sigma_i$, we do know that $\mu_i = (\sigma_i + 1) / 2$ is idempotent, for \[ \mu_i \mu_i v = \mu_i (\sigma_i v + v) / 2 \] \[= (\sigma_i \sigma_i v + 2 \sigma_i v + v) / 4\] \[= ( v + 2 \sigma_i v + v) / 4\] \[= ( 2 \sigma_i v + 2v) / 4\] \[= ( \sigma_i v + v) / 2\] \[= \mu_i v\] We can also define the 'opposite' projection $\bar \mu_i = (1 - \sigma_i) / 2$. It is easy to check that $\im \mu_i = \ker \bar \mu_i$ and $\ker \mu_i = \im \bar\mu_i$ and $\mu_i + \bar\mu_i = 1$. Now I claim that there are projections $L_k, R_k : V \to V$, uniquely defined by requiring that \[\im L_k = \bigcap_{i < k} \ker \mu_i \qquad \im R_k = \bigcap_{i > k} \im \mu_i \] \[\ker L_k = \sum_{i < k} \im \mu_i \qquad \ker R_k = \sum_{i > k} \ker \mu_i \] and in fact these commute, $L_k R_k = R_k L_k$. Let's define $\pi_k = L_k R_k$. I claim moreover that the image of $\pi_k$ is exactly the set of $k$-vector fields $V_k$, since \[ V_k = \bigcap_{i < k}\ker(\sigma_i + 1) \cap \bigcap_{i > k} \ker(\sigma_i - 1) \] \[ = \bigcap_{i < k}\ker((\sigma_i + 1) / 2) \cap \bigcap_{i > k} \ker((\sigma_i - 1) / 2) \] \[ = \bigcap_{i < k}\ker(\mu_i) \cap \bigcap_{i > k} \ker(\bar\mu_i) \] \[ = \bigcap_{i < k}\ker(\mu_i) \cap \bigcap_{i > k} \im(\mu_i) \] \[ = \im L_k \cap \im R_k\]
Now the punchline is that taking a $(k+1)$-vector field that already lives $V_{k+1}$ and hitting it with $\pi_k$ is essentially the same thing as taking its boundary. In this case, if we wanted to show that the chain complex condition \[\partial \partial = 0\] holds, it would suffice to show that \[ \pi_{k-1}\pi_k\pi_{k+1} = 0 \tag{1}\] For we start with some vector $v$ that lives in $V_{k+1}$, and so we know that $\pi_{k+1} v = v$. If we take its boundary once, that's $\pi_k \pi_{k+1} v$. If we take its boundary twice, that's $\pi_{k-1}\pi_k \pi_{k+1}$. To establish (1), we need only check a few 'absorption' properties, namely that for any $k$, we have \[ i< k \imp (L_k \bar\mu_i = L_k = \bar\mu_i L_k) \quad L_k L_{k+1} = L_{k+1} \] \[ i> k \imp (R_k \mu_i = R_k = \mu_i R_k) \quad R_{k-1} R_{k} = R_{k-1}\] which means that \[ \pi_{k-1}\pi_k\pi_{k+1} = L_{k-1}R_{k-1} R_k L_k L_{k+1}R_{k+1} \] \[ = L_{k-1}R_{k-1} L_{k+1}R_{k+1} \] \[ = L_{k-1}R_{k-1}\mu_k \bar\mu_k L_{k+1}R_{k+1} \] \[ = L_{k-1}R_{k-1} 0 L_{k+1}R_{k+1} \] \[ = 0 \]
Or, in a diagram chase: