Related papers: Some Ideas to Test if a Polyhedron is Empty
In this paper, we present experimental algorithms for solving the dualization problem. We present the results of extensive experimentation comparing the execution time of various algorithms.
A simple algebraic approach to the study of multipartite entanglement for pure states is introduced together with a class of suitable functionals able to detect entanglement. On this basis, some known results are reproduced. Indeed, by…
We use the generalized concurrence approach to investigate the general multipartite separability problem. By extending the preconcurrence matrix formalism to arbitrary multipartite systems, we show that the separability problem can be…
We study algebraic properties of full rank 1 algebras in a general framework and derive a method to verify if one such matrix polynomial sub-algebra is bispectral. We give two examples illustrating the method. In the first one, we consider…
This is an experimental case study in real algebraic geometry, aimed at computing the image of a semialgebraic subset of 3-space under a polynomial map into the plane. For general instances, the boundary of the image is given by two highly…
We study oriented connected closed polyhedral surfaces with non-degenerate triangular faces in three-dimensional Euclidean space, calling them polyhedra for short. A polyhedron is called flexible if its spatial shape can be changed…
In this paper, we develop a new deflation technique for refining or verifying the isolated singular zeros of polynomial systems. Starting from a polynomial system with an isolated singular zero, by computing the derivatives of the input…
We discuss a cheap tetrahedra-free approach to the numerical integration of polynomials on polyhedral elements, based on hyperinterpolation in a bounding box and Chebyshev moment computation via the divergence theorem. No conditioning…
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…
Generalized symmetry integrability test for discrete equations on the square lattice is studied. Integrability conditions are discussed. A method for searching higher symmetries (including non-autonomous ones) for quad graph equations is…
We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…
Property testers are fast, randomized "election polling"-type algorithms that determine if an input (e.g., graph or hypergraph) has a certain property or is $\varepsilon$-far from the property. In the dense graph model of property testing,…
Deciding whether the union of two convex polyhedra is itself a convex polyhedron is a basic problem in polyhedral computations; having important applications in the field of constrained control and in the synthesis, analysis, verification…
We propose a quantum algorithm to solve systems of nonlinear algebraic equations. In the ideal case the complexity of the algorithm is linear in the number of variables $n$, which means our algorithm's complexity is less than $O(n^{3})$ of…
We provide an algorithm for unfolding the surface of any orthogonal polyhedron that falls into a particular shape class we call Manhattan Towers, to a nonoverlapping planar orthogonal polygon. The algorithm cuts along edges of a 4x5x1…
We introduce the completeness problem for Modal Logic and examine its complexity. For a definition of completeness for formulas, given a formula of a modal logic, the completeness problem asks whether the formula is complete for that logic.…
Planarity Testing is the problem of determining whether a given graph is planar while planar embedding is the corresponding construction problem. The bounded space complexity of these problems has been determined to be exactly Logspace by…
We present a survey of the saturation method for model-checking pushdown systems.
Many combinatorial problems can be formulated as a polynomial optimization problem that can be solved by state-of-the-art methods in real algebraic geometry. In this paper we explain many important methods from real algebraic geometry, we…
We present subquadratic algorithms, in the algebraic decision-tree model of computation, for detecting whether there exists a triple of points, belonging to three respective sets $A$, $B$, and $C$ of points in the plane, that satisfy a…