3 papers
math.LO2025
Generalized Higman's Theorem and iterated ideals
Fedor Pakhomov, Giovanni SoldÃ
Generalized Higman's Theorem is the direct counterpart of Higman's Theorem that asserts the closure of the class of \emph{better} quasi-orders, instead of the class of \emph{well}…
cs.LG2025
On statistical learning of graphs
Vittorio Cipriani, Valentino Delle Rose, Luca San Mauro +1
We study PAC and online learnability of hypothesis classes formed by copies of a countably infinite graph G, where each copy is induced by permuting G's vertices. This corresponds…
math.LO2024
On Nash-Williams' Theorem regarding sequences with finite range
Fedor Pakhomov, Giovanni SoldÃ
The famous theorem of Higman states that for any well-quasi-order (wqo) the embeddability order on finite sequences over is also wqo. In his celebrated 1965 paper, Nash-Wil…