Home
CV Email me
Research
Research Projects Recent Presentations Software and Data
Teaching
Computational Redistricting Ethics Resources LaTeX Workshops Crossroads Problems
Course Notes
Intro to MCMC Dartmouth Written Qual Complex Networks Topology Videos

Cantor Endpoints

This is an interact module for computing the endpoints of the singular distributions as described in Theorem 6 of the paper On the Spectrum of Finite Rooted Homogeneous Trees joint with my Ph.D. advisor Dan Rockmore. The two parameters are the branching pattern of the tree (k) and the level of the tree (j). That is, the endpoints correspond to the new eigenvalues that appear in Xjk. The function returns a list of the corresponding left-endpoints and the intervals have width equal to 2-(k+1) by Lemma 6 so computing the right endpoints can be computed from this information as well. More details are available on GitHub.