The contiguous part of this—355:312:59—was shown in an older entry, but I recently found the other three pairs mirrored about the same axis, and then the other group. The simplest interpretation of these is: six symmetrical (same number of components) mirrored (same MQ) pairs about the same axis. Ignoring the axis part, in a randomly generated set (using possible MQs 18-115), there are on average 47 of these symmetrical mirrored pairs. If the WTC 1 set of MQs is shuffled, the average is 70. In the actual ordered WTC 1 set, there are 90.
Considering the axis: [at least] six symmetrical mirrors about the same axis occurs about 1% of the time (at random). Of course, there are many different axes in the WTC1 set with multiple mirrors. The largest of these multi-mirrorings are 6, 6, 5, 4, and 3 (the two six groups are in the image). Randomly, this occurs about .002% of the time. If using the WTC1 set and shuffling only prelude and fugue MQs to respective even and odd positions in the index, the odds increase to just .17%. Shuffling the WTC1 set obviously enters into a “begging the question” scenario, but it unsurprisingly doesn’t really boost the odds into “likely” territory.
Considering the contiguous bit: the odds of a 3-part contiguous mirror occurring over at least 36 components at random is .07%; shuffling the WTC1 set increases this to .14%. This ignores the 3 other mirrors about the same axis, which would naturally decrease the percentage.
Considering that the difference between the axis positions for both of the pictured groups is <1: the chances of two contiguous groups of 3 symmetrical mirrored pairs about the same axis having axes at or adjacent to the same component is %.0007. That is, I had 7 hits in 1,000,000 attempts. The shuffled set increases it to %.0024. This again does not take into account the size of the two groups, or the other non-contiguous mirrors; I believe the isolated requirements are sufficient here, as some might say applying all is overly restrictive. Update 1/5/25: I tried anyway for fun. I made sure that the script was able to find the actual [pictured groups] from the WTC1 set via the same process before setting it to randomize/simulate. In a random set of 48 MQs generated from 18-115, two axes less than <1 apart were found to have 6 symmetrical mirrors, with three of them being contiguous and at least 10 components long 1 in 1,000,000 times. It was trial #350,114, for the curious.
For the technically curious: my method was to divide the logic into the smallest reasonable steps, and test that the step was operating correctly before moving to the next. The steps building up to this final test are thus:
Create an index of 48 random numbers, using range 18-115, can repeat.
Calculate all contiguous group totals. (0,0), (0,1), (0,2), etc.
List all totals that occur more than once, along with each instance of that total and its index range.
For each recurring total, list all possible pairs of instances whose ranges do not intersect. These will be called “mirrored pairs.”
For each non-intersecting pair, list pairs whose index lengths are the same. These will be called “symmetrical mirrored pairs”.
For each symmetrical mirrored pair, calculate the average of the first instance’s end point with the second instance’s start point, which we will call the “axis”. Ex: (0,5) and (6,11) have an axis of 5.5.
List all axes that repeat, along with their respective mirrored sums, indices of each instance in the mirrored pairs, and starting point of the first instance of each pair.
If there are duplicate instances of starting points within an axis, remove all but the entry with the smallest sum. This gives all unique mirrored pairs.
OR
Remove all pairs that do not have duplicate starting points. This gives all contiguous groups.