This is a nice problem because while it’s pretty simple and specific, it’s representative of a large class of problems where a collection of agents are trying to carry out tasks together. ‘Moving along the edge of a graph’ can stand for a task of any sort. The constraint that some edges can only be traversed by specified teams is then a way of saying that certain tasks can only be accomplished by teams.

Furthermore, there are nice software packages for optimization subject to constraints. For example, John likes one called Choco. So, we plan to use one of these as part of the project.

What makes this all *compositional* is that John has expressed this problem using our ‘network model’ formalism, which I began sketching in Part 6. This allows us to assemble tasks for larger collections of agents from tasks for smaller collections.

• John C. Baez, John Foley, Joseph Moeller and Blake S. Pollard, Network Models. (Blog article here.)

]]>Hi! Yes, those three x’s should be e’s. Thanks! A fixed version is here.

Thanks for noticing that the diagram of the permutation is ‘upside down’. Of course it’s just a convention, but I personally prefer to read the permutation from top to bottom, like you. I will argue with my coauthors, if necessary.

]]>On the page 11 of the preprint, theorem 12, third dot, I believe you wrote “x” instead of “e”: .

Also, on page 8 of the preprint, I wonder if the diagram of permutations (1526374) is upside down, or if it is the way people in the area draw them.

]]>Thanks!

]]>You must be quick! I fixed the link about 10 minutes after posting this article. It seems to work fine now.

]]>I am a huge fan of this blog series. Thank you for sharing.

The link to ” John Baez, John Foley, Blake Pollard and Joseph Moeller, Network models.” is broken, Could you point me to the right link?

Thanks in advance

]]>