Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10081051" target="_blank" >RIV/00216208:11320/10:10081051 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms

Original language description

Each clone C on a fixed base set A induces a quasi-order on the set of all operations on A by the following rule f is a e-minor of g if f can be obtained by substituting operations from e for the variables of g. By making use of a representation of Boolean functions by hypergraphs and hypergraph homomorphisms, it is shown that a clone C on {0, 1} has the property that the corresponding C-minor partial order is universal if and only if C is one of the countably many clones of clique functions or the clone of self-dual monotone functions. Furthermore, the C.-minor partial orders are dense when C is a clone of clique functions.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2010

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

European Journal of Combinatorics

ISSN

0195-6698

e-ISSN

—

Volume of the periodical

31

Issue of the periodical within the volume

8

Country of publishing house

US - UNITED STATES

Number of pages

15

Pages from-to

—

UT code for WoS article

000282674700004

EID of the result in the Scopus database

—