Differential transcendence and walks on self-similar graphs
Combinatorics
2026-02-04 v2 Probability
Abstract
Symmetrically self-similar graphs are an important type of fractal graph. Their Green functions satisfy order one iterative functional equations. We show when the branching number of a generating cell is two, either the graph is a star consisting of finitely many one-sided lines meeting at an origin vertex, in which case the Green function is algebraic, or the Green function is differentially transcendental over . The proof strategy relies on a recent work of Di Vizio, Fernandes and Mishna. The result adds evidence to a conjecture of Kr\"on and Teufl about the spectrum of this family of graphs.
Keywords
Cite
@article{arxiv.2411.19316,
title = {Differential transcendence and walks on self-similar graphs},
author = {Yakob Kahane and Marni Mishna},
journal= {arXiv preprint arXiv:2411.19316},
year = {2026}
}
Comments
14 pages