相关论文: Aryabhata's Root Extraction Methods

We study the square root computation by Leonardo Fibonacci (or Leonardo of Pisa) in his MSS Liber Abaci from c1202 and c1228 and De Practica Geometrie from c1220. We annotate a translation of Liber Abaci based on transcripts from 1857 and…

We explore a novel link between two seemingly disparate mathematical concepts: Egyptian fractions and fractals. By examining the decomposition of rationals into sums of distinct unit fractions, a practice rooted in ancient Egyptian…

We develop continuous-stage Runge-Kutta methods based on weighted orthogonal polynomials in this paper. There are two main highlighted merits for developing such methods: Firstly, we do not need to study the tedious solution of…

We review origins and main properties of the most important bracket operations appearing canonically in differential geometry and mathematical physics in the classical, as well as the supergeometric setting. The review is supplemented by a…

In this paper, we present a new method for solving standard quaternion equations. Using this method we reobtain the known formulas for the solution of a quadratic quaternion equation, and provide an explicit solution for the cubic…

This paper classifies the splints of the root system of classical Lie superalgebras as a superalgebraic conversion of the splints of classical root systems. It can be used to derive branching rules, which have potential physical application…

We model an artificial root which grows in the soil for underground prospecting. Its evolution is described by a controlled system of two integro-partial differential equations: one for the growth of the body and the other for the…

In this paper, we present a review of three widely-used practical square root algorithms. We then describe a unifying framework where each of these well-known algorithms can be seen as a special case of it. The framework with singular…

In this paper we study the properties of an algorithm for generating continued fractions in the field of p-adic numbers $\mathbb{Q}_p$. First of all, we obtain an analogue of the Galois' Theorem for classical continued fractions. Then, we…

This paper presents a primitive $n$th root of unity in $\mathbb C$. The approach is very elementary and avoids the following: the complex exponential function, trigonometry, and group theory. It also avoids differentiation, integration, and…

This paper explores the problem of unknotting closed braids and classical knots in mathematical knot theory. We apply evolutionary computation methods to learn sequences of moves that simplify knot diagrams, and show that this can be…

In this paper methods for simultaneous finding all roots of generalized polynomials are developed. These methods are related to the case when the roots are multiple. They possess cubic rate of convergence and they are as labour-consuming as…

The AHU-algorithm solves the computationally difficult graph isomorphism problem for rooted trees, and does so with a linear time complexity. Although the AHU-algorithm has remained state of the art for almost 50 years, it has been…

This paper contains an algebraic constructive and self-contained account of the invariance rule of the digital root under division for an arbitrary natural basis representation. Both the cases of repeating and non-repeating fractionals are…

This paper presents new six solutions for sixth degree polynomial equation in general forms basing on new theorems, where the possibility to calculate the six roots of any sixth degree equation nearly simultaneously. The proposed roots for…

Bat algorithm (BA) is a bio-inspired algorithm developed by Yang in 2010 and BA has been found to be very efficient. As a result, the literature has expanded significantly in the last 3 years. This paper provides a timely review of the bat…

Multiplicative relations between the roots of a polynomial in $\mathbb{Q}[x]$ have drawn much attention in the field of arithmetic and algebra, while the problem of computing these relations is interesting to researchers in many other…

The analysis of solutions to algebraic equations is further simplified. A couple of functions and their analytic continuation or root findings are required.

This article provides a simple trigonometric method for determining how many roots of a quintic equation are real and how many are complex, without solving the equation. The approach transforms a depressed quintic $t^5 + mt^3 + nt^2 + pt +…

Axioms for the generalization of root systems were defined and classified (irreducible) by V. Serganova, which precisely correspond to the root systems of basic classical Lie Superalgebras. Here, we present a unified method for constructing…