Trisograms, Quadrisograms, Quintisograms
Eric Chaikin
Abstract
Eric Chaikin
Abstract
A previous article introduced a term bisogram to refer to a pair of words which does not repeat a letter, and described the search to equal the longest-known example, the 20 letter GUNPOWDERY BLACKSMITH. In this article, I described the search to equal the longest-known three-four- and five-word sets: triosgrams, quadrisograms, and quitisograms.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A previous article introduced a term bisogram to refer to a pair of words which does not repeat a letter, and described the search to equal the longest-known example, the 20 letter GUNPOWDERY BLACKSMITH. In this article, I described the search to equal the longest-known three-four- and five-word sets: triosgrams, quadrisograms, and quitisograms.
Key concepts: Computer science