Related papers: A Visualizable, Constructive Proof of the Fundamen…
We give two elementary proofs, at a level understandable by students with only pre-calculus knowledge of Algebra, of the well known fact that an irreducible irrational n-th root of a positive rational number cannot be solution of a…
A simple but rigorous proof of the Fundamental Theorem of Calculus is given in geometric calculus, after the basis for this theory in geometric algebra has been explained. Various classical examples of this theorem, such as the Green's and…
This is a detailed survey -- with rigorous and self-contained proofs -- of some of the basics of elementary combinatorics and algebra, including the properties of finite sums, binomial coefficients, permutations and determinants. It is…
This paper presents an elementary and direct proof of the Fundamental Theorem of Algebra, via Bolzano-Weierstrass Theorem on Minima, that avoids: every root extraction, angle, non-algebraic functions, differentiation, integration, series…
This work presents the Polynomiogram framework, an integrated computational platform for exploring, visualizing, and generating art from polynomial root systems. The main innovation is a flexible sampling scheme in which two independent…
A very simple and short proof of the polynomial matrix spectral factorization theorem (on the unit circle as well as on the real line) is presented, which relies on elementary complex analysis and linear algebra.
We report about significant enhancements of the complex algebraic geometry theorem proving subsystem in GeoGebra for automated proofs in Euclidean geometry, concerning the extension of numerous GeoGebra tools with proof capabilities. As a…
We establish an analogue of the fundamental theorem of algebra for polynomial matrix equations, in which the matrices-coefficients and unknown matrix are assumed to be circulant matrices.
We give a simple proof of George Andrews's balanced 5F4 evaluation using two fundamental principles: the nth difference of a polynomial of degree less than n is zero, and a polynomial of degree n that vanishes at n+1 points is identically…
We investigate the power of graph isomorphism algorithms based on algebraic reasoning techniques like Gr\"obner basis computation. The idea of these algorithms is to encode two graphs into a system of equations that are satisfiable if and…
The Parameter Continuation Theorem is the theoretical foundation for polynomial homotopy continuation, which is one of the main tools in computational algebraic geometry. In this note, we give a short proof using Gr\"obner bases. Our…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…
We present short elementary proofs of the well-known Ruffini-Abel-Galois theorems on insolvability of algebraic equations in radicals. These proofs are obtained from existing expositions by stripping away material not required for the…
In this paper, we establish an analogue of the Fundamental Theorem of Algebra for polynomial matrix equations, where both the coefficient matrices and the unknown matrix are $Q$-circulant matrices. This result generalizes Abramov's result…
Many problems in computer algebra and numerical analysis can be reduced to counting or approximating the real roots of a polynomial within an interval. Existing verified root-counting procedures in major proof assistants are mainly based on…
A new proof for adjoint systems of linear equations is presented. The argument is built on the principles of Algorithmic Differentiation. Application to scalar multiplication sets the base line. Generalization yields adjoint inner vector,…
The Fundamental Theorem of Algebra (FTA) asserts that every complex polynomial has as many complex roots, counted with multiplicities, as its degree. A probabilistic analogue of this theorem for real roots of real polynomials, commonly…
Differential calculus is not a unique way to observe polynomial equations such as $a+b=c$. We propose a way of applying difference calculus to estimate multiplicities of the roots of the polynomials $a$, $b$ and $c$ satisfying the equation…
I explain a direct approach to differentiation and integration. Instead of relying on the general notions of real numbers, limits and continuity, we treat functions as the primary objects of our theory, and view differentiation as division…