128 citations · 137 across the 17 of their papers we have counts for
24 papers
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…
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,…
Exact formula on upper box dimension of generic Hölder level sets
Zoltán Buczolich, Balázs Maga
In the previous decades, the size of level sets of functions have been extensively studied in various setups involving different regularity properties and size notions. In the case…
Level sets of prevalent Weierstrass functions
Zoltán Buczolich, Antti Käenmäki, Balázs Maga
The -Weierstrass function is defined as , where is a Lipschitz function on the unit circle. For a prevalent -Weierstr…
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…
Better estimates of Hölder thickness of fractals
Zoltán Buczolich, Balázs Maga, Gáspár Vértesy
Dimensions of level sets of generic continuous functions and generic Hölder functions defined on a fractal encode information about the geometry, ``the thickness" of . While…