Related papers: Explicit Euclidean division algorithms for some de…
It is a major unsolved problem as to whether unknot recognition - that is, testing whether a given closed loop in R^3 can be untangled to form a plain circle - has a polynomial time algorithm. In practice, trivial knots (which can be…
The ring structures of disk galaxies are vital for understanding galaxy evolution and dynamics. However, due to the scarcity of ringed galaxies and challenges in their identification, traditional methods often struggle to efficiently obtain…
Julia Robinson has given a first-order definition of the rational integers Z in the rational numbers Q by a formula (\forall \exists \forall \exists)(F=0) where the \forall-quantifiers run over a total of 8 variables, and where F is a…
We define a new class of rings parameterized by binary forms of a certain type, and give an effective lower bound for the number of such rings whose discriminant is less than a bound $X$. We also obtain a lower bound for the number of…
Algorithms can be used to prove and to discover new theorems. This paper shows how algorithmic skills in general, and the notion of invariance in particular, can be used to derive many results from Euclid's algorithm. We illustrate how to…
The purpose of this paper is to prove that certain limits of polynomial rings are themselves polynomial rings, and show how this observation can be used to deduce some interesting results in commutative algebra. In particular, we give two…
This paper introduces a new algorithm for the fundamental problem of generating a random integer from a discrete probability distribution using a source of independent and unbiased random coin flips. We prove that this algorithm, which we…
We employ the slice spectral sequence, the motivic Steenrod algebra, and Voevodsky's solutions of the Milnor and Bloch-Kato conjectures to calculate the hermitian $K$-groups of rings of integers in number fields. Moreover, we relate the…
Finite groups that are embeddable in the multiplicative groups of division rings $K$ were completely determined by S. A. Amitsur in 1955. In case $K$ has characteristic $p>0$, the only possible finite subgroups of $K^*$ are cyclic groups,…
A recent experimental discovery involving the spin structure of electrons in a cold one-dimensional magnet points to a validation of a Zamolodchikov model involving the exceptional Lie group $E_8$. The model predicts 8 particles and…
In 2001, M. Bhargava stunned the mathematical world by extending Gauss's 200-year-old group law on integral binary quadratic forms, now familiar as the ideal class group of a quadratic ring, to yield group laws on a vast assortment of…
This paper presents the first decoding algorithm for Gabidulin codes over Galois rings with provable quadratic complexity. The new method consists of two steps: (1) solving a syndrome-based key equation to obtain the annihilator polynomial…
We propose and study a generalized continued fraction algorithm that can be executed in an arbitrary imaginary quadratic field, the novelty being a non-restriction to the five Euclidean cases. Many hallmark properties of classical continued…
In 1964 Lochs proved a theorem on the number of continued fraction digits of a real number $x$ that can be determined from just knowing its first $n$ decimal digits. In 2001 this result was generalised to a dynamical systems setting by…
We investigate how the complexity of Euclidean TSP for point sets $P$ inside the strip $(-\infty,+\infty)\times [0,\delta]$ depends on the strip width $\delta$. We obtain two main results. First, for the case where the points have distinct…
We study exact algorithms for Euclidean TSP in $\mathbb{R}^d$. In the early 1990s algorithms with $n^{O(\sqrt{n})}$ running time were presented for the planar case, and some years later an algorithm with $n^{O(n^{1-1/d})}$ running time was…
We demonstrate relationships between the classic Euclidean algorithm and many other fields of study, particularly in the context of music and distance geometry. Specifically, we show how the structure of the Euclidean algorithm defines a…
We describe deterministic and probabilistic algorithms to determine whether or not a given monic irreducible polynomial H in Z[X] is a Hilbert class polynomial, and if so, which one. These algorithms can be used to determine whether a given…
In 2015, Abatzoglou, Silverberg, Sutherland, and Wong presented a framework for primality proving algorithms for special sequences of integers using an elliptic curve with complex multiplication. They applied their framework to obtain…
We investigate the finite subgroups that occur in the Hamiltonian quaternion algebra over the real subfield of cyclotomic fields. When possible, we investigate their distribution among the maximal orders.