Showing math.COShow all
3 papers · 1 filter
math.CO2026
Letter frequency in shifts of finite type with one forbidden word
Miklós Bóna, Balázs Maga, Jacob Richey
This work considers combinatorial and statistical aspects of {\em{shifts of finite type}}, which are families of words over a finite alphabet which avoid a fixed class of {\emph{fo…
math.CO2026
On the approximation of permutons
Balázs Maga
We study the optimal rectangular-discrepancy approximation of permutons by finite permutations. We transfer bounds from discrepancy theory to this more restricted setup. Moreover,…
math.CO2025
Matroid products via submodular coupling
Kristóf Bérczi, Boglárka Gehér, András Imolay +3
The study of matroid products traces back to the 1970s, when Lovász and Mason studied the existence of various types of matroid products with different strengths. Among these, the…