Related papers: Visualization of Abel's Impossibility Theorem
We consider applications of a finitary version of the Affine Representability theorem, which follows from recent work of Belov-Kanel, Rowen, and Vishne. Using this result we are able to show that when given a finite set of polynomial…
In this paper we give an elementary proof of the Fundamental Theorem of Algebra for polynomials over the rational tropical semi-ring. We prove that, tropically, the rational numbers are algebraically closed. We provide a simple algorithm…
A new version of the Graeffe algorithm for finding all the roots of univariate complex polynomials is proposed. It is obtained from the classical algorithm by a process analogous to renormalization of dynamical systems. This iteration is…
This note was prepared as a handout for the MAT401 course ``Polynomial equations and fields", taught at the University of Toronto in Spring 2026. It presents a proof of a necessary condition for the solvability of algebraic equations by…
In this paper we prove that every irreducible representation of a Leibniz algebra can be obtained from irreducible representations of the semisimple Lie algebra from the Levi decomposition. We also prove that - in general - for (semi)simple…
In his 1951 book "Infinite Abelian Groups", Kaplansky gives a combinatorial characterization of the isomorphism types of embeddings of a cyclic subgroup in a finite abelian group. In this paper we first use partial maps on…
We deal with the algebraicity of an iterated Puiseux series in several variables in terms of the properties of its coefficients. Our aim is to generalize to several variables the results from [HM15]. We show that the algebraicity of such a…
The principal aim of this paper is to extend Abel's theorem to the setting of complex supermanifolds of dimension 1|q over a finite-dimensional local supercommutative C-algebra. The theorem is proved by establishing a compatibility of Serre…
The existence of string functions, which are not polynomial time computable, but whose graph is checkable in polynomial time, is a basic assumption in cryptography. We prove that in the framework of algebraic complexity, there are no such…
We investigate the closure properties of read-once oblivious Algebraic Branching Programs (roABPs) under various natural algebraic operations and prove the following. - Non-closure under factoring: There is a sequence of explicit…
Parametricity states that polymorphic functions behave the same regardless of how they are instantiated. When developing polymorphic programs, Wadler's free theorems can serve as free specifications, which can turn otherwise partial…
We associate to each Boolean function a polynomial whose evaluations represents the distances from all possible Boolean affine functions. Both determining the coefficients of this polynomial from the truth table of the Boolean function and…
Ritt studied the functional decomposition of a univariate complex polynomial f into prime (indecomposable) polynomials, f = u_1 o u_2 o ... o u_r. His main achievement was a procedure for obtaining any decomposition of f from any other by…
Reverse Mathematics is a program in the foundations of mathematics. Its results give rise to an elegant classification of theorems of ordinary mathematics based on computability. In particular, the majority of these theorems fall into only…
After Abel Ruffini theorem and Galois Theory the search for a method or formula to solve quintic equation ends. This paper discuss about the radical solution of quintic equation using a method that could be proved in some simple steps. A…
This article surveys results on graded algebras and their Hilbert series. We give simple constructions of finitely generated graded associative algebras $R$ with Hilbert series $H(R,t)$ very close to an arbitrary power series $a(t)$ with…
A classical problem due to Abel is to determine if a differential equation $y'=\eta y$ admits a non-trivial solution $y$ algebraic over $\mathbb C(x)$ when $\eta$ is a given algebraic function over $\mathbb C(x)$. Risch designed an…
We establish an effective Bertini-type theorem for hypersurfaces $X_f \colon f = 0$ defined over a finite field $k$ for which $f$ has no linear factors over the algebraic closure $\overline{k}$. Given a line $L$ defined over $k$ and a…
We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…
In order to compute with $l$--adic sheaves or crystals on a line over $\mathbb{F} _q$ a low-technology alternative to the traditional computation with the Hecke operators on the automorphic side could be helpful. A program which has evolved…