Because of the associativity of fusion products ⊠, the above hypothesis is equivalent to the condition that for each irreducible module W , there is an irreducible module W̃ such that HomV (W̃ ⊠ W,V ) 6= 0. In the previous paper [6], we have introduced a concept of ”Semi-Rigidity” and then proved that if W is semi-rigid, then W is flat for the fusion products ⊠, that is, 0 → W ⊠ A → W ⊠ B → W ⊠ C...

The rst systematic treatment of weighted extended tree transducers (wxtt) over countably complete semirings is provided. It is proved that the extension in the left-hand sides of a wxtt can be simulated by the inverse of a linear and nondeleting tree homomorphism. In addition, a characterization of weighted tree transformations computed by bottomup wxtt in terms of bimorphisms is provided. Back...

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

A q-ary maximum distance separable (MDS) code C with length n, dimension k over an alphabet A of size q is a set of qk codewords that are elements of An, such that the Hamming distance between two distinct codewords in C is at least n− k+1. Sets of mutually orthogonal Latin squares of orders q ≤ 9, corresponding to two-dimensional q-ary MDS codes, and q-ary one-error-correcting MDS codes for q ...

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