The Number of Values of a Boolean Function

DOI10.1112/JLMS/S2-12.2.225MaRDI QIDQ4099633zbMATH OpenOpenAlexFDO

Authors David E. Daykin, László Lovász

Publication date 1976

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/jlms/s2-12.2.225

Mathematics Subject Classification ID

Logical aspects of Boolean algebras (03G05) Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Cited in

(13)

• An intersection-union theorem for integer sequences
• Inequalities involving maps of finite sets
• On maximal families of subsets of a finite set
• A Marica-Schoenheim theorem for an infinite sequence of finite sets
• Old and new applications of Katona's circle
• Perfect matchings in down-sets
• Some intersection and union theorems for several families of finite sets
• The maximum size of intersecting and union families of sets
• Two results on set families: sturdiness and intersection
• Intersection-union families
• Intersection problems and a correlation inequality for integer sequences
• Invitation to intersection problems for finite sets
• Matrices and set differences

This page was built for publication: The Number of Values of a Boolean Function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4099633)