3 papers
math.CO2022
On the number of squares in a finite word
Srečko Brlek, Shuo Li
A {\em square} is a word of the form . In this paper we prove that for a given finite word , the number of distinct square factors of is bounded by $|w|-|\Alphabet(w)|+1…
math.MG2011
Complexity of the Fibonacci snowflake
Alexandre Blondin Massé, Srečko Brlek, Sébastien Labbé +1
The object under study is a particular closed curve on the square lattice related with the Fibonacci sequence . It belongs to a class of curves whose length is $4F_{3n+…
math.CO2003
Cantorian Tableaux and Permanents
Srečko Brlek, Michel Mendès France, John Michael Robson +1
This article could be called "theme and variations" on Cantor's celebrated diagonal argument. Given a square nxn tableau T=(a_i^j) on a finite alphabet A, let L be the set of its r…