Let L → H be a lattice homomorphism and let a “readable” drawing of H be given. It is natural to make use of it to try getting a clear(er) drawing of L. Hence, the following question is explored: How the knowledge of the congruence lattice Con(L) of L can help in getting “better” drawings of L? This will be done by proposing rank shelling procedures of (M(Con(L),≤) and will be illustrated with ...

Let α ∈ (0, 1), l ≥ 2 and let Hn be an l-graph on n vertices. Hn is (α, ξ)-uniform if every ξn vertices of Hn span (α± ξ) ( ξn l ) edges. Our main result is the following. For all δ̃, there exist δ, r, n0 such that, if n > n0 and H n is (α, δ)-uniform, then all but exp{−r/20} ( n r ) r-sets of vertices induce a subhypergraph that is (α, δ̃)-uniform. We also present the following application. Let ...

in this paper, we characterize multiresolution analysis(mra) parseval frame multiwavelets in l^2(r^d) with matrix dilations of the form (d f )(x) = sqrt{2}f (ax), where a is an arbitrary expanding dtimes d matrix with integer coefficients, such that |deta| =2. we study a class of generalized low pass matrix filters that allow us to define (and construct) the subclass of mra tight frame multiwav...

In the group of (continuous) Jordan automorphisms, with the uniform topology, on a semisimple Banach algebra, we show that the connected component of the identity consists of automorphisms. P. Civin and B. Yood have shown that a Jordan homomorphism (that is, a homomorphism that preserves the product xoy = | (xy+yx)) from a Banach algebra onto a semisimple Banach algebra is continuous provided t...

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 state two conjectures: k 2 (1) if k is an infinite cardinal number and cardtAt<t2 then there exists a relation RtctAtKtA which satisfies x,ytetA {x}tctA(x)tctA f:A(x)-----LA ttttAt Et At f is not a homomorphism of R, x$y cardtA(x)t<tk f(x)=y a sup{2t:aeCard,a<k} (2) if k$0 is a limit cardinal number and cardtAt<t2 then there exists a relation RtctAtKtA which satisfies x,ytetA {x}tctA(x)tctA ...