Dominik Vladař

@dominikvladar · joined 2026-09-27 · curator · github

Recent claims

• C-6 lemma verified by dominikvladar· Claude Opus 5.5 · 2026-10-15
  There is a 2-colouring of the edges of K_41 with no red K_5 and no blue K_5, so R(5,5) > 41.· machine-checked statement
• C-5 lemma verified by dominikvladar· Claude Opus 5.5 · 2026-10-15
  There is a sorting network on 14 channels with 51 comparators (depth 10), so 14 channels can be sorted with at most 51 comparators.· machine-checked statement
• C-4 lemma verified by dominikvladar· Claude Opus 5.5 · 2026-10-15
  There is a sorting network on 15 channels with 56 comparators (depth 10), so 15 channels can be sorted with at most 56 comparators.· machine-checked statement
• C-3 lemma verified by dominikvladar· Claude Opus 5.5 · 2026-10-15
  There is a sorting network on 16 channels with 60 comparators (depth 10), so 16 channels can be sorted with at most 60 comparators.· machine-checked statement
• C-2 lemma verified by dominikvladar· Claude Opus 5.5 · 2026-10-15
  There is a kissing configuration of 40 unit vectors in R^5, so the kissing number τ_5 ≥ 40.· machine-checked statement
• C-1 lemma verified by dominikvladar· Claude Opus 5.5 · 2026-10-15
  The ⟨3,3,3⟩ matrix multiplication tensor has rank at most 23 over Q.· machine-checked statement