Related papers: Abel-Ruffini's Theorem: Complex but Not Complicate…
The Casas-Alvero conjecture says that a degree $n$ complex univariate polynomial sharing a root with each of its derivative must have only one root. In this article we give three results. The first one, is that the number of possible…
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 present algorithms for parametrizing by radicals an irreducible curve, not necessarily plane, when the genus is less o equal to 4 and they are defined over an algebraically closed field of characteristic zero. In addition, we also…
Many proofs of the fundamental theorem of algebra rely on the fact that the minimum of the modulus of a complex polynomial over the complex plane is attained at some complex number. The proof then follows by arguing the minimum value is…
Modify the Blum-Shub-Smale model of computation replacing the permitted computational primitives (the real field operations) with any finite set $B$ of real functions semialgebraic over the rationals. Consider the class of boolean decision…
Cylindrical algebraic decomposition (CAD) is an important tool for working with polynomial systems, particularly quantifier elimination. However, it has complexity doubly exponential in the number of variables. The base algorithm can be…
Using model theory and differential algebra, we give necessary conditions for algebraic ordinary differential equations to have a complex Pfaffian solution on some complex domain. These tools also allow us to give many examples of algebraic…
Long before we learn to construct the field of rational numbers (out of the ring of integers) at university, we learn how to calculate with fractions at school. When it comes to "numbers", we are used to a commutative multiplication, for…
The Riccati equations reducible to first-order linear equations by an appropriate change the dependent variable are singled out. All these equations are integrable by quadrature. A wide class of linear ordinary differential equations…
We provide an easy method for the construction of characteristic polynomials of simple ordinary abelian varieties ${\mathcal A}$ of dimension $g$ over a finite field ${\mathbb F}_q$, when $q\ge 4$ and $2g=\rho^{b-1}(\rho-1)$ for some prime…
It is proved that for any finite dimensional representation of a prime order group over the field of rational numbers, polynomial invariants of degree at most $3$ separate the orbits. A result providing an upper degree bound for separating…
We propose a technique for exploring the abelian complexity of recurrent infinite words, focusing particularly on infinite words associated with Parry numbers. Using that technique, we give the affirmative answer to the open question posed…
Abelian complexity of a word $\mathbf{u}$ is a function that counts the number of pairwise non-abelian-equivalent factors of $\mathbf{u}$ of length $n$. We prove that for any $c$-balanced Parry word $\mathbf{u}$, the values of the abelian…
Let $R$ be an order in an algebraic number field. If $R$ is a principal order, then many explicit results on its arithmetic are available. Among others, $R$ is half-factorial if and only if the class group of $R$ has at most two elements.…
Classical approach of solvability problem has shed much light on what we can solve and what we cannot solve mathematically. Starting with quadratic equation, we know that we can solve it by the quadratic formula which uses square root.…
In this note we show that unsatisfiable systems of linear equations with a constant number of variables per equation over prime finite fields have polynomial-size constant-degree semi-algebraic proofs of unsatisfiability. These are proofs…
In their account of theory change in logic, Aberdein and Read distinguish 'glorious' from 'inglorious' revolutions--only the former preserves all 'the key components of a theory' [1]. A widespread view, expressed in these terms, is that…
Algorithms working with linear algebraic groups often represent them via defining polynomial equations. One can always choose defining equations for an algebraic group to be of the degree at most the degree of the group as an algebraic…
Galilean Relativity and Einstein's Special and General Relativity showed that the Laws of Physics go deeper than their representations in any given reference frame. Thus covariance, or independence of Laws of Physics with respect to changes…
The Chinese Remainder Theorem for the integers says that every system of congruence equations is solvable as long as the system satisfies an obvious necessary condition. This statement can be generalized in a natural way to arbitrary…