Improved bounds on the number of ternary square-free words

zbMATH Open1004.05003arXivmath/0105245MaRDI QIDQ2776771FDOQ2776771

Authors: Uwe Grimm 

Publication date: 3 April 2002

Published in: Journal of Integer Sequences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0105245

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• An improved lower bound on the number of ternary squarefree words
• scientific article; zbMATH DE number 1264511
• Lengths of extremal square-free ternary words
• On the entropy and letter frequencies of ternary square-free words
• Efficient lower bounds on the number of repetition-free words

zbMATH Keywords

enumeration

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15) Combinatorial inequalities (05A20)

Cited In (11)

• Counting ternary square-free words quickly
• Square-free words obtained from prefixes by permutations
• On ternary square-free circular words
• An improved lower bound on the number of ternary squarefree words
• Title not available (Why is that?)
• On the tree of ternary square-free words
• Growth of repetition-free words -- a review
• Pattern avoidance: themes and variations
• Efficient lower bounds on the number of repetition-free words
• On the entropy and letter frequencies of powerfree words
• On the entropy and letter frequencies of ternary square-free words

Uses Software

• OEIS

This page was built for publication: Improved bounds on the number of ternary square-free words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2776771)