Related papers: General non-realizability certificates for spheres…

Given a finite, simple, vertex-weighted graph, we construct a graded associative (non-commutative) algebra, whose generators correspond to vertices and whose ideal of relations has generators that are graded commutators corresponding to…

Let $g_1,\dots, g_s \in \mathbb{R}[X_1,\dots, X_n,Y]$ and $S = \{(\bar{x},y)\in \mathbb{R}^{n+1} \mid g_1(\bar{x},y) \ge 0, \dots, g_s(\bar{x}, y) \ge 0\}$ be a non-empty, possibly unbounded, subset of a cylinder in $\mathbb{R}^{n+1}$. Let…

We show that any symmetric positive definite homogeneous matrix polynomial $M\in\R[x_1,...,x_n]^{m\times m}$ admits a piecewise semi-certificate, i.e. a collection of identites $M(x)=\sum_jf_{i,j}(x)U_{i,j}(x)^TU_{i,j}(x)$ where…

Real Nullstellensatz is a classical result from Real Algebraic Geometry. It has recently been extended to quaternionic polynomials by Alon and Paran. The aim of this paper is to extend their Quaternionic Nullstellensatz to matrix…

Template abstract domains allow to express more interesting properties than classical abstract domains. However, template generation is a challenging problem when one uses template abstract domains for program analysis. In this paper, we…

Since the beginning of the development of interior-point methods, there exists a puzzling gap between the results in theory and the observations in numerical experience, i.e., algorithms with good polynomial bound are not computationally…

The purpose of this paper is to explore the question "to what extent could we produce formal, machine-verifiable, proofs in real algebraic geometry?" The question has been asked before but as yet the leading algorithms for answering such…

Nash and Tognoli show that smooth closed manifolds can be the zero sets of some real polynomial maps and non-singular. The canonical projections of spheres naturally embedded in the $1$-dimensional higher Euclidean spaces and some natural…

This paper proposes an efficient algorithm for testing copositivity of homogeneous polynomials over the positive semidefinite cone. The algorithm is based on a novel matrix optimization reformulation and requires solving a hierarchy of…

$ \newcommand{\ie}{i.\,e.} $We introduce a hitting set generator for Polynomial Identity Testing based on evaluations of low-degree univariate rational functions at abscissas associated with the variables. We establish an equivalence up to…

The celebrated Skolem-Mahler-Lech Theorem states that the set of zeros of a linear recurrence sequence is the union of a finite set and finitely many arithmetic progressions. The corresponding computational question, the Skolem Problem,…

Criterions for constancy of the holomorphic sectional curvature and the antiholomorphic sectional curvature are proved for almost Hermitian manifolds. It is shown, that an almost Hermitian manifold satisfying the axiom of antiholomorphic…

This paper presents algorithms for solving multiobjective integer programming problems. The algorithm uses Barvinok's rational functions of the polytope that defines the feasible region and provides as output the entire set of nondominated…

A cofactor representation of an ideal element, that is, a representation in terms of the generators, can be considered as a certificate for ideal membership. Such a representation is typically not unique, and some can be a lot more…

Interpolation of jointly infeasible predicates plays important roles in various program verification techniques such as invariant synthesis and CEGAR. Intrigued by the recent result by Dai et al.\ that combines real algebraic geometry and…

Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion…

Approximating a function with a finite series, e.g., involving polynomials or trigonometric functions, is a critical tool in computing and data analysis. The construction of such approximations via now-standard approaches like least squares…

We have developed in the past several algorithms with intrinsic complexity bounds for the problem of point finding in real algebraic varieties. Our aim here is to give a comprehensive presentation of the geometrical tools which are…

The paper introduces new sufficient conditions of strict positive definiteness for kernels on d-dimensional spheres which are not radially symmetric but possess specific coefficient structures. The results use the series expansion of the…

For finite abstract simplicial complex $\Sigma$, initial realization $\alpha$ in $\mathbb{E}^d$, and desired edge lengths $L$, we give practical sufficient conditions for the existence of a non-self-intersecting perturbation of $\alpha$…