Zobrazeno 1 - 10
of 53
pro vyhledávání: '"Agustín Moreno Cañadas"'
Publikováno v:
Symmetry, Vol 16, Iss 5, p 570 (2024)
Cayley and nilpotent graphs arise from the interaction between graph theory and algebra and are used to visualize the structures of some algebraic objects as groups and commutative rings. On the other hand, Green and Schroll introduced Brauer graph a
Externí odkaz:
https://doaj.org/article/2c414d25d71c4ecfa85fb4e77f3ff5f5
Publikováno v:
Electronic Research Archive, Vol 30, Iss 9, Pp 3435-3451 (2022)
Zavadskij modules are uniserial tame modules. They arose from interactions between the poset representation theory and the classification of general orders. The main problem is to characterize Zavadskij modules over a finite-dimensional algebra $ A $
Externí odkaz:
https://doaj.org/article/02d0341d539d4779bd5c5959cb9ec721
Publikováno v:
Electronic Research Archive, Vol 30, Iss 8, Pp 3087-3110 (2022)
Recently, Çanakçi and Schroll proved that associated with a string module M(w) there is an appropriated snake graph G. They established a bijection between the corresponding perfect matching lattice L(G) of G and the canonical submodule lattice L(M
Externí odkaz:
https://doaj.org/article/57ec9df4cdd447ee92388c974f1e12b1
Publikováno v:
Electronic Research Archive, Vol 30, Iss 2, Pp 661-682 (2022)
Bijections between invariants associated with indecomposable projective modules over some suitable Brauer configuration algebras and invariants associated with solutions of the Kronecker problem are used to categorify integer sequences in the sense o
Externí odkaz:
https://doaj.org/article/a117aa85a18c43f79c7030baf90e4661
Publikováno v:
Computation, Vol 11, Iss 7, p 140 (2023)
Since its introduction, researching malware has had two main goals. On the one hand, malware writers have been focused on developing software that can cause more damage to a targeted host for as long as possible. On the other hand, malware analysts h
Externí odkaz:
https://doaj.org/article/246dd9bf8ed049a5a42ea5f507337572
Publikováno v:
Computation, Vol 11, Iss 5, p 94 (2023)
The open shop scheduling problem (OSSP) is one of the standard scheduling problems. It consists of scheduling jobs associated with a finite set of tasks developed by different machines. In this case, each machine processes at most one operation at a
Externí odkaz:
https://doaj.org/article/5349b84112934c24a0a1514fc2205740
Publikováno v:
Mathematics, Vol 11, Iss 8, p 1961 (2023)
Seaweeds or seaweed Lie algebras are subalgebras of the full-matrix algebra Mat(n) introduced by Dergachev and Kirillov to give an example of algebras for which it is possible to compute the Dixmier index via combinatorial methods. It is worth noting
Externí odkaz:
https://doaj.org/article/b5ea76e3c0cd42b7be473b8e802e6886
Publikováno v:
Computation, Vol 11, Iss 3, p 43 (2023)
The Kronecker algebra K is the path algebra induced by the quiver with two parallel arrows, one source and one sink (i.e., a quiver with two vertices and two arrows going in the same direction). Modules over K are said to be Kronecker modules. The cl
Externí odkaz:
https://doaj.org/article/f9f256173f44485494fd4024d1e1ecdc
Publikováno v:
Computation, Vol 11, Iss 1, p 2 (2022)
Currently, researching the Yang–Baxter equation (YBE) is a subject of great interest among scientists of diverse areas in mathematics and other sciences. One of the fundamental open problems is to find all of its solutions. The investigation deals
Externí odkaz:
https://doaj.org/article/cdc281dedc594b7d8ecd61d0bb41b750
Autor:
María Alejandra Osorio Angarita, Agustín Moreno Cañadas, Cristian Camilo Fúneme, Odette M. Mendez, Robinson-Julian Serna
Publikováno v:
Computation, Vol 10, Iss 9, p 164 (2022)
Cayley hash values are defined by paths of some oriented graphs (quivers) called Cayley graphs, whose vertices and arrows are given by elements of a group H. On the other hand, Brauer messages are obtained by concatenating words associated with multi
Externí odkaz:
https://doaj.org/article/96e3f66e9fc742319ae97fd11a442e5f