Exact computer-assisted proof of bounded positivity for stretched Littlewood-Richardson polynomials
-
Updated
Sep 4, 2026 - Python
Exact computer-assisted proof of bounded positivity for stretched Littlewood-Richardson polynomials
Web pages for FPSAC
This is the website of a directed study project about Lorentzian polynomials.
RIME: spectral, transport, accessibility, and observable-pipeline geometry for finite represented systems, with Rubik as a reproducible laboratory.
Exact enumeration and complete Lean 4 kernel-only formalization for ballot-admissible Fibonacci ribbon tableaux
Counting k-bounded functions on [n]
Cores and endomorphisms of the merged Johnson graph family J(2k+1,k) with relations 2 through k-2
Conway 99-graph research: an exact modular completion criterion for strongly regular graph lifts with free order-three symmetry. Unreviewed, AI-assisted; proof and reproducible checks.
My mathematics research page
Exact counterexamples to a Lorentzianity conjecture for border-strip E-polynomials
A 12-vertex counterexample to Stanley’s claw-free Schur-positivity conjecture
To associate your repository with the algebraic-combinatorics topic, visit your repo's landing page and select "manage topics."