Related papers: Euclid's Number-Theoretical Work
The Binomial Theorem has long been essential in mathematics. In one form or another it was known to the ancients and, in the hands of Leibniz, Newton, Euler, Galois, and others, it became an essential tool in both algebra and analysis.…
The Euler scheme is up to date the most important numerical method for ordinary differential inclusions, because the use of the available higher-order methods is prohibited by their enormous complexity after spatial discretization.…
The problem of efficient multiplication of large numbers has been a long-standing challenge in classical computation and has been extensively studied for centuries. It appears that the existing classical algorithms are close to their…
Isaac Newton formulated the central difference algorithm (Eur. Phys. J. Plus (2020) 135:267) when he derived his second law. The algorithm is under various names ("Verlet, leap-frog,...") the most used algorithm in simulations of complex…
We deliver a call to arms for probabilistic numerical methods: algorithms for numerical tasks, including linear algebra, integration, optimization and solving differential equations, that return uncertainties in their calculations. Such…
This is a translation of Euler's Latin paper "De fractionibus continuis observationes" into English. In this paper Euler describes his theory of continued fractions. He teaches, how to transform series into continued fractions, solves the…
This note describes a representation of the real numbers due to Schanuel. The representation lets us construct the real numbers from first principles. Like the well-known construction of the real numbers using Dedekind cuts, the idea is…
In this thesis I discuss combinatorial optimization problems, from the statistical physics perspective. The starting point are the motivations which brought physicists together with computer scientists and mathematicians to work on this…
Bolzano and Cantor were the first mathematicians to make significant attempts to measure the size (numerosity) of different infinite collections. They differed in their methodological approaches, with Cantor's prevailing. This led to the…
An analogue of the Euclidean algorithm for square matrices of size 2 with integral non-negative entries and strictly positive determinant $n$ defines a finite set $\mathcal{R}(n)$ of Euclid-reduced matrices corresponding to elements of…
The following notes are intended to make a small digression on the topics mentioned in the title of the same, since these were not addressed in the past tribute by the Institute of Physics of the UdeA. We believe more than platitude try to…
It is well known that a triangle with side lengths 3, 4 and 5 is right-angled. Euclid was the first to give a formula for generating other right-angled triangles with integer side lengths. In this text, I present a novel algorithm to…
The unification algorithm is at the core of the logic programming paradigm, the first unification algorithm being developed by Robinson [5]. More efficient algorithms were developed later [3] and I introduce here yet another efficient…
The ellipsoid algorithm is a fundamental algorithm for computing a solution to the system of $m$ linear inequalities in $n$ variables $(P): A^{\top}x \le u$ when its set of solutions has positive volume. However, when $(P)$ is infeasible,…
In this work we define an universal arithmetical algorithm, by means of the standard quantum mechanical formalism, called universal qm-arithmetical algorithm. By universal qm-arithmetical algorithm any decidable arithmetical formula…
Euclid is poised to survey galaxies across a cosmological volume of unprecedented size, providing observations of more than a billion objects distributed over a third of the full sky. Approximately 20 million of these galaxies will have…
We introduce a new example of unital commutative $n$-dimensional group algebra $\mathbb{R}_n$ for $n \geq 2$. The algebra $\mathbb{R}_n$ and the complex numbers $\mathbb{C}$ are astonishingly alike. The zero divisor set of the algebra has…
We define the simplest log-euclidean geometry. This geometry exposes a difficulty hidden in Hilbert's list of axioms presented in his "Grundlagen der Geometrie". The list of axioms appears to be incomplete if the foundations of geometry are…
Perhaps the most significant, if not the most important, achievements in chemistry and physics are the Periodic Table of the Elements in Chemistry and the Standard Model of Elementary Particles in Physics. A comparable achievement in…
Rounding has proven to be a fundamental tool in theoretical computer science. By observing that rounding and partitioning of $\mathbb{R}^d$ are equivalent, we introduce the following natural partition problem which we call the {\em secluded…