Related papers: Recent Advances in Real Geometric Reasoning

Recursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], and D. Lacombe [1955]. It is based on a discrete mechanical framework that can be used to model computation over the real numbers. In this context the…

First proved my Donald Martin in 1975, the result of Borel determinacy has been the subject of multiple revised proofs. Following Martin's book [1], we present a recent streamlined proof which implements ideas of Martin, Moschovakis, and…

We consider the use of Quantifier Elimination (QE) technology for automated reasoning in economics. QE dates back to Tarski's work in the 1940s with software to perform it dating to the 1970s. There is a great body of work considering its…

A new way of orthogonalizing ensembles of vectors by "lifting" them to higher dimensions is introduced. This method can potentially be utilized for solving quantum decision and computing problems.

A formula for the number of monic irreducible self-reciprocal polynomials, of a given degree over a finite field, was given by Carlitz in 1967. In 2011 Ahmadi showed that Carlitz's formula extends, essentially without change, to a count of…

Galois theory is developed using elementary polynomial and group algebra. The method follows closely the original prescription of Galois, and has the benefit of making the theory accessible to a wide audience. The theory is illustrated by a…

We consider various inequalities for polynomials, with an emphasis on the most fundamental inequalities of approximation theory. In the sequel a key role is played by the generalized Minkowski functional \alpha(K,x), already being used by…

We discuss issues of problem formulation for algorithms in real algebraic geometry, focussing on quantifier elimination by cylindrical algebraic decomposition. We recall how the variable ordering used can have a profound effect on both…

We use generalized Taylor formulae in order to give some simple constructions in the real closure of an \ovfz. We deduce a new, simple quantifier elimination algorithm for \rcvfs and some theorems about constructible subsets of real…

A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorithm up to a universal multiplicative factor related to the…

In 1968, M. Artin proved that any formal power series solution of a system of analytic equations may be approximated by convergent power series solutions. Motivated by this result and a similar result of P{\l}oski, he conjectured that this…

We study two techniques for correcting the geometrical error associated with domain approximation by a polygon. The first was introduced some time ago \cite{bramble1972projection} and leads to a nonsymmetric formulation for Poisson's…

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 1922, Mordell conjectured the striking statement that for a polynomial equation $f(x,y)=0$, if the topology of the set of complex number solutions is complicated enough, then the set of rational number solutions is finite. This was…

A slight modification to one of Tarski's axioms of plane Euclidean geometry is proposed. This modification allows another of the axioms to be omitted from the set of axioms and proven as a theorem. This change to the system of axioms…

Abraham Robinson's framework for modern infinitesimals was developed half a century ago. It enables a re-evaluation of the procedures of the pioneers of mathematical analysis. Their procedures have been often viewed through the lens of the…

Reasoning under uncertainty is a fundamental challenge in Artificial Intelligence. As with most of these challenges, there is a harsh dilemma between the expressive power of the language used, and the tractability of the computational…

We study in this paper a new approach to the problem of relating solutions to the Einstein field equations with Riemannian and Lorentzian signatures. The procedure can be thought of as a "real Wick rotation". We give a modified action for…

We generalize the framework of virtual substitution for real quantifier elimination to arbitrary but bounded degrees. We make explicit the representation of test points in elimination sets using roots of parametric univariate polynomials…

In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…