the aim of this paper is to introduce and study set- valued homomorphism on lattices and t-rough lattice with respect to a sublattice. this paper deals with t-rough set approach on the lattice theory. the result of this study contributes to, t-rough fuzzy set and approximation theory and proved in several papers. keywords: approximation space; lattice; prime ideal; rough ideal; t-rough set; set...

Let $\Gamma$ be a group and $\mathscr{C}$ class of groups endowed with bi-invariant metrics. We say that is $\mathscr{C}$-stable if every $\varepsilon$-homomorphism $\Gamma \rightarrow G$, $(G,d) \in \mathscr{C}$, $\delta_\varepsilon$-close to homomorphism, $\delta_\varepsilon\to 0$ when $\varepsilon\to 0$. If $\delta_\varepsilon < C \varepsilon$ for some $C$ we $ \mathscr{C} $-stable linear ra...

For digraphs D and H, a mapping f : V (D)→V (H) is a homomorphism of D to H if uv ∈ A(D) implies f(u)f(v) ∈ A(H). Let H be a fixed directed or undirected graph. The homomorphism problem for H asks whether a directed or undirected graph input digraph D admits a homomorphism to H. The list homomorphism problem for H is a generalization of the homomorphism problem for H, where every vertex x ∈ V (...

For a given pair of maps f, g : X → M from an arbitrary topological space to an n-manifold, the Lefschetz homomorphism is a certain graded homomorphism Λfg : H(X) → H(M) of degree (−n). We prove a Lefschetztype coincidence theorem: if the Lefschetz homomorphism is nontrivial then there is an x ∈ X such that f(x) = g(x).

We survey known results about the complexity of surjective homomorphism problems, studied in the context of related problems in the literature such as list homomorphism, retraction and compaction. In comparison with these problems, surjective homomorphism problems seem to be harder to classify and we examine especially three concrete problems that have arisen from the literature, two of which r...