ISSN 1683-3414 (Print)   •   ISSN 1814-0807 (Online)
   Log in
 

Contacts

Address: Vatutina st. 53, Vladikavkaz,
362025, RNO-A, Russia
Phone: (8672)23-00-54
E-mail: rio@smath.ru

 

 

 

Яндекс.Метрика

DOI: 10.23671/VNC.2017.1.5818

Cyclical Elementary Nets

Dzhusoeva, N. A. , Dryaeva R. Y.
Vladikavkaz Mathematical Journal 2017. Vol. 19. Issue 1.
Abstract:
Let \(R\) be a commutative ring with the unit and \(n\in\Bbb{N}\). A set \(\sigma = (\sigma_{ij})\), \(1\leq{i, j} \leq{n},\) of additive subgroups of the ring \(R\) is a net over \(R\) of order \(n\), if \( \sigma_{ir} \sigma_{rj} \subseteq{\sigma_{ij}} \) for all \(1\leq i, r, j\leq n\). A net which doesn't contain the diagonal is called  an elementary net. An elementary net \(\sigma = (\sigma_{ij}), 1\leq{i\neq{j} \leq{n}}\), is complemented, if for some additive subgroups \(\sigma_{ii}\) of \(R\) the set \(\sigma = (\sigma_{ij}), 1\leq{i, j} \leq{n}\) is a full net. An elementary net \(\sigma\) is called  closed, if the elementary group \( E(\sigma) = \langle t_{ij}(\alpha) : \alpha\in \sigma_{ij}, 1\leq{i\neq{j}} \leq{n}\rangle \) doesn't contain elementary transvections. It is proved that the cyclic elementary odd-order nets are complemented. In particular, all such nets are closed. It is also shown that for every odd \(n\in\Bbb{N}\) there exists an elementary cyclic net which is not complemented.
Keywords: intermediate subgroup, non-split maximal torus, net, cyclic net, net group, elementary group, transvection.
Language: Russian
For citation: Dzhusoeva N. A., Dryaeva R. Y. Cyclical elementary nets. Vladikavkazskij matematicheskij zhurnal [Vladikavkaz Math. J.], vol. 19, no. 1, pp.26-29. DOI 10.23671/VNC.2017.1.5818
+ References


The sole copyright holder of the published work is the Founder of the Vladikavkaz Mathematical Journal. The terms of use of this work are governed by an open license (Creative Commons Attribution-NonCommercial 4.0 International). The use of metadata of the scientific article, including the title, abstract, author information, references, identifiers, and other bibliographic description elements for subsequent unrestricted use, is carried out under the terms of the CC BY or CC0 open licenses.


← Contents of issue
 
  | Home | Editorial board | Publication ethics | Peer review guidelines | Latest issue | All issues | Rules for authors | Online submission system's guidelines | Submit manuscript |  
© 1999-2026 Южный математический институт