Recall that a continuous function $fcolon Xto Y$ between Tychonoff spaces is proper if and only if the Stone extension $f^{beta}colon beta Xtobeta Y$ takes remainder to remainder, in the sense that $f^{beta}[beta X-X]subseteq beta Y-Y$. We introduce the notion of ``taking remainder to remainder" to frames, and, using it, we define a frame homomorphism $hcolon Lto M$ to be $beta$-proper, $lambd...

This paper shows the best operators for sumof-products expressions. We first describe conditions of functions for product and sum operations. We examine all two-variable functions and select those that meet the conditions and then evaluate the number of product terms needed in the minimum sum-of-products expressions when each combination of selected product and sum functions is used. As a resul...

it is firstly proved that the multi-input-single-output (miso) fuzzy systems based on interval-valued $r$- and $s$-implications can approximate any continuous function defined on a compact set to arbitrary accuracy.  a formula to compute the lower upper bounds on the number  of interval-valued fuzzy sets needed to achieve a pre-specified approximation  accuracy for an arbitrary multivariate con...

Constraint Satisfaction Problem (CSP) is a fundamental algorithmic problem that appears in many areas of Computer Science. It can be equivalently stated as computing a homomorphism R → Γ between two relational structures, e.g. between two directed graphs. Analyzing its complexity has been a prominent research direction, especially for the fixed template CSPs where the right side Γ is fixed and ...

In this talk we will discuss some examples of graph homomorphisms. More precisely, the graph parameters which can be represented by counting the graph homomorphisms. The main reference is Section 2 in [2].

For a graph G, let     max : is an edge cut of b G D D G  . For graphs G and H, a map     :V G V H   is a graph homomorphism if for each   e uv E G   ,       u v E H    . In 1979, Erdös proved by probabilistic methods that for p ≥ 2 with

A graph homomorphism is a vertex map which carries edges from a source graph to edgesin a target graph. The instances of the Weighted Maximum H-Colourable Subgraph problem(MAX H -COL) are edge-weighted graphs G and the objective is to find a subgraph of G that hasmaximal total edge weight, under the condition that the subgraph has a homomorphism to H ;note that for H = Kk th...

We present several examples of feebly compact Hausdorff paratopological groups (i.e., groups with continuous multiplication) which provide answers to a number of questions posed in the literature. It turns out that a 2-pseudocompact, feebly compact Hausdorff paratopological group G can fail to be a topological group. Our group G has the Baire property, is Fréchet–Urysohn, but it is not precompa...