Verónica Becher

collaborators

3 papers

math.PR2025

Poisson genericity in numeration systems with exponentially mixing probabilities

NicolÃ¡s Ãlvarez, VerÃ³nica Becher, Eda Cesaratto +3

We define Poisson genericity for infinite sequences in any finite or countable alphabet with an invariant exponentially-mixing probability measure. A sequence is Poisson generic if…

cs.FL2025

Automata for the commutative closure of regular sets

VerÃ³nica Becher, Simon Lew Deveali, Ignacio Mollo Cunningham

Consider $A^{*}$ , the free monoid generated by the finite alphabet $A$ with the concatenation operation. Two words have the same commutative image when one is a permutation of the…

math.CO2024

Lyndon pairs and the lexicographically greatest perfect necklace

VerÃ³nica Becher, TomÃ¡s Tropea

Fix a finite alphabet. A necklace is a circular word. For positive integers $n$ and~ $k$ , a necklace is $(n, k)$ -perfect if all words of length $n$ occur $k$ times but at positions w…