The Art Gallery Problem is ∃ℝ-complete

The Art Gallery Problem (AGP) is a classic problem in computational geometry, introduced in 1973 by Victor Klee. Given a simple polygon 풫 and an integer k , the goal is to decide if there exists a set G of k guards within 풫 such that every point p ∈ 풫 is seen by at least one guard g ∈ G . Each guard corresponds to a point in the polygon 풫, and we say that a guard g sees a point p if the line segment pg is contained in 풫. We prove that the AGP is ∃ ℝ-complete, implying that (1) any system of polynomial equations over the real numbers can be encoded as an instance of the AGP, and (2) the AGP is not in the complexity class NP unless NP = ∃ ℝ. As a corollary of our construction, we prove that for any real algebraic number α, there is an instance of the AGP where one of the coordinates of the guards equals α in any guard set of minimum cardinality. That rules out many natural geometric approaches to the problem, as it shows that any approach based on constructing a finite set of candidate points for placing guards has to include points with coordinates being roots of polynomials with arbitrary degree. As an illustration of our techniques, we show that for every compact semi-algebraic set S ⊆ [0, 1] 2 , there exists a polygon with corners at rational coordinates such that for every p ∈ [0, 1] 2 , there is a set of guards of minimum cardinality containing p if and only if p ∈ S . In the ∃ ℝ-hardness proof for the AGP, we introduce a new ∃ ℝ-complete problem ETR-INV. We believe that this problem is of independent interest, as it has already been used to obtain ∃ ℝ-hardness proofs for other problems.

Galerkin Method for Nonlinear Higher-Order Boundary Value Problems Based on Chebyshev Polynomials

In the current paper, we develop an algorithm to approximate the analytic solution for the nonlinear boundary value problems in higher-order based on the Galerkin method. Chebyshev polynomials are introduced as bases of the solution. Meanwhile, some theorems are deducted to simplify the nonlinear algebraic set resulted from applying the Galerkin method, while Newton’s method is used to solve the resulting nonlinear system. Numerous examples are presented to prove the usefulness and effectiveness of this algorithm in comparison with some other methods.

Algebraic surfaces determine analyticity of functions

Let $$f :X \rightarrow \mathbb {R}$$ f : X → R be a function defined on a nonsingular real algebraic set X of dimension at least 3. We prove that f is an analytic (resp. a Nash) function whenever the restriction $$f|_{S}$$ f | S is an analytic (resp. a Nash) function for every nonsingular algebraic surface $$S \subset X$$ S ⊂ X whose each connected component is homeomorphic to the unit 2-sphere. Furthermore, the surfaces S can be replaced by compact nonsingular algebraic curves in X, provided that dim$$X \ge 2$$ X ≥ 2 and f is of class $$\mathcal {C}^{\infty }$$ C ∞ .

Recognition and Analysis of Image Patterns Based on Latin Squares by Means of Computational Algebraic Geometry

With the particular interest of being implemented in cryptography, the recognition and analysis of image patterns based on Latin squares has recently arisen as an efficient new approach for classifying partial Latin squares into isomorphism classes. This paper shows how the use of a Computer Algebra System (CAS) becomes necessary to delve into this aspect. Thus, the recognition and analysis of image patterns based on these combinatorial structures benefits from the use of computational algebraic geometry to determine whether two given partial Latin squares describe the same affine algebraic set. This paper delves into this topic by focusing on the use of a CAS to characterize when two partial Latin squares are either partial transpose or partial isotopic.

A semi-canonical reduction for periods of Kontsevich–Zagier

The [Formula: see text]-algebra of periods was introduced by Kontsevich and Zagier as complex numbers whose real and imaginary parts are values of absolutely convergent integrals of [Formula: see text]-rational functions over [Formula: see text]-semi-algebraic domains in [Formula: see text]. The Kontsevich–Zagier period conjecture affirms that any two different integral expressions of a given period are related by a finite sequence of transformations only using three rules respecting the rationality of the functions and domains: additions of integrals by integrands or domains, change of variables and Stokes formula. In this paper, we prove that every non-zero real period can be represented as the volume of a compact [Formula: see text]-semi-algebraic set obtained from any integral representation by an effective algorithm satisfying the rules allowed by the Kontsevich–Zagier period conjecture.

Smooth points on semi-algebraic sets

Many algorithms for determining properties of semi-algebraic sets rely upon the ability to compute smooth points [1]. We present a simple procedure based on computing the critical points of some well-chosen function that guarantees the computation of smooth points in each connected bounded component of a real atomic semi-algebraic set. Our technique is intuitive in principal, performs well on previously difficult examples, and is straightforward to implement using existing numerical algebraic geometry software. The practical efficiency of our approach is demonstrated by solving a conjecture on the number of equilibria of the Kuramoto model for the n = 4 case. We also apply our method to design an efficient algorithm to compute the real dimension of algebraic sets, the original motivation for this research.

Towards fast one-block quantifier elimination through generalised critical values

One-block quantifier elimination is comprised of computing a semi-algebraic description of the projection of a semi-algebraic set or of deciding the truth of a semi-algebraic formula with a single quantifier.

Doubling coverings via resolution of singularities and preparation

In this paper, we provide asymptotic upper bounds on the complexity in two (closely related) situations. We confirm for the total doubling coverings and not only for the chains the expected bounds of the form [Formula: see text] This is done in a rather general setting, i.e. for the [Formula: see text]-complement of a polynomial zero-level hypersurface [Formula: see text] and for the regular level hypersurfaces [Formula: see text] themselves with no assumptions on the singularities of [Formula: see text]. The coefficient [Formula: see text] is the ambient dimension [Formula: see text] in the first case and [Formula: see text] in the second case. However, the question of a uniform behavior of the coefficient [Formula: see text] remains open. As a second theme, we confirm in arbitrary dimension the upper bound for the number of a-charts covering a real semi-algebraic set [Formula: see text] of dimension [Formula: see text] away from the [Formula: see text]-neighborhood of a lower dimensional set [Formula: see text], with bound of the form [Formula: see text] holding uniformly in the complexity of [Formula: see text]. We also show an analogue for level sets with parameter away from the [Formula: see text]-neighborhood of a low dimensional set. More generally, the bounds are obtained also for real subanalytic and real power-subanalytic sets.