Some properties of inclusions of multisets and contractive Boolean operators

DOI10.1016/J.DISC.2014.04.008MaRDI QIDQ2017048zbMATHOpenAlexFDO

Authors Pierre Hyvernat

Publication date 25 June 2014

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

preordermultisetBoolean operatorssystem of representativesunordered sections

Mathematics Subject Classification ID

Extremal set theory (05D05)

Abstract: Consider the following curious puzzle: call an n-tuple X=(X_1, ..., X_n) of sets smaller than another n-tuple Y if it has fewer //unordered sections//. We show that equivalence classes for this preorder are very easy to describe and characterize the preorder in terms of the simpler pointwise inclusion and the existence of a special increasing boolean operator f:B^n -> B^n. We also show that contrary to increasing boolean operators, the relevant operators are not finitely generated, which might explain why this preorder is not easy to describe concretely.

Recommendations

• scientific article; zbMATH DE number 1524190
• General relations between partially ordered multisets and their chains and antichains
• On a quasi-ordering on Boolean functions
• Binary relations and algebras on multisets
• Strong closure operators on the set of partial Boolean functions

Cites work

• scientific article; zbMATH DE number 3366846 (Why is no real title available?)
• Computer Science Logic
• Derivatives of Regular Expressions
• On the computation of quotients and factors of regular languages
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
• Towards an algebraic theory of Boolean circuits.
• Transversal theory. An account of some aspects of combinatorial mathematics

This page was built for publication: Some properties of inclusions of multisets and contractive Boolean operators

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