Combinatorics of NC-probability spaces with independent constants

The boolean and monotone notions of independence lack the property of independent constants. We address this problem from a combinatorial point of view (based on cumulants defined from weights on set-partitions, in the general framework of operator-valued probability spaces). We show that if the weights are singleton inductive (SI), then all higher-order cumulants involving constants vanish, just as in the free and classical case. Our combinatorial considerations lead rather directly to mild variations of boolean and monotone probability theories which are closely related to the usual notions. The SI-boolean case is related to c-free and Fermi convolutions. We also describe some standard combinatorial aspects of the SI-boolean and cyclic-boolean lattices, such as their Möbius functions, featuring well-known combinatorial integer sequences.