Projects per year
Abstract
Let $G$ be a quasitransitive, locally finite, connected graph rooted at a vertex $o$, and let $c_n(o)$ be the number of selfavoiding walks of length $n$ on $G$ starting at $o$. We show that if $G$ has only thin ends, then the generating function $F_{\mathrm{SAW},o}(z)=\sum_{n \geq 0} c_n(o) z^n$ is an algebraic function. In particular, the connective constant of such a graph is an algebraic number. If $G$ is deterministically edge labelled, that is, every (directed) edge carries a label such that any two edges starting at the same vertex have different labels, then the set of all words which can be read along the edges of selfavoiding walks starting at $o$ forms a language denoted by $L_{\mathrm{SAW},o}$. Assume that the group of labelpreserving graph automorphisms acts quasitransitively. We show that $L_{\mathrm{SAW},o}$ is a $k$multiple contextfree language if and only if the size of all ends of $G$ is at most $2k$. Applied to Cayley graphs of finitely generated groups this says that $L_{\mathrm{SAW},o}$ is multiple contextfree if and only if the group is virtually free.
Original language  English 

Publication status  Published  14 Oct 2020 
Keywords
 math.CO
 cs.FL
 math.GR
 20F10, 68Q45, 05C25
Fingerprint
Dive into the research topics of 'Selfavoiding walks and multiple contextfree languages'. Together they form a unique fingerprint.Projects
 1 Active

Doctoral Program: Discrete Mathematics
Ebner, O., Lehner, F., Greinecker, F., Burkard, R., Wallner, J., Elsholtz, C., Woess, W., Raseta, M., Bazarova, A., Krenn, D., Lehner, F., Kang, M., Tichy, R., SavaHuss, E., Klinz, B., Heuberger, C., Grabner, P., Barroero, F., Cuno, J., Kreso, D. & Berkes, I.
1/05/10 → 31/12/22
Project: Research project