4 papers
A Census of New Snake-in-the-Box Records
Paul Orland, Lucas Fagan, Michele Tarquini +7
The snake-in-the-box problem, introduced by Kautz in 1958, asks for the longest induced (chordless) path, called a snake, in the hypercube graph . The maximum length is…
The Two-Hump Problem: Bridging the Difficulty Gap in Mathematical Reinforcement Learning
Lucas Fagan, Michele Tarquini, Ali Shehper +6
Mathematical search problems present a unique challenge for Reinforcement Learning (RL) due to vast search spaces and sparse rewards. In previous works, the Andrews-Curtis (AC) con…
Representation theory of non-factorizable ribbon Hopf algebras
Maksymilian Manko
In arXiv:2503.19532 new examples of ribbon Hopf algebras based on the construction due to Nenciu were presented. This piece serves as a sequel where we study the representation the…
Non-factorizable ribbon Hopf Algebras
Quentin Faes, Maksymilian Manko
Building on the work of Nenciu we provide examples of non-factorizable ribbon Hopf algebras, and introduce a stronger notion of non-factorizability. These algebras are designed to…