Companion to "Pfaffian Point Processes for Two Classes of Random Plane Partitions"
Computation of Matrices for the TSSCPP Point Process
Consider the Pfaffian point process for order- TSSCPP's. The code below computes the matrices , , and associated with the Pfaffian point process for order- TSSCPP's. Recall that , where is the residue of modulo and where for and . Then the kernel is the matrix with blocks Here, denotes entry of matrix , and Note that for easier computation, we have the following identity for the entries of the matrix :
1. Computing and Saving the Values
Let be the array containing all values , where indexes rows and indexes columns. Note that this array contains Pascal's triangle, since Let denote the truncation of . Below, we create and save the array , where is the index of the largest correlation kernel we wish to compute.
2. Computing and Saving the Values
With the array saved, we now create arrays , which are needed for computation of the matrices . Note that Depends on the order of the TSSCPP point process, and that Below, we compute all arrays for , where was chosen previously.
3. Computing and Saving the Matrices
Recall that where on the right-hand side and run from to , and where and run from to . We now compute and save the matrices for , where .
4. Computing and Saving the Matrices
By simply loading the matrices saved in the last step, we now compute the matrices for .
5. Computing and Saving the Kernels
Our final step is to compute the kernels for . Recalling that , we construct four separate arrays , where . Notice that where denotes the transpose of . On the right-hand side, and run from to , and and run from to . Similarly, we have These four arrays are then combined to form .
Loading and Viewing Matrix Data
Below, we access and print a few of the matrices , , and :