Digital Repository of Luhansk Taras Shevchenko National University

Browsing Algebra and Discrete Mathematics. - № 2 (27). - 2019 by Title

Browsing Algebra and Discrete Mathematics. - № 2 (27). - 2019 by Title

Sort by: Order: Results:

  • Castro, F .; Quadros, G . (ДЗ "ЛНУ імені Тараса Шевченка", 2019)
    In this paper, we introduce the notion of globalization for partial module coalgebra and for partial comodule coalgebra. We show that every partial module coalgebra is globalizable exhibiting a standard globalization. We ...
  • Bhat, M. A.; Naikoo, T. A.; Pirzada, S. (ДЗ "ЛНУ імені Тараса Шевченка", 2019)
    The set of distinct eigenvalues of a signed digraph S together with their respective multiplicities is called its spectrum. Two signed digraphs of same order are said to be cospectral if they have the same spectrum. In ...
  • Yashchuk, V . S . (2019)
    The first step in the study of all types of algebras is the description of such algebras having small dimensions. The structure of 3-dimensional Leibniz algebras is more complicated than 1 and 2-dimensional cases. In this ...
  • Jahanbakhsh, N .; Nikandish, R.; Nikmehr, M. J . (2019)
    Let (P, 6) be an atomic partially ordered set (poset, briefly) with a minimum element 0 and I(P) the set of nontrivial ideals of P. The inclusion ideal graph of P, denoted by Ω(P), is an undirected and simple graph with ...
  • Fotue -Tabue, A .; Mouaha, C. (2019)
    In this paper, R is a finite chain ring of invariants (q, s), and l is a positive integer fulfilling gcd(l, q) = 1. In the language of q-cyclotomic cosets modulo l, the cyclic codes over R of length l are uniquely decomposed ...
  • Dzhaliuk, N.S .; Petrychkovych, V.M . (ДЗ "ЛНУ імені Тараса Шевченка", 2019)
    We investigate the row and column structure of solutions of the matrix polynomial equation A(λ)X(λ) + Y (λ)B(λ) = C(λ), where A(λ), B(λ) and C(λ) are the matrices over the ring of poly- nomials F[λ] with coefficients ...
  • Bondarenko, V.; Styopochkina, M. (2019)
    Using (introduced by the first author) the method of (min, max)-equivalence, we classify all serial principal posets, i.e. the posets S satisfying the following conditions: (1) the quadratic Tits form qS(z) : Z |S|+1 ...

Search DSpace


Advanced Search

Browse

My Account