Sciweavers

CORR
2011
Springer
124views Education» more  CORR 2011»
13 years 5 months ago
Redundancy of minimal weight expansions in Pisot bases
Abstract. Motivated by multiplication algorithms based on redundant number representations, we study representations of an integer n as a sum n = k εkUk, where the digits εk are ...
Peter J. Grabner, Wolfgang Steiner
IANDC
2007
66views more  IANDC 2007»
13 years 10 months ago
Exponential lower bounds for the number of words of uniform length avoiding a pattern
We study words on a finite alphabet avoiding a finite collection of patterns. Given a pattern p in which every letter that occurs in p occurs at least twice, we show that the nu...
Jason P. Bell, Teow Lim Goh