On Boolean Functions Defined on Bracket Sequences

Abstract

In the paper [B. Bakos, N. Hegyv´ari, M. P´alfy, X. H. Yan, Discrete Math. Lett. 4 (2020) 31–36], the authors introduced the so-called pseudo-recursive sequences which generalize bracket sequences. In the present article, Boolean functions are defined on hypergraphs with edges having big intersections induced by bracket sequences and hypergraphs that are thinly intersecting. These Boolean functions related to combinatorial number theory are new in this area.