Join-irreducible Boolean functions

DOI10.1007/s11083-010-9175-zzbMath1204.06008arXiv0903.3848OpenAlexW1981167177MaRDI QIDQ603893

Miguel Couceiro, Moncef Bouaziz, Maurice Pouzet

Publication date: 8 November 2010

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0903.3848

zbMATH Keywords

hypergraphSteiner systemsdesignsBoolean functionminor quasi-ordermonomorphy

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Hypergraphs (05C65) Combinatorics of partially ordered sets (06A07) Boolean functions (06E30)

Related Items (8)

Parametrized arity gap ⋮ Join-irreducible Boolean functions ⋮ Totally symmetric functions are reconstructible from identification minors ⋮ The minor order of homomorphisms via natural dualities ⋮ RECONSTRUCTING MULTISETS OVER COMMUTATIVE GROUPOIDS AND AFFINE FUNCTIONS OVER NONASSOCIATIVE SEMIRINGS ⋮ ADDITIVE DECOMPOSABILITY OF FUNCTIONS OVER ABELIAN GROUPS ⋮ Majors of functions ⋮ CONTENT AND SINGLETONS BRING UNIQUE IDENTIFICATION MINORS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Join-irreducible Boolean functions
• Steiner triple systems with doubly transitive automorphism groups: A corollary to the classification theorem for finite simple groups
• On a quasi-ordering on Boolean functions
• Generalizations of Świerczkowski's lemma and the arity gap of finite functions
• Steiner triple systems with a doubly transitive automorphism group
• Finite linear spaces with flag-transitive groups
• Steiner triple systems with block-transitive automorphism groups
• Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
• Galois theory for minors of finite functions
• On generalized constraints and certificates
• Post classes characterized by functional terms
• Equational characterizations of Boolean function classes
• Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes
• Point determination in graphs
• On closed sets of relational constraints and classes of functions closed under variable substitutions
• ON THE EFFECT OF VARIABLE IDENTIFICATION ON THE ESSENTIAL ARITY OF FUNCTIONS ON FINITE SETS

This page was built for publication: Join-irreducible Boolean functions