Related papers: Validity proof of Lazard's method for CAD construc…
We develop a new method that improves the efficiency of equation-by-equation algorithms for solving polynomial systems. Our method is based on a novel geometric construction, and reduces the total number of homotopy paths that must be…
In this paper we examine the potential of computer-assisted proof methods to be applied much more broadly than commonly recognized. More specifically, we contend that there are vast opportunities to derive useful mathematical results and…
Lambek calculus is a logical foundation of categorial grammar, a linguistic paradigm of grammar as logic and parsing as deduction. Pentus (2010) gave a polynomial-time algorithm for determ- ining provability of bounded depth formulas in the…
Many results in mass partitions are proved by lifting $\mathbb{R}^d$ to a higher-dimensional space and dividing the higher-dimensional space into pieces. We extend such methods to use lifting arguments to polyhedral surfaces. Among other…
Cylindrical Algebraic Decomposition (CAD) is a key tool in computational algebraic geometry, particularly for quantifier elimination over real-closed fields. However, it can be expensive, with worst case complexity doubly exponential in the…
Using the differential precision methods developed previously by the same authors, we study the p-adic stability of standard operations on matrices and vector spaces. We demonstrate that lattice-based methods surpass naive methods in many…
We present an unexpected application of tropical convexity to the determination of invariants for linear systems of differential equations. We show that the classical G\'erard-Levelt lattice saturation procedure can be geometrically…
We develop a simple two-step algorithm for enclosing Chebyshev expansions whose cost is linear in terms of the polynomial degree. The algorithm first transforms the expansion from Chebyshev to the Laurent basis and then applies the interval…
Polyhedral projection is a main operation of the polyhedron abstract domain.It can be computed via parametric linear programming (PLP), which is more efficient than the classic Fourier-Motzkin elimination method.In prior work, PLP was done…
Recently introduced composition operator for credal sets is an analogy of such operators in probability, possibility, evidence and valuation-based systems theories. It was designed to construct multidimensional models (in the framework of…
The canonical polyadic decomposition (CPD) is a compact decomposition which expresses a tensor as a sum of its rank-1 components. A common step in the computation of a CPD is computing a generalized eigenvalue decomposition (GEVD) of the…
In a 1962 paper, Zariski introduced the decomposition theory that now bears his name. Although it arose in the context of algebraic geometry and deals with the configuration of curves on an algebraic surface, we have recently observed that…
The framework of Light Logics has been extensively studied to control the complexity of higher-order functional programs. We propose an extension of this framework to multithreaded programs with side effects, focusing on the case of…
Lifting methods allow to transform hard variational problems such as segmentation and optical flow estimation into convex problems in a suitable higher-dimensional space. The lifted models can then be efficiently solved to a global optimum,…
A systematic way of construction of (2+1)-dimensional dispersionless integrable Hamiltonian systems is presented. The method is based on the so-called central extension procedure and classical R-matrix applied to the Poisson algebras of…
We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…
We present a divide-and-conquer version of the Cylindrical Algebraic Decomposition (CAD) algorithm. The algorithm represents the input as a Boolean combination of subformulas, computes cylindrical algebraic decompositions of solution sets…
Linear discriminant analysis (LDA) is a well-known method for multiclass classification and dimensionality reduction. However, in general, ordinary LDA does not achieve high prediction accuracy when observations in some classes are…
Canonical Polyadic Decomposition (CPD) of a third-order tensor is decomposition in a minimal number of rank-$1$ tensors. We call an algorithm algebraic if it is guaranteed to find the decomposition when it is exact and if it only relies on…
We put the Adler-Gelfand-Dickey approach to classical W-algebras in the framework of Poisson vertex algebras. We show how to recover the bi-Poisson structure of the KP hierarchy, together with its generalizations and reduction to the N-th…