Skip to content

Claude–Knuth cycles #908

@mtorpey

Description

@mtorpey

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?

Metadata

Metadata

Assignees

No one assigned

    Labels

    difficulty: 2A label for feature requests of medium difficultyfeature-requestA label for feature requests

    Type

    No type

    Projects

    Status

    Unassigned

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions