activity
20192026
most citedSelf-Avoiding Walks on Cayley Graphs Through the Lens of Symbolic Dynamics

1 citations · 2 across the 5 of their papers we have counts for

collaborators

6 papers

math.DS2026

Non-determinism in group actions and topological minimal self-joinings

Nicolás Bitar, Sebastián Donoso, Samuel Petite

We study the topological and geometrical aspects of non-determinism in group actions, generalizing the notion of non-expansive direction for abelian actions. Under suitable conditi…

math.CO2024★ 1 cited

Self-Avoiding Walks on Cayley Graphs Through the Lens of Symbolic Dynamics

Nathalie Aubrun, Nicolás Bitar

We study dynamical and computational properties of the set of bi-infinite self-avoiding walks on Cayley graphs, as well as ways to compute, approximate and bound their connective c…

math.CO2023

Contributions to the Domino Problem: Seeding, Recurrence and Satisfiability

Nicolás Bitar

We study the seeded domino problem, the recurring domino problem and the -SAT problem on finitely generated groups. These problems are generalization of their original versions…

cs.DM2023

Domino Snake Problems on Groups

Nathalie Aubrun, Nicolas Bitar

In this article we study domino snake problems on finitely generated groups. We provide general properties of these problems and introduce new tools for their study. The first is t…

cs.DM2022★ 1 cited

Strongly Aperiodic SFTs on Generalized Baumslag-Solitar groups

Nathalie Aubrun, Nicolás Bitar, Sacha Huriot-Tattegrain

We look at constructions of aperiodic SFTs on fundamental groups of graph of groups. In particular we prove that all generalized Baumslag-Solitar groups (GBS) admit a strongly aper…

cs.DM2019

Computational Complexity of Biased Diffusion Limited Aggregation

Nicolas Bitar, Eric Goles, Pedro Montealegre

Diffusion-Limited Aggregation (DLA) is a cluster-growth model that consists in a set of particles that are sequentially aggregated over a two-dimensional grid. In this paper, we in…