activity
20092026
most citedCounting dimer coverings on self-similar Schreier graphs

23 citations · 195 across the 40 of their papers we have counts for

collaborators

45 papers

math.GR2026

A graph-theoretical characterisation of subgroups of Thompson's group

Corentin Bodart, Daniele D'Angeli, Davide Perego +1

We prove a graph-theoretical characterisation of finitely generated subgroups of Thompson's group : a finitely generated group embeds in if and only if it admits a faithful…

math.CO2026

On totally synchronizing graphs

Daniele D'Angeli, Emanuele Rodaro

A coloring of a finite -out directed graph is viewed as a deterministic complete automaton with state set . The graph is called \emph{totally synchronizing} if eve…

math.CO2026

Topological indices on self-similar graphs generated by groups

Daniele D'Angeli, Stefan Hammer, Emanuele Rodaro

In this paper, we determine precise formulas for the diameters, the number of perfect matchings, and the Tutte polynomials for an infinite family of finite graphs, namely the Schre…

math.CO2025

Horofunctions of infinite Sierpinski polygon graphs

Daniele D'Angeli, Francesco Matucci, Davide Perego +1

Generalizing works of D'Angeli and Donno, we describe, starting from an infinite sequence over letters with and , a sequence of pointed finite gra…

math.GR2025

Freeness Obstructions for Self-Similar Groups Acting on Rooted Trees

Daniele D'Angeli, Emanuele Rodaro

We prove two general obstructions to freeness for self-similar groups and derive consequences for automaton groups. First, let be a finite invertible Mealy automaton w…

math.GR2024

On the ET0L subgroup membership problem in bounded automata groups

Alex Bishop, Daniele D'Angeli, Francesco Matucci +3

We are interested in the subgroup membership problem in groups acting on rooted -regular trees and a natural class of subgroups, the stabilisers of infinite rays emanating from…