Research
Two supervised internships, one in computer algebra and one in industrial economics, and the toolkit the first of them grew into. Both are published in full, including the parts that did not work.
LJK · May to July 2024
Rank of bilinear maps
Supervised by Jean-Guillaume Dumas. A greedy descent that cuts a polynomial product from 25 multiplications to 14, and the finding that its expensive step buys almost nothing.
Independent · C++20, MIT, v0.4.1
tensor-rank-toolkit
Both costs of a fast algorithm, each settled exactly. F2 5×5 polynomial multiplication proved to be rank 13, and 221 nonzero entries brought to a proved minimum of 128.
GAEL · January to April 2025
AI and strategic pricing
Supervised by Alexis Garapin and Olivier Bonroy. A survey of three papers, a model of imitation, and the Prolog course project entered alongside it.