14 citations · 28 across the 9 of their papers we have counts for
8 papers · 1 filter
On the Markov numbers: fixed numerator, denominator, and sum conjectures
Clément Lagisquet, Edita Pelantová, Sébastien Tavenas +1
The Markov numbers are the positive integer solutions of the Diophantine equation . Already in 1880, Markov showed that all these solutions could be generat…
Derivated sequences of complementary symmetric Rote sequences
Kateřina Medková, Edita Pelantová, Laurent Vuillon
Complementary symmetric Rote sequences are binary sequences which have factor complexity for all integers and whose languages are closed under the…
On the fixed point of the iterated pseudopalindromic closure
D. Jamet, G. Paquin, G. Richomme +1
First introduced in the study of the Sturmian words, the iterated palindromic closure was recently generalized to pseudopalindromes. This operator allows one to construct words wit…
A characterization of balanced episturmian sequences
G. Paquin, L. Vuillon
It is well known that Sturmian sequences are the aperiodic sequences that are balanced over a 2-letter alphabet. They are also characterized by their complexity: they have exactly…
Discrete Tomography: Reconstruction under periodicity constraints
Alberto Del Lungo, Andrea Frosini, Maurice Nivat +1
This paper studies the problem of reconstructing binary matrices that are only accessible through few evaluations of their discrete X-rays. Such question is prominently motivated b…
Characterisation of lattices induced by (extended) Chip Firing Games
Clemence Magnien, Ha Duong Phan, Laurent Vuillon
The Chip Firing Game (CFG) is a discrete dynamical model used in physics, computer science and economics. It is known that the set of configurations reachable from an initial confi…