Life and Education
Academic positions
- Random walks on graphs and groups
- Combinatorial problems on self-similar graphs
- Structure of infinite graphs and groups
- Asymptotic methods in combinatorics and probability theory
- E.Teufl. Brownsche Bewegung auf Fraktalen.
Diploma thesis, Graz, 1999
- E.Teufl. Asymptotic Problems Related to Self-Similar Graphs and Fractals.
Thesis, Graz, 2002
- E.Teufl.
On the Hausdorff Dimension of the Sierpinski Gasket
with respect to the Harmonic Metric.
In: P. Grabner, W. Woess (eds.),
Fractals 2001 in Graz, Birkhäuser Verlag, 263-270, 2003
- E.Teufl.
The Average Displacement of the Simple Random Walk on the Sierpinski Graph.
Combinatorics, Probability and Computing 12, 203-222, 2003
- B.Krön, E.Teufl.
Asymptotics of the Transition Probabilities of the Simple Random Walk
on Self-Similar Graphs.
Transactions of the American Mathematical Society 356, 393-414, 2004.
arXiv.org
- E.Teufl, S.Wagner.
The number of spanning trees of finite Sierpinski graphs.
Fourth Colloquium on Mathematics and Computer Science.
Discrete Mathematics & Theoretical Computer Science Proceedings AG, 411-414, 2006
- E.Teufl.
On the Asymptotic Behaviour of Analytic Solutions of Linear Iterative Functional Equations.
Aequationes Mathematicae 73, 18-55, 2007
- E.Teufl, S.Wagner.
Enumeration Problems for Classes of Self-Similar Graphs.
Journal of Combinatorial Theory. Series A 114, 1254-1277, 2007
- E.Teufl, S.Wagner.
Asymptotic enumeration on self-similar graphs with two boundary vertices.
Discrete Mathematics & Theoretical Computer Science 11(1), 11-32, 2009
- E.Teufl, S.Wagner.
An asymptotic independence theorem for the number of matchings in graphs.
Graphs and Combinatorics 25(2), 239-251, 2009
- E.Teufl, S.Wagner.
Exact and asymptotic enumeration of perfect matchings in some self-similar graphs.
Discrete Mathematics 309(23-24), 6612-6625, 2009
- E.Teufl, S.Wagner.
Spanning forests, electrical networks, and a determinant identity.
21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009).
Discrete Mathematics & Theoretical Computer Science Proceedings AK, 847-858, 2009
- E.Teufl, S.Wagner.
Determinant identities for Laplace matrices.
Linear Algebra and its Application 432, 441-457, 2010
- E.Teufl, S.Wagner.
Enumeration of matchings in families of self-similar graphs.
Discrete Applied Mathematics 158, 1524-1535, 2010
- E.Teufl, S.Wagner.
On the number of spanning trees on various lattices.
Journal of Physics A: Mathematical and Theoretical 43, 415001, 2010
- E.Teufl, S.Wagner.
Resistance scaling and the number of spanning trees in self-similar lattices.
Journal of Statistical Physics 142(4), 879-897, 2011
- E.Teufl, S.Wagner.
The Number of Spanning Trees in Self-Similar Graphs.
Annals of Combinatorics 15(2), 355-380, 2011
- M.Lamberger,
E.Teufl.
Memoryless Near-Collisions, Revisited.
Information Processing Letters 113(3), 60-66, 2012.
arXiv.org
- M.Shinoda,
E.Teufl, S.Wagner.
Uniform spanning trees on Sierpinski graphs.
ALEA, Latin American Journal of Probability and Mathematical Statistics 11(2), 737-780, 2014.
arXiv.org
- B.Krön,
J.Lehnert, N.Seifter, E.Teufl.
Linear and projective boundary of nilpotent groups.
Glasgow Mathematical Journal 57, 591-632, 2015.
arXiv.org
- B.Steinsky, E.Teufl.
Simple Random Walk on Nice Trees.
in preparation
- B.Krön, E.Teufl.
A theorm of Halin for path-connected Hausdorff spaces.
in preparation
Eine vollständige Liste mit den Lehrveranstaltungen findet sich im
alma.
Last modified on 30 March 2020
Impressum: Elmar Teufl, Tübingen (Germany)