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

Перегляд Algebra and Discrete Mathematics за назвою

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

Перегляд Algebra and Discrete Mathematics за назвою

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

  • Russo, F.G. (Algebra and Discrete Mathematics, 2010)
    A subgroup H of a group G is called almost normal in G if it has finitely many conjugates in G. A classic result of B. H. Neumann informs us that |G:Z(G)| is finite if and only if each H is almost normal in G. Starting ...
  • Inankil, H.; Halıcıoglu, S.; Harmanci, A. (Algebra and Discrete Mathematics, 2011)
    Let R be an arbitrary ring with identity and M a right R-module. In this paper, we introduce a class of modules which is an analogous of δ-supplemented modules defined by Kosan. The module M is called principally ...
  • Mikaelian, V.H. (Algebra and Discrete Mathematics, 2014)
    A geometrical construction based on an infinite tree graph is suggested to illustrate the concept of infinite wreath powers of P.Hall. We use techniques based on infinite wreath powers and on this geometrical constriction ...
  • Jones, L.; White, D. (Algebra and Discrete Mathematics, 2015)
    In this article, we show how group actions can be used to examine the set of all covering systems of the integers with a fixed set of distinct moduli.
  • Kaniecki, M.; Kosakowska, J.; Malicki, P.; Marczak, G. (Algebra and Discrete Mathematics, 2016)
  • Varbanets, P.D.; Savastru, O.V. (Algebra and Discrete Mathematics, 2005)
  • Автор відсутній (Algebra and Discrete Mathematics, 2016)
    With deep sorrow and regret we learnt about the death on December 22, 2015 of our colleague, Alfred Lvovich Shmelkin, a prominent algebraist, Honoured Professor of Lomonosov Moscow State University and member of ADM editorial ...
  • Sköldberg, E. (Algebra and Discrete Mathematics, 2018)
    We show that the main result of algebraic Morse theory can be obtained as a consequence of the perturbation lemma of Brown and Gugenheim.
  • Banakh, T.; Gavrylkiv, V. (Algebra and Discrete Mathematics, 2008)
    Given a countable group X we study the algebraic structure of its superextension λ(X). This is a right-topological semigroup consisting of all maximal linked systems on X endowed with the operation A∘B={C⊂X:{x ...
  • Banakh, T.T.; Gavrylkiv, V.; Nykyforchyn, O. (Algebra and Discrete Mathematics, 2008)
    Given a group X we study the algebraic structure of its superextension λ(X). This is a right-topological semigroup consisting of all maximal linked systems on X endowed with the operation A∘B={C⊂X:{x∈X:x−1C∈B}∈A} ...
  • Banakh, T.; Gavrylkiv, V. (Algebra and Discrete Mathematics, 2012)
    We find necessary and sufficient conditions on an (inverse) semigroup X under which its semigroups of maximal linked systems λ(X), filters φ(X), linked upfamilies N₂(X), and upfamilies υ(X) are inverse.
  • 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 ...
  • Protasov, I.V. (Algebra and Discrete Mathematics, 2009)
    For every discrete group G, the Stone-Čech compactification βG of G has a natural structure of compact right topological semigroup. Assume that G is endowed with some left invariant topology I and let τ¯ be the set of all ...
  • Nikitchenko, M.; Shkilniak, S. (Algebra and Discrete Mathematics, 2017)
    In the paper we investigate algebras and logics defined for classes of partial quasiary predicates. Informally speaking, such predicates are partial predicates defined over partial states (partial assignments) of variables. ...
  • Gasiorek, M.; Simson, D.; Zajac, K. (Algebra and Discrete Mathematics, 2014)
    We present symbolic and numerical algorithms for a computer search in the Coxeter spectral classification problems. One of the main aims of the paper is to study finite posets I that are principal, i.e., the rational ...
  • Polak, A.; Simson, D. (Algebra and Discrete Mathematics, 2013)
    We present combinatorial algorithms constructing loop-free P-critical edge-bipartite (signed) graphs Δ′, with n ≥ 3 vertices, from pairs (Δ, w), with Δ a positive edge-bipartite graph having n-1 vertices and w a sincere ...
  • 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.
  • Boykett, T. (Algebra and Discrete Mathematics, 2009)
    Planar nearrings have been used to define classes of 2-designs since Ferrero's work in 1970. These 2-designs are a class of difference families. Recent work from Pianta has generalised Ferrero and Clay's work with planar ...
  • Avdeeva, T.; Ganyushkin, O. (Algebra and Discrete Mathematics, 2003)
    A lower estimate for the number Mn of all labelled quivers with n–vertex parts of Artinian biserial rings is given and the asymptotic of the relation Mn/Bn, where Bn denotes the number of those quivers all connected ...
  • Bekh-Ochir, C.; Rankin, S.A. (Algebra and Discrete Mathematics, 2013)
    In earlier work, we have established that for any finite field k, the free associative k-algebra on one generator x, denoted by k[x]₀, has infinitely many maximal T-spaces, but exactly two maximal T-ideals (each of which ...

Пошук


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

Перегляд

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