Related papers: General non-realizability certificates for spheres…
In this paper we prove a topological nonrealizability theorem: certain classes of graded $BP_*$-modules are shown to never occur as the $BP$-homology of a spectrum. Many of these $BP_*$-modules admit the structure of $BP_*BP$-comodules,…
We present six Theorems on the univariate real Polynomial, using which we develop a new algorithm for deciding the existence of atleast one real root for univariate integer Polynomials. Our algorithm outputs that no positive real root…
Systems of polynomial equations over the complex or real numbers can be used to model combinatorial problems. In this way, a combinatorial problem is feasible (e.g. a graph is 3-colorable, hamiltonian, etc.) if and only if a related system…
This note presents some numerical examples worked out in order to show the reader how to implement, within a widely accessible computational setting, the methodology for achieving zero cancellation in linear multivariable systems discussed…
Given an $\mathcal{H}$-polytope $P$ and a $\mathcal{V}$-polytope $Q$, the decision problem whether $P$ is contained in $Q$ is co-NP-complete. This hardness remains if $P$ is restricted to be a standard cube and $Q$ is restricted to be the…
Automated proving of polynomial inequalities is a fundamental challenge in automated mathematical reasoning, where rich algebraic structure and a rapidly growing certificate search space hinder scalability. Purely symbolic approaches…
We consider potentially non-convex optimization problems, for which optimal rates of approximation depend on the dimension of the parameter space and the smoothness of the function to be optimized. In this paper, we propose an algorithm…
The aims of this article are two-fold. First, we give a geometric characterization of the optimal basic solutions of the general linear programming problem (no compactness assumptions) and provide a simple, self-contained proof of it…
We note that the recent polynomial proofs of the spherical and complex plank covering problems by Zhao and Ortega-Moreno give some general information on zeros of real and complex polynomials restricted to the unit sphere. As a corollary of…
This paper describes a formalization of discrete real closed fields in the Coq proof assistant. This abstract structure captures for instance the theory of real algebraic numbers, a decidable subset of real numbers with good algorithmic…
Minkowski tensors are comprehensive shape descriptors that robustly capture n-point information in complex random geometries and that have already been extensively applied in the Euclidean plane. Here, we devise a novel framework for…
We deal with linear programming problems involving absolute values in their formulations, so that they are no more expressible as standard linear programs. The presence of absolute values causes the problems to be nonconvex and nonsmooth,…
We prove that the subset sum problem has a polynomial time computable certificate of infeasibility for all $a$ weight vectors with density at most $1/(2n)$ and for almost all integer right hand sides. The certificate is branching on a…
In this paper we examine four different models for the realization space of a polytope: the classical model, the Grassmannian model, the Gale transform model, and the slack variety. Respectively, they identify realizations of the polytopes…
Polytopal methods provide a flexible framework for the numerical approximation of partial differential equations on general meshes. Their convergence analysis raises specific challenges due to their inherently non-conforming nature and, in…
We consider systems of strict multivariate polynomial inequalities over the reals. All polynomial coefficients are parameters ranging over the reals, where for each coefficient we prescribe its sign. We are interested in the existence of…
Quantifier-free nonlinear arithmetic (QF_NRA) appears in many applications of satisfiability modulo theories solving (SMT). Accordingly, efficient reasoning for corresponding constraints in SMT theory solvers is highly relevant. We propose…
In this paper, an algorithm to compute a certified $G^1$ rational parametric approximation for algebraic space curves is given by extending the local generic position method for solving zero dimensional polynomial equation systems to the…
Model checkers use automated state exploration in order to prove various properties such as reachability, non-reachability, and bisimulation over state transition systems. While model checkers have proved valuable for locating errors in…
A variant of the Archimedean Positivstellensatz is proved which is based on Archimedean semirings or quadratic modules of generating subalgebras. It allows one to obtain representations of strictly positive polynomials on compact…