# Questions tagged [euclidean-domain]

The euclidean-domain tag has no usage guidance.

10
questions

**1**

vote

**0**answers

54 views

### Regularity of a shrunken domain

I am encountering a geometrical question that intuitively seems obvious but I have a lack of argument to prove or disprove it in a rigorous manner.
Let $\Omega\subset\Bbb R^d$ be an open bounded (...

**0**

votes

**0**answers

39 views

### Is there an analogy to twin primes in the rational integers among the Gaussian and Eisenstein integers?

Twin primes, like (29, 31) and (137, 139) are interesting to study. I have been exploring the parallels of the Gaussian and Eisenstein integers with the rational integers. For instance, they have ...

**5**

votes

**0**answers

86 views

### Quadratic function fields that are norm-euclidean or PIDs

It is known that there are finitely many square-free integers $d$ for which the ring of integers of $\mathbf{Q}(\sqrt{d})$ is Euclidean under the norm function.
Is there an analogous result for ...

**3**

votes

**0**answers

83 views

### A Euclidean domain in which radix expansion is not possible

It is well known that given two nonconstant polynomials $f,g\in F[x]$ where $F$ is a field, there are unique polynomials $r_0,\dots ,r_n$ such that
$$f=r_n g^n +\dots+r_1 g +r_0,$$
where $\deg r_i &...

**2**

votes

**1**answer

217 views

### About Euclidean domains

I asked a similar question a few weeks ago in M.SE but it didn't receive any answers, so I decided to post it here with some modifications.
My motivation comes from a theorem given in Pete L. Clark's ...

**11**

votes

**1**answer

2k views

### How to check whether a positive integer can be written as linear combination of given others, where all coefficients are positive?

Let $n$, $k$ and $m_1, \dots, m_k$ be positive integers. Which is the most efficient
algorithm to find out whether there are positive integers $a_1, \dots, a_k$ such that
$n = \sum_{i=1}^k a_i m_i$?
...

**4**

votes

**0**answers

248 views

### Comparing different Euclidean algorithms on a Euclidean domain

I have posted this question at stackexchange (502413), without responses until now.
In the papers by T. Motzkin: The Euclidean Algorithm, Bull. AMS 55, 1949, pp. 1142--1146 and P. Samuel: About ...

**8**

votes

**1**answer

2k views

### Reference request: number theory of Z[1/p]

Can anyone suggest a good place to read up on the number theoretic properties of and techniques for $\mathbb{Z}[1/p]$, (that is, rational numbers with only powers of a prime $p$ in the denominator)?
...

**21**

votes

**3**answers

1k views

### Must a ring which admits a Euclidean quadratic form be Euclidean?

The question is in the title, but employs some private terminology, so I had better explain.
Let $R$ be an integral domain with fraction field $K$, and write $R^{\bullet}$ for $R \setminus \{0\}$. ...

**39**

votes

**2**answers

3k views

### Why do we care whether a PID admits some crazy Euclidean norm?

An integral domain $R$ is said to be Euclidean if it admits some Euclidean norm: i.e., a function $N: R \rightarrow \mathbb{N} = \mathbb{Z}^{\geq 0}$ such that: for all $x, y \in R$ with $N(y) > 0$,...