Skip to main content
MathDB
Sign in
Home
News
Database
Forum
Paper
Tags
Graph
People
Badges
Notifications
Chats
Bookmarks
About
Discord
Feature request
Report a bug
1 problem
Trending
Newest
Featured
Likes
Filters
1
Post Problem
Matching
Tag: cutting-distance
Cutting-distance conjecture for even k-ary words
About 1 year old
Cutting-distance conjecture. For each
k
⩾
2
k\geqslant2
k
⩾
2
, every even
k
k
k
-ary word
W
W
W
satisfies