Thursday, July 16, 2026 - 16:00 in V2-210/216
Division!
A talk in the Mathematisches Kolloquium series by
Timothy Trudgian from UNSW Canberra
| Abstract: |
Euclid’s algorithm for division allows us to divide two numbers, keep track of remainders, and recover GCDs. I will discuss other algebraic settings: some rings are known to be Euclidean (meaning they have this algorithm), some are known not to be; many are unknown. I will end with a summary of recent work done ( https://arxiv.org/abs/2507.05862 ) that resolves completely the case of cyclic cubic fields.
|
Back
