Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 7

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
For a rank-1 matrix $A = a ⊗ b^{t}$ over max algebra, we define the perimeter of A as the number of nonzero entries in both a and b. We characterize the linear operators which preserve the rank and perimeter of rank-1 matrices over max algebra. That is, a linear operator T preserves the rank and perimeter of rank-1 matrices if and only if it has the form T(A) = U ⊗ A ⊗ V, or $T(A) = U ⊗ A^{t} ⊗ V$ with some monomial matrices U and V.
2
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Zero-term rank preservers of integer matrices

100%
EN
The zero-term rank of a matrix is the minimum number of lines (row or columns) needed to cover all the zero entries of the given matrix. We characterize the linear operators that preserve the zero-term rank of the m × n integer matrices. That is, a linear operator T preserves the zero-term rank if and only if it has the form T(A)=P(A ∘ B)Q, where P, Q are permutation matrices and A ∘ B is the Schur product with B whose entries are all nonzero integers.
3
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Maximal column rank preservers of fuzzy matrices

100%
EN
This paper concerns two notions of rank of fuzzy matrices: maximal column rank and column rank. We investigate the difference of them. We also characterize the linear operators which preserve the maximal column rank of fuzzy matrices. That is, a linear operator T preserves maximal column rank if and only if it has the form T(X) = UXV with some invertible fuzzy matrices U and V.
4
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Inf-Hesitant Fuzzy Ideals in BCK/BCI-Algebras

100%
EN
Based on the hesitant fuzzy set theory which is introduced by Torra in the paper [12], the notions of Inf-hesitant fuzzy subalgebras, Inf-hesitant fuzzy ideals and Inf-hesitant fuzzy p-ideals in BCK/BCI-algebras are introduced, and their relations and properties are investigated. Characterizations of an Inf-hesitant fuzzy subalgebras, an Inf-hesitant fuzzy ideals and an Inf-hesitant fuzzy p-ideal are considered. Using the notion of BCK-parts, an Inf-hesitant fuzzy ideal is constructed. Conditions for an Inf-hesitant fuzzy ideal to be an Inf-hesitant fuzzy p-ideal are discussed. Using the notion of Inf-hesitant fuzzy (p-) ideals, a characterization of a p-semisimple BCI-algebra is provided. Extension properties for an Inf-hesitant fuzzy p-ideal is established.
5
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Int-Soft Ideals of Pseudo MV-Algebras

81%
EN
The notion of (implicative) int-soft ideal in a pseudo MV -algebra is introduced, and related properties are investigated. Conditions for a soft set to be an int-soft ideal are provided. Characterizations of (implicative) int-soft ideal are considered. The extension property for implicative int-soft ideal is established.
6
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Length Neutrosophic Subalgebras of BCK=BCI-Algebras

81%
EN
Given i, j, k ∈ {1,2,3,4}, the notion of (i, j, k)-length neutrosophic subalgebras in BCK=BCI-algebras is introduced, and their properties are investigated. Characterizations of length neutrosophic subalgebras are discussed by using level sets of interval neutrosophic sets. Conditions for level sets of interval neutrosophic sets to be subalgebras are provided.
EN
The maximal column rank of an m by n matrix is the maximal number of the columns of A which are linearly independent. We compare the maximal column rank with rank of matrices over a nonbinary Boolean algebra. We also characterize the linear operators which preserve the maximal column ranks of matrices over nonbinary Boolean algebra.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.