2 citations · 2 across the 4 of their papers we have counts for
7 papers
Rigidity and reconstruction for graphs
Gunther Cornelissen, Janne Kool
We present measure theoretic rigidity for graphs of first Betti number b>1 in terms of measures on the boundary of a 2b-regular tree, that we make explicit in terms of the edge-adj…
Edge reconstruction of the Ihara zeta function
Gunther Cornelissen, Janne Kool
We show that if a graph has average degree , then the Ihara zeta function of is edge-reconstructible. We prove some general spectral properties of the edge a…
Explicit construction of Ramanujan bigraphs
Cristina Ballantine, Brooke Feigon, Radhika Ganapathy +3
We construct explicitly an infinite family of Ramanujan graphs which are bipartite and biregular. Our construction starts with the Bruhat-Tits building of an inner form of $SU_3(\m…
A spectral lower bound for the divisorial gonality of metric graphs
Omid Amini, Janne Kool
Let be a compact metric graph, and denote by the Laplace operator on with the first non-trivial eigenvalue . We prove the following Yang-Li-Yau type inequality on…
A combinatorial Li-Yau inequality and rational points on curves
Gunther Cornelissen, Fumiharu Kato, Janne Kool
We present a method to control gonality of nonarchimedean curves based on graph theory. Let k denote a complete nonarchimedean valued field. We first prove a lower bound for the go…
Dynamics measured in a non-Archimedean field
Janne Kool
We study dynamical systems using measures taking values in a non-Archimedean field. The underlying space for such measure is a zero-dimensional topological space. In this paper we…