Статті
http://hdl.handle.net/123456789/418
Tue, 30 May 2023 20:44:13 GMT2023-05-30T20:44:13ZTernary Hopf algebras
http://hdl.handle.net/123456789/426
Ternary Hopf algebras
Zekoviс, Biljana
In this paper we introduce the notion of a ternary Hopf algebra and prove that it can be embedded into a universal enveloping Hopf algebra.
Ternary Hopf algebras / Biljana Zekoviс // Algebra and Discrete Mathematics. - 2005. - № 3. - 96-106.
Sat, 01 Jan 2005 00:00:00 GMThttp://hdl.handle.net/123456789/4262005-01-01T00:00:00ZA note on c-normal subgroups of finite groups
http://hdl.handle.net/123456789/425
A note on c-normal subgroups of finite groups
Skiba, Alexander N.
Let G be a finite group. We fix in every noncyclic Sylow subgroup P of G some its subgroup D satisfying 1 <|D| < |P| and study the structure of G under assumption that all
subgroups H of P with |H| = |D| are c-normal in G.
A note on c-normal subgroups of finite groups / Alexander N. Skiba // Algebra and Discrete Mathematics. - 2005. - № 3. - 85-95.
Sat, 01 Jan 2005 00:00:00 GMThttp://hdl.handle.net/123456789/4252005-01-01T00:00:00ZTwo-generated graded algebras
http://hdl.handle.net/123456789/424
Two-generated graded algebras
Shirikov, Evgenij N.
The paper is devoted to classification of two-generated graded algebras. We show that under some general assumptions there exist two classes of these algebras, namely quantum polynomials and Jordanian plane. We study prime spectrum, the semigroup of endomorphisms and the Lie algebra of derivations of Jordanian plane.
Two-generated graded algebras / Evgenij N. Shirikov // Algebra and Discrete Mathematics. - 2005. - № 3. - 60-84.
Sat, 01 Jan 2005 00:00:00 GMThttp://hdl.handle.net/123456789/4242005-01-01T00:00:00ZOn square-Hamiltonian graphs
http://hdl.handle.net/123456789/423
On square-Hamiltonian graphs
Protasova, K. D.
A finite connected graph G is called square-Hamiltonian if G2 is Hamiltonian. We prove that any join of the family of Hamiltonian graphs by tree is square-Hamiltonian.
Applying this statement we show that the line graph and any round-about reconstruction of an arbitrary finite connected graph is square-Hamiltonian.
On square-Hamiltonian graphs / K. D. Protasova // Algebra and Discrete Mathematics. - 2005. - № 3. - 56-59.
Sat, 01 Jan 2005 00:00:00 GMThttp://hdl.handle.net/123456789/4232005-01-01T00:00:00Z