3 papers
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
Boolean--Eulerian numbers
Miklós Bóna, Vincent Vatter
We study decreasing binary trees in which every vertex with two children is colored red or blue. We construct two bijections. The first, to ordered set partitions into odd-sized bl…
math.CO2025
A combinatorial proof of a symmetry for a refinement of the Narayana numbers
Miklós Bóna, Stoyan Dimitrov, Gilbert Labelle +4
We establish a tantalizing symmetry of certain numbers refining the Narayana numbers. In terms of Dyck paths, this symmetry is interpreted in the following way: if is t…