Christian Lindorfer

activity

20192026

collaborators

7 papers

math.GR2026

Graphs of group actions and group actions on trees

Florian Lehner, Christian Lindorfer, Rögnvaldur G. Möller +1

Bass-Serre theory provides a powerful framework for studying group actions on trees. While extremely effective for structural questions in group theory, it is less suited to the sy…

math.CO2024

Self-avoiding walk is ballistic on graphs with more than one end

Florian Lehner, Christian Lindorfer, Christoforos Panagiotis

We prove that on any transitive graph $G$ with infinitely many ends, a self-avoiding walk of length $n$ is ballistic with extremely high probability, in the sense that there exist…

cs.CG2024

Folding polyominoes into cubes

Oswin Aichholzer, Florian Lehner, Christian Lindorfer

Which polyominoes can be folded into a cube, using only creases along edges of the square lattice underlying the polyomino, with fold angles of $\pm 9 0^{\circ}$ and $\pm 18 0^{\circ}$ ,…

math.CO2020

Self-avoiding walks and multiple context-free languages

Florian Lehner, Christian Lindorfer

Let $G$ be a quasi-transitive, locally finite, connected graph rooted at a vertex $o$ , and let $c_{n} (o)$ be the number of self-avoiding walks of length $n$ on $G$ starting at $o$ . W…

cs.FL2020

Comparing consecutive letter counts in multiple context-free languages

Florian Lehner, Christian Lindorfer

Context-free grammars are not able to model cross-serial dependencies in natural languages. To overcome this issue, Seki et al. introduced a generalization called $m$ -multiple cont…

math.CO2019

The language of self-avoiding walks

Christian Lindorfer, Wolfgang Woess

Let $X = (V X, E X)$ be an infinite, locally finite, connected graph without loops or multiple edges. We consider the edges to be oriented, and $E X$ is equipped with an involution…

math.CO2019

A general bridge theorem for self-avoiding walks

Christian Lindorfer

Let $X$ be an infinite, locally finite, connected, quasi-transitive graph without loops or multiple edges. A graph height function on $X$ is a map adapted to the graph structure, a…