This paper continues the investigation of the rst author begun in part one. The hereditary properties of n-homomorphism amenability for Banach algebras are investigated and the relations between n-homomorphism amenability of a Banach algebra and its ideals are found. Analogous to the character amenability, it is shown that the tensor product of two unital Banach algebras is n-homomorphism amena...

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...

We prove that any IN-rational sequence s = (sn) n1 of non-negative integers satisfying the Kraft strict inequality P n1 snk ?n < 1 is the enumerative sequence of leaves by height of a rational k-ary tree. Particular cases of this result had been previously proven. We give some partial results in the equality case.

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...

In this paper we compute the number of reduced decompositions of certain permutations ∈ Sn as a product of transpositions (1; 2), (1; 3), : : :, (1; n). We present several combinatorial correspondences between these decompositions and combinatorial objects such as Catalan paths and k-ary trees. c © 1999 Elsevier Science B.V. All rights reserved

fuzzy rough n-ary subhypergroups are introduced and characterized.