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
Parents
15
Nathan Jacobson · American Journal of Mathematics · 1947 · 39 citations
Valuation Methods in Division Rings
A. I. Lichtman · Journal of Algebra · 1995 · 30 citations
1–5 of 15
26
2
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 26
12

Motilal Nehru National Institute of Technology
Prayagraj, India
1 h-index
5 publications
70 citations

Joint Institute for Nuclear Research
Dubna, Russia
1 h-index
2 publications
34 citations
State Key Laboratory of Cryptology
Beijing, China
1 h-index
1 publications
13 citations

Centre National de la Recherche Scientifique
Paris, France
1 h-index
1 publications
11 citations

National University of Defense Technology
Changsha, China
1 h-index
4 publications
52 citations

University of Wisconsin–Parkside
Kenosha, United States
1 h-index
1 publications
30 citations
Kuwait University
Kuwait City, Kuwait
1 h-index
1 publications
12 citations
Laboratoire de Mathématiques Blaise Pascal
Aubière, France
1 h-index
1 publications
11 citations
1–8 of 12
TRAN · 2 publications · 89 citations
2
h-index
2 publications · 83 citations
2
h-index
1 publications · 27 citations
1
h-index
1 publications · 10 citations
1
h-index
1 publications · 14 citations
1
h-index
1–5