This paper references the "PQ tree algorithm." I looked this up and have found information about what PQ trees are. However, I haven't been able to find a clear explanation of what the algorithm does and how it solves Theorem 1.6 in this paper. Can someone please explain the PQ tree algorithm or link to a paper or article that explains it?
I don't fully understand the rules for neural codes. Do 00, 000, 0000 etc. count as codewords? Is the space a line segment, or all of ? If so, can the place fields go to (for example, is a place field at allowed)? Can place fields be single points?