207 research outputs found
Thomas Decomposition of Algebraic and Differential Systems
In this paper we consider disjoint decomposition of algebraic and non-linear
partial differential systems of equations and inequations into so-called simple
subsystems. We exploit Thomas decomposition ideas and develop them into a new
algorithm. For algebraic systems simplicity means triangularity, squarefreeness
and non-vanishing initials. For differential systems the algorithm provides not
only algebraic simplicity but also involutivity. The algorithm has been
implemented in Maple
Computing topological zeta functions of groups, algebras, and modules, II
Building on our previous work (arXiv:1405.5711), we develop the first
practical algorithm for computing topological zeta functions of nilpotent
groups, non-associative algebras, and modules. While we previously depended
upon non-degeneracy assumptions, the theory developed here allows us to
overcome these restrictions in various interesting cases.Comment: 33 pages; sequel to arXiv:1405.571
Efficiently and Effectively Recognizing Toricity of Steady State Varieties
We consider the problem of testing whether the points in a complex or real variety with non-zero coordinates form a multiplicative group or, more generally, a coset of a multiplicative group. For the coset case, we study the notion of shifted toric varieties which generalizes the notion of toric varieties. This requires a geometric view on the varieties rather than an algebraic view on the ideals. We present algorithms and computations on 129 models from the BioModels repository testing for group and coset structures over both the complex numbers and the real numbers. Our methods over the complex numbers are based on Gr\"obner basis techniques and binomiality tests. Over the real numbers we use first-order characterizations and employ real quantifier elimination. In combination with suitable prime decompositions and restrictions to subspaces it turns out that almost all models show coset structure. Beyond our practical computations, we give upper bounds on the asymptotic worst-case complexity of the corresponding problems by proposing single exponential algorithms that test complex or real varieties for toricity or shifted toricity. In the positive case, these algorithms produce generating binomials. In addition, we propose an asymptotically fast algorithm for testing membership in a binomial variety over the algebraic closure of the rational numbers
Algorithmic Thomas Decomposition of Algebraic and Differential Systems
In this paper, we consider systems of algebraic and non-linear partial
differential equations and inequations. We decompose these systems into
so-called simple subsystems and thereby partition the set of solutions. For
algebraic systems, simplicity means triangularity, square-freeness and
non-vanishing initials. Differential simplicity extends algebraic simplicity
with involutivity. We build upon the constructive ideas of J. M. Thomas and
develop them into a new algorithm for disjoint decomposition. The given paper
is a revised version of a previous paper and includes the proofs of correctness
and termination of our decomposition algorithm. In addition, we illustrate the
algorithm with further instructive examples and describe its Maple
implementation together with an experimental comparison to some other
triangular decomposition algorithms.Comment: arXiv admin note: substantial text overlap with arXiv:1008.376
Algorithmic Boundedness-From-Below Conditions for Generic Scalar Potentials
Checking that a scalar potential is bounded from below (BFB) is an ubiquitous
and notoriously difficult task in many models with extended scalar sectors.
Exact analytic BFB conditions are known only in simple cases. In this work, we
present a novel approach to algorithmically establish the BFB conditions for
any polynomial scalar potential. The method relies on elements of multivariate
algebra, in particular, on resultants and on the spectral theory of tensors,
which is being developed by the mathematical community. We give first a
pedagogical introduction to this approach, illustrate it with elementary
examples, and then present the working Mathematica implementation publicly
available at GitHub. Due to the rapidly increasing complexity of the problem,
we have not yet produced ready-to-use analytical BFB conditions for new
multi-scalar cases. But we are confident that the present implementation can be
dramatically improved and may eventually lead to such results.Comment: 27 pages, 2 figures; v2: added reference
Segre Class Computation and Practical Applications
Let be closed (possibly singular) subschemes of a smooth
projective toric variety . We show how to compute the Segre class
as a class in the Chow group of . Building on this, we give effective
methods to compute intersection products in projective varieties, to determine
algebraic multiplicity without working in local rings, and to test pairwise
containment of subvarieties of . Our methods may be implemented without
using Groebner bases; in particular any algorithm to compute the number of
solutions of a zero-dimensional polynomial system may be used
New Results on Triangulation, Polynomial Equation Solving and Their Application in Global Localization
This thesis addresses the problem of global localization from images. The overall goal is to find the location and the direction of a camera given an image taken with the camera relative a 3D world model. In order to solve the problem several subproblems have to be handled. The two main steps for constructing a system for global localization consist of model building and localization. For the model construction phase we give a new method for triangulation that guarantees that the globally optimal position is attained under the assumption of Gaussian noise in the image measurements. A common framework for the triangulation of points, lines and conics is presented. The second contribution of the thesis is in the field of solving systems of polynomial equations. Many problems in geometrical computer vision lead to computing the real roots of a system of polynomial equations, and several such geometry problems appear in the localization problem. The method presented in the thesis gives a significant improvement in the numerics when Gröbner basis methods are applied. Such methods are often plagued by numerical problems, but by using the fact that the complete Gröbner basis is not needed, the numerics can be improved. In the final part of the thesis we present several new minimal, geometric problems that have not been solved previously. These minimal cases make use of both two and three dimensional correspondences at the same time. The solutions to these minimal problems form the basis of a localization system which aims at improving robustness compared to the state of the art
- …