11 citations · 18 across the 5 of their papers we have counts for
5 papers
A generalization of perfectly clustering words and band bricks for certain gentle algebras
Benjamin Dequêne, Mélodie Lapointe, Yann Palu +3
We generalize the perfectly clustering words of Simpson and Puglisi and relate them to band bricks over certain gentle algebras. This allows us to prove a generalization of a conje…
The -analog of the Markoff injectivity conjecture over the language of a balanced sequence
Sébastien Labbé, Mélodie Lapointe
The Markoff injectivity conjecture states that is injective on the set of Christoffel words where is…
Number of orbits of Discrete Interval Exchanges
Mélodie Lapointe
A new recursive function on discrete interval exchange transformation associated to a composition of length , and the permutation is defined. Acting on composit…
Leaf realization problem, caterpillar graphs and prefix normal words
Alexandre Blondin Massé, Julien de Carufel, Alain Goupil +3
Given a simple graph with vertices and a natural number , let be the maximum number of leaves that can be realized by an induced subtree of with…
Fully leafed induced subtrees
Alexandre Blondin Massé, Julien de Carufel, Alain Goupil +3
Let be a simple graph on vertices. We consider the problem LIS of deciding whether there exists an induced subtree with exactly vertices and leaves in …