Showing math.COShow all
2 papers · 1 filter
math.CO2025
Simple games with minimum
Sascha Kurz, Dani Samaniego
Every simple game is a monotone Boolean function. For the other direction we just have to exclude the two constant functions. The enumeration of monotone Boolean functions with dis…
math.CO2021
The full rank condition for sparse random matrices
Amin Coja-Oghlan, Pu Gao, Max Hahn-Klimroth +3
We derive a sufficient condition for a sparse random matrix with given numbers of non-zero entries in the rows and columns having full row rank. The result covers both matrices ove…