106 citations · 239 across the 67 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2026
On Occurrence-Preserving Morphisms
Kaisei Kishi, Peaker Guo, Cristian Urbina +1
A \emph{morphism} is a mapping that transforms words through letter-wise substitution, where each symbol is consistently replaced by a fixed word. In the field of combinatorics on…
math.CO2021
Combinatorics of minimal absent words for a sliding window
Tooru Akagi, Yuki Kuhara, Takuya Mieno +4
A string is called a minimal absent word (MAW) for another string if does not occur in but the proper substrings of occur in . For example, let $Σ= \{\mathtt…
math.CO2013
On the existence of tight relative 2-designs on binary Hamming association schemes
Eiichi Bannai, Etsuko Bannai, Hideo Bannai
It is known that there is a close analogy between "Euclidean t-designs vs. spherical t-designs" and "Relative t-designs in binary Hamming association schemes vs. combinatorial t-de…