4 citations · 7 across the 6 of their papers we have counts for
4 papers · 1 filter
Palindromic complexity of trees
Srečko Brlek, Nadia Lafrenière, Xavier Provençal
We consider finite trees with edges labeled by letters on a finite alphabet . Each pair of nodes defines a unique labeled path whose trace is a word of the free monoid $…
Combinatorial Variations on Cantor's Diagonal
Srečko Brlek, Jean-Philippe Labbé, Michel Mendès France
We discuss counting problems linked to finite versions of Cantor's diagonal of infinite tableaux. We extend previous results of [2] by refining an equivalence relation that reduces…
On the critical exponent of generalized Thue-Morse words
Alexandre Blondin-Massé, Srecko Brlek, Amy Glen +1
For certain generalized Thue-Morse words t, we compute the "critical exponent", i.e., the supremum of the set of rational numbers that are exponents of powers in t, and determine e…
Discrete sets with minimal moment of inertia
S. Brlek, G. Labelle, A. Lacasse
This paper has been withdrawn by the author due to a crucial error in the proof of Theorem 1.