Наукова електронна бібліотека
періодичних видань НАН України

Перегляд Algebra and Discrete Mathematics, 2012, Vol. 13, № 1 за датою випуску

Репозиторій DSpace/Manakin

Перегляд Algebra and Discrete Mathematics, 2012, Vol. 13, № 1 за датою випуску

Сортувати за: Порядок: Результатів:

  • Автор відсутній (Algebra and Discrete Mathematics, 2012)
    In the spring of 2012, the 70th birthday of Dmitriy I. Zaitsev (1942-1990) will come. D.I Zaitsev did not live two years to his 50th birthday, but his life in mathematics will be long. His main interests were very wide; ...
  • Raievska, I.Yu.; Sysak, Ya.P. (Algebra and Discrete Mathematics, 2012)
    In this paper the metacyclic Miller-Moreno p-groups which appear as the additive groups of finite local nearrings are classified.
  • Protasov, I. (Algebra and Discrete Mathematics, 2012)
    A subset A of a group G is called sparse if, for every infinite subset X of G, there exists a finite subset F ⊂ X, such that ∩x∈FxA is finite. We denote by η(G) the minimal cardinal such that G can be partitioned in η(G) ...
  • Kurdachenko, L.A.; Grin, K.O.; Turbay, N.A. (Algebra and Discrete Mathematics, 2012)
    In an arbitrary fuzzy group we construct the upper central series and consider some its properties. In particular, the characterization of nilpotent fuzzy group has been obtained.
  • Kirichenko, V.V.; Kurdachenko, L.A.; Otal, J.; Subbotin, I.Ya. (Algebra and Discrete Mathematics, 2012)
    We survey the most outstanding contributions due to D.I. Zaitsev in the Theory of Infinite Groups.
  • Santhakumaran, A.P.; Athisayanathan, S. (Algebra and Discrete Mathematics, 2012)
    For two vertices u and v in a graph G = (V, E), the detour distance D(u, v) is the length of a longest u-v path in G. A u-v path of length D(u, v) is called a u-v detour. For subsets A and B of V, the detour distance D(A, ...
  • Ghasemi, M. (Algebra and Discrete Mathematics, 2012)
    A Cayley graph X = Cay(G, S) is called normal for G if the right regular representation R(G) of G is normal in the full automorphism group Aut(X) of X. In the present paper it is proved that all connected tetravalent Cayley ...
  • Dudchenko, I.; Plakhotnyk, M. (Algebra and Discrete Mathematics, 2012)
    An algorithm of sorting of all simply laced graph such that subalgorithm of checking of that the graph is connected is of linear dependence on the number of vertices of the graph.
  • Banakh, T.; Gavrylkiv, V. (Algebra and Discrete Mathematics, 2012)
    Given a semilattice X we study the algebraic properties of the semigroup υ(X) of upfamilies on X. The semigroup υ(X) contains the Stone-ˇCech extension β(X), the superextension λ(X), and the space of filters φ(X) on X as ...
  • Al-Sharo, Kh.A.; Shemetkova, O.; Xiaolan Yi (Algebra and Discrete Mathematics, 2012)
    Let G be a finite group. A subgroup A is called:1) S-quasinormal in G if A is permutable with all Sylow subgroups in G 2) S-quasinormally embedded in G if every Sylow subgroup of A is a Sylow subgroup of some S-quasinormal ...
  • Albuquerque, H.; Panaite, F. (Algebra and Discrete Mathematics, 2012)
    We study some (Hopf) algebraic properties of circulant matrices, inspired by the fact that the algebra of circulant n × n matrices is isomorphic to the group algebra of the cyclic group with n elements. We introduce ...

Пошук


Розширений пошук

Перегляд

Мій обліковий запис