The following pages link to Narad Rampersad (Q284844):
Displaying 13 items.
- The Weak Circular Repetition Threshold Over Large Alphabets (Q6331767) (← links)
- Closed Ziv-Lempel factorization of the $m$-bonacci words (Q6369578) (← links)
- Congruence properties of combinatorial sequences via Walnut and the Rowland-Yassawi-Zeilberger automaton (Q6380119) (← links)
- Extending Dekking's construction of an infinite binary word avoiding abelian $4$-powers (Q6383093) (← links)
- Prefixes of the Fibonacci word that end with a cube (Q6383320) (← links)
- Antisquares and Critical Exponents (Q6506617) (← links)
- A small morphism for which the fixed point has an abelian critical exponent less than 2 (Q6551808) (← links)
- Antisquares and critical exponents (Q6599795) (← links)
- Dyck words, pattern avoidance, and automatic sequences (Q6615627) (← links)
- Introduction. Special volume in honor of Jeffrey Shallit on the occasion of his \(60^{\mathrm{th}}\) birthday (Q6647991) (← links)
- Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers (Q6654113) (← links)
- The lexicographically least binary rich word achieving the repetition threshold (Q6671609) (← links)
- Repetition Threshold for Binary Automatic Sequences (Q6732051) (← links)
