-
Notifications
You must be signed in to change notification settings - Fork 64
Open
Labels
difficulty: 2A label for feature requests of medium difficultyA label for feature requests of medium difficultyfeature-requestA label for feature requestsA label for feature requests
Description
An interesting recent result from Don Knuth, an old exercise he wrote finally having been solved with the assistance of the Claude AI engine.
https://www-cs-faculty.stanford.edu/~knuth/papers/claude-cycles.pdf
Some of the proof seems hard, but I think the actual constructions (of the graph and the decomposition) are pretty easy. Maybe it'd be nice to have them.
Not sure of an appropriate name for either concept. Claude–Knuth cycles?
Reactions are currently unavailable
Metadata
Metadata
Assignees
Labels
difficulty: 2A label for feature requests of medium difficultyA label for feature requests of medium difficultyfeature-requestA label for feature requestsA label for feature requests
Type
Projects
Status
Unassigned