Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1311.7171

Minimal Number of Steps in Euclidean Algorithm and its Application to Rational Tangles

M. Syafiq Johar
View original source ↗Read source document ↗Export metadata ↓

Abstract

We define the regular Euclidean algorithm and the general form which leads to the method of least absolute remainders and also the method of negative remainders. We are going to show that if looked from the perspective of subtraction, the method of least absolute remainders and the regular method have the same number of steps which is in fact the minimal number of steps possible. This enables us to apply the theory in rational tangles to determine the most efficient way to untangle a rational tangle.

Explore related subjects

math.GNmath.NT

Keep this discovery

BibTeXRIS

M. Syafiq Johar. 2013-11-27. Minimal Number of Steps in Euclidean Algorithm and its Application to Rational Tangles. https://arxiv.org/abs/1311.7171

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Maximal Center of Distances of Finite Ultrametric Spaces and Perfect Binary Trees

We investigate the finite ultrametric spaces $(X,d)$ that have a given cardinality of the center of distances and a minimal cardinality of the set $X$. It is shown that such spaces are isometric if and only if their centers of distances are the same. The representing trees of these spaces are characterized up to isomorphism.

math.GN↗
arXiv2026

A continuous $3$-distributive frame that is not $\omega$-distributive

We give a negative answer to the question, posed by Ern\'e, whether every $3$-distributive lattice is $\omega$-distributive. More precisely, we exhibit a continuous frame that is $\kappa$-distributive for every integer $\kappa\geq 2$, but is not a wide coframe. The frame is the open-set lattice of a compact, locally compact, countably based $T_0$ topological meet-semilattice, obtained from Lawson's construction in the logarithmic form described by Goubault-Larrecq. The failure of $\omega$-distributivity is witnessed by an explicit matrix with countably many nonempty finite rows: all row joins are the same nonzero element, whereas every choice of one entry from each row has meet zero. The same space answers negatively Ern\'e's accompanying question whether every $4$-web space is a wide web space. All properties of the construction needed for these conclusions are proved directly.

math.GN↗
arXiv2026

An overlooked weakening of perfect normality: Perfect regularity in spaces and locales

We introduce the notion of perfect regularity as an appropriate weakening of perfect normality, both for spaces and locales. Various characterizations are given, using Dedekind-MacNeille completions, injective hulls, and sublocales. We place the new class of perfectly regular frames among various well-studied classes of frames. We also introduce the construction of perfect regularization of a completely regular frame, compare it to Isbell's well-known booleanization construction, and argue that it is at least as important as the latter.

math.GN↗