Related papers: Connectivity in Semi-Algebraic Sets I
Answering connectivity queries in real algebraic sets is a fundamental problem in effective real algebraic geometry that finds many applications in e.g. robotics where motion planning issues are topical. This computational problem is…
Given $m\in \mathbb{N},$ a numerical semigroup with multiplicity $m$ is called packed numerical semigroup if its minimal generating set is included in $\{m,m+1,\ldots, 2m-1\}.$ In this work, packed numerical semigroups are used to built the…
Numerical semigroup rings are investigated from the relative viewpoint. It is known that algebraic properties such as singularities of a numerical semigroup ring are properties of a flat numerical semigroup algebra. In this paper, we show…
Symmetry plays a central role in accelerating symbolic computation involving polynomials. This chapter surveys recent developments and foundational methods that leverage the inherent symmetries of polynomial systems to reduce complexity,…
In this article, we show that the algebraic degree in semidefinite programming can be expressed in terms of the coefficient of a certain monomial in a doubly symmetric polynomial. This characterization of the algebraic degree allows us to…
The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…
The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…
Given a polynomial system f, a fundamental question is to determine if f has real roots. Many algorithms involving the use of infinitesimal deformations have been proposed to answer this question. In this article, we transform an approach…
The pseudo-Frobenius numbers of a numerical semigroup are those gaps of the numerical semigroup that are maximal for the partial order induced by the semigroup. We present a procedure to detect if a given set of integers is the set of…
In this paper, we prove that the numerical-semigroup-gap counting problem is #NP-complete as a main theorem. A numerical semigroup is an additive semigroup over the set of all nonnegative integers. A gap of a numerical semigroup is defined…
We prove that the height of any algebraic computation tree for deciding membership in a semialgebraic set is bounded from below (up to a multiplicative constant) by the logarithm of m-th Betti number (with respect to singular homology) of…
Answering connectivity queries in semi-algebraic sets is a long-standing and challenging computational issue with applications in robotics, in particular for the analysis of kinematic singularities. One task there is to compute the number…
A numerical semigroup $S$ is a cofinite, additively-closed subset of the nonnegative integers that contains $0$. In this paper, we initiate the study of atomic density, an asymptotic measure of the proportion of irreducible elements in a…
We call a finite, spanning set of a semi-simple real Lie algebra a distinguished set if it satisfies the following property: The Lie bracket of any two elements out of the set is, up to some constant, another element in the set; conversely,…
In this paper, we are concerned with the problem of determining the existence of multiple equilibria in economic models. We propose a general and complete approach for identifying multiplicities of equilibria in semi-algebraic economies,…
We deal with equations over free semilattice of infinite rank and prove that any infinite consistent system of equations is equivalent to its finite subsystem. Moreover, we describe irreducible algebraic sets and solve some algorithmic…
Two subanalytic subsets of R^n are called s-equivalent at a common point P if the Hausdorff distance between their intersections with the sphere centered at P of radius r vanishes of order greater than s when r tends to 0. In this paper we…
The field of numerical algebraic geometry consists of algorithms for numerically solving systems of polynomial equations. When the system is exact, such as having rational coefficients, the solution set is well-defined. However, for a…
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue:…
This paper is aimed at introducing an algebraic model for physical scales and units of measurement. This goal is achieved by means of the concept of ``positive space'' and its rational powers. Positive spaces are 1-dimensional ``semi-vector…