2 papers
math.CO2015
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 $…
cs.DM2013
Critical connectedness of thin arithmetical discrete planes
Valérie Berthé, Damien Jamet, Timo Jolivet +1
An arithmetical discrete plane is said to have critical connecting thickness if its thickness is equal to the infimum of the set of values that preserve its -connectedness. This…