Related papers: Recent Advances in Real Geometric Reasoning
Complex polynomial optimization has recently gained more and more attention in both theory and practice. In this paper, we study the optimization of a real-valued general conjugate complex form over various popular constraint sets including…
We unveil in concrete terms the general machinery of the syzygy-based algorithms for the implicitization of rational surfaces in terms of the monomials in the polynomials defining the parametrization, following and expanding our joint…
The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…
In complex general relativity, Lorentzian space-time is replaced by a four-complex-dimensional complex-Riemannian manifold, with holomorphic connection and holomorphic curvature tensor. A multisymplectic analysis shows that the Hamiltonian…
Transcorrelated coupled cluster and distinguishable cluster methods are presented. The Hamiltonian is similarity transformed with a Jastrow factor in the first quantisation, which results in up to three-body integrals. The coupled cluster…
A new class of two dimensional integrable field theories, based on the mathematical notion of Poisson manifolds, and containing gravity-Yang-Mills systems as well as the G/G gauged Wess-Zumino Witten-model, are presented. The local…
Functional iterations such as Newton's are a popular tool for polynomial root-finding. We consider realistic situation where some (e.g., better-conditioned) roots have already been approximated and where further computations is directed to…
Predictive models are being increasingly used to support consequential decision making at the individual level in contexts such as pretrial bail and loan approval. As a result, there is increasing social and legal pressure to provide…
A novel approach is introduced to a very widely occurring problem, providing a complete, explicit resolution of it: minimisation of a convex quadratic under a general quadratic, equality or inequality, constraint. Completeness comes via…
An effective exact method is proposed for computing generalized eigenspaces of a matrix of integers or rational numbers. Keys of our approach are the use of minimal annihilating polynomials and the concept of the Jourdan-Krylov basis. A new…
The complex Langevin (CL) method shows great promise in enabling the calculation of observables for theories with complex actions. Nevertheless, real-time quantum field theories have remained largely unsolved due to the particular severity…
Bernays introduced a method for proving underivability results in propositional calculi by truth tables. In general, this motivates an investigations of how to find, given a propositional logic, a finite-valued logic which has as few…
Cylindrical algebraic decomposition (CAD) is an important tool for the study of real algebraic geometry with many applications both within mathematics and elsewhere. It is known to have doubly exponential complexity in the number of…
Although Bayesian methods are robust and principled, their application in practice could be limited since they typically rely on computationally intensive Markov Chain Monte Carlo algorithms for their implementation. One possible solution…
We generalize Carlitz' result on the number of self reciprocal monic irreducible polynomials over finite fields by showing that similar explicit formula hold for the number of irreducible polynomials obtained by a fixed quadratic…
In 2015, G.~Mikhalkin introduced a refined count for real rational curves in toric surfaces. The counted curves have to pass through some real and complex points located on the toric boundary of the surface, and the count is refined…
Cylindrical Algebraic Decomposition (CAD) has long been one of the most important algorithms within Symbolic Computation, as a tool to perform quantifier elimination in first order logic over the reals. More recently it is finding…
This paper builds and extends on the authors' previous work related to the algorithmic tool, Cylindrical Algebraic Decomposition (CAD), and one of its core applications, Real Quantifier Elimination (QE). These topics are at the heart of…
This is an introduction to the by now fifteen years old research field of canonical quantum general relativity, sometimes called "loop quantum gravity". The term "modern" in the title refers to the fact that the quantum theory is based on…
In this work we study the space complexity of computable real numbers represented by fast convergent Cauchy sequences. We show the existence of families of trascendental numbers which are logspace computable, as opposed to algebraic…