Division Algorithm In Rings

Division Algorithm in Rings is a formal algebraic framework that generalizes the classical division algorithm to integral domains by specifying conditions under which, for any two elements \(a\) and \(b \neq 0\), there exist a quotient \(q\) and a remainder \(r\) such that \(a = bq + r\) with the remainder satisfying a norm-decreasing condition relative to the divisor.

15

Publications

388

Citations

26

Authors

12

Institutions

Publications per year

2017–2026

1

Variants

Euclidean Division In Rings

Authors

26

  1. LE
    L. E. Dickson

    University of Chicago, United States

    2 publications · 89 citations

    2

    h-index

  2. MV
    M. V. Zinin

    Joint Institute for Nuclear Research, Russia

    1 publications · 17 citations

    1

    h-index

  3. RY
    Rahman Younis

    Kuwait University, Kuwait

    1 publications · 12 citations

    1

    h-index

  4. IY
    Ihsen Yengui

    University of Sfax, Tunisia

    1 publications · 11 citations

    1

    h-index

  5. AK
    Arvind Kumar

    Motilal Nehru National Institute of Technology, India

    1 publications · 14 citations

    1

    h-index

1–5 of 26

Venues

  1. Transactions of the American Mathematical Society

    TRAN · 2 publications · 89 citations

    2

    h-index

  2. Communications in Algebra

    2 publications · 83 citations

    2

    h-index

  3. 1

    h-index

  4. American Mathematical Monthly

    1 publications · 10 citations

    1

    h-index

  5. Wireless Personal Communications

    1 publications · 14 citations

    1

    h-index

1–5