Related papers: Abel-Ruffini's Theorem: Complex but Not Complicate…

Motivated by applications of algebraic geometry, we introduce the Galois width, a quantity characterizing the complexity of solving algebraic equations in a restricted model of computation allowing only field arithmetic and adjoining…

We provide an alternative proof that the finite rational linear combination of radicals, under certain constraint, are linearly independent over $\mathbb{Q}$.

An alternative proof of the completeness of relational algebra with respect to allowed formulas of first-order logic is presented. The proof relies on the well-known embedding of relational algebra into cylindric algebra, which makes it…

We classify all totally real number fields of degree at most 5 that admit a universal quadratic form with rational integer coefficients; in fact, there are none over the previously unsolved cases of quartic and quintic fields. This fully…

Using the Chiellini condition for integrability we derive explicit solutions for a generalized system of Riccati equations $\ddot{x}+\alpha x^{2n+1}\dot{x}+x^{4n+3}=0$ by reduction to the first-order Abel equation assuming the parameter…

Let C be an algebraically closed field and X a projective curve over C. Consider an ordinary linear differential equation, or a linear differ- ence equation, with coefficients in the field of rational functions of X, and assume that its…

I argue for a full mathematisation of the physical theory, including its axioms, which must contain no physical primitives. In provocative words: "physics from no physics". Although this may seem an oxymoron, it is the royal road to keep…

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…

These are the notes of my lectures at the 1996 European Congress of Mathematicians. {} Polynomials appear in mathematics frequently, and we all know from experience that low degree polynomials are easier to deal with than high degree ones.…

Since the beginning of the quest of hypercomplex numbers in the late eighteenth century, many hypercomplex number systems have been proposed but none of them succeeded in extending the concept of complex numbers to higher dimensions. This…

Our contribution is a bounded cubic compilation theorem. For each fixed resource parameter $k$, syntactic proof checking at resource level $k$ is faithfully represented by a finite bounded-domain system of cubic polynomial equations. Every…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Let $b \ge 2$ be an integer. We prove that the $b$-adic expansion of every irrational algebraic number cannot have low complexity. Furthermore, we establish that irrational morphic numbers are transcendental, for a wide class of morphisms.…

We consider the construction of the fundamental function and Abelian differentials of the third kind on a plane algebraic curve over the field of complex numbers that has no singular points. The algorithm for constructing differentials of…

Frobenius' Theorem states that the only finite-dimensional real division algebras are the algebra of real numbers $\mathbb R$, the algebra of complex numbers $\mathbb C$, and the algebra of quaternions $\mathbb H$. We present a short proof…

While it is trivial to multiply two C-finite sequences (just like integers), it is not quite so trivial to "factorize" them, or to decide whether they are "prime". The former is plain linear algebra, while the latter is heavy-duty…

We investigate the complexity of evaluating queries in Relational Algebra (RA) over the relations extracted by regex formulas (i.e., regular expressions with capture variables) over text documents. Such queries, also known as the regular…

A differential algebra of nonlinear generalized functions is presented as a tool for a wide range of nonsmooth nonlinear problems. The power of the differential algebra is used to do mathematical calculations or proofs; then the final…

We use the classical umbral calculus to describe Riordan arrays. Here, a Riordan array is generated by a pair of umbrae, and this provides efficient proofs of several basic results of the theory such as the multiplication rule, the…

Using model theoretic techniques that proved that the class of $n$ neat reducts of $m$ dimensional cylindric algebras, $\Nr_n\CA_m$, is not elementary, we prove the same result for $\Ra\CA_k$, $k\geq 5$, and we show that $\Ra\CA_k\subset…