Homepage of Lilla Tóthmérész

Email: tmlilla at math.cornell.edu

Office: 511 Malott Hall

I am interested in algorithmic and combinatorial questions related to the chip-firing game and the rotor-router model. I also study the Bernardi process, which is a way of traversing the edges of a graph (determined by local rules) and that has nice connections to geometry.


MATH 4710 (Fall 2017)

Papers and preprints

Lilla Tóthmérész, Algorithmic aspects of rotor-routing and the notion of linear equivalence, Discrete Applied Mathematics, accepted (arXiv)

Bálint Hujter, Lilla Tóthmérész, Chip-firing based methods in the Riemann-Roch theory of directed graphs, submitted (arXiv)

Zoltán Király, Lilla Tóthmérész, On Ryser's conjecture for t-intersecting and degree-bounded hypergraphs, Electronic Journal of Combinatorics, accepted (arXiv)

Bálint Hujter, Viktor Kiss, Lilla Tóthmérész, On the complexity of the chip-firing reachability problem,  Proc. Amer. Math. Soc. 145 (2017), 3343-3356 (arXiv)

Viktor Kiss, Lilla Tóthmérész, Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph, Discrete Applied Mathematics 193 (2015) 48-56 (arXiv)

Gregory Kucherov, Lilla Tóthmérész, Stéphane Vialette, On the combinatorics of suffix arrays, Information Processing Letters 113 (2013) 915-920 (arXiv)