Irreducible Boolean Functions

Simple item page
dc.creatorBouaziz, Moncef
dc.creatorCouceiro, Miguel
dc.creatorPouzet, Maurice
dc.date2008-01-18
dc.date.accessioned2026-07-07T08:55:22Z
dc.date.available2026-07-07T08:55:22Z
dc.descriptionThis paper is a contribution to the study of a quasi-order on the set $Ω$ of Boolean functions, the \emph{simple minor} quasi-order. We look at the join-irreducible members of the resulting poset $\tildeΩ$. Using a two-way correspondence between Boolean functions and hypergraphs, join-irreducibility translates into a combinatorial property of hypergraphs. We observe that among Steiner systems, those which yield join-irreducible members of $\tildeΩ$ are the -2-monomorphic Steiner systems. We also describe the graphs which correspond to join-irreducible members of $\tildeΩ$.
dc.description10 pages, ROGICS08,Mahdia 12-15 may 2008
dc.identifierhttps://arxiv.org/abs/0801.2939
dc.identifierhttp://arxiv.org/abs/0801.2939
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/146249
dc.subjectCombinatorics
dc.subject05C75, 05C65, 05B05, 05B07, 06A07, 06E30, 94C10
dc.titleIrreducible Boolean Functions
dc.typetext

Files

Collections

arXiv