Adapting Real Quantifier Elimination Methods for Conflict Set Computation

The satisfiability problem in real closed fields is decidable. In the context of satisfiability modulo theories, the problem restricted to conjunctive sets of literals, that is, sets of polynomial constraints, is of particular importance. One of the central problems is the computation of good explanations of the unsatisfiability of such sets, i.e.\ obtaining a small subset of the input constraints whose conjunction is already unsatisfiable. We adapt two commonly used real quantifier elimination methods, cylindrical algebraic decomposition and virtual substitution, to provide such conflict sets and demonstrate the performance of our method in practice

Exact results for the star lattice chiral spin liquid

We examine the star lattice Kitaev model whose ground state is a a chiral spin liquid. We fermionize the model such that the fermionic vacua are toric code states on an effective Kagome lattice. This implies that the Abelian phase of the system is inherited from the fermionic vacua and that time reversal symmetry is spontaneously broken at the level of the vacuum. In terms of these fermions we derive the Bloch-matrix Hamiltonians for the vortex free sector and its time reversed counterpart and illuminate the relationships between the sectors. The phase diagram for the model is shown to be a sphere in the space of coupling parameters around the triangles of the lattices. The abelian phase lies inside the sphere and the critical boundary between topologically distinct Abelian and non-Abelian phases lies on the surface. Outside the sphere the system is generically gapped except in the planes where the coupling parameters are zero. These cases correspond to bipartite lattice structures and the dispersion relations are similar to that of the original Kitaev honeycomb model. In a further analysis we demonstrate the three-fold non-Abelian groundstate degeneracy on a torus by explicit calculation.Comment: 7 pages, 8 figure

On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases

This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted class of weak deterministic automata, used as symbolic set representations in actual applications. In previous work, it has been established that the sets of numbers that are recognizable by weak deterministic automata in two bases that do not share the same set of prime factors are exactly those that are definable in the first order additive theory of real and integer numbers. This result extends Cobham's theorem, which characterizes the sets of integer numbers that are recognizable by finite automata in multiple bases. In this article, we first generalize this result to multiplicatively independent bases, which brings it closer to the original statement of Cobham's theorem. Then, we study the sets of reals recognizable by Muller automata in two bases. We show with a counterexample that, in this setting, Cobham's theorem does not generalize to multiplicatively independent bases. Finally, we prove that the sets of reals that are recognizable by Muller automata in two bases that do not share the same set of prime factors are exactly those definable in the first order additive theory of real and integer numbers. These sets are thus also recognizable by weak deterministic automata. This result leads to a precise characterization of the sets of real numbers that are recognizable in multiple bases, and provides a theoretical justification to the use of weak automata as symbolic representations of sets.Comment: 17 page

Adapting Real Quantifier Elimination Methods for Conflict Set Computation

International audienceThe satisfiability problem in real closed fields is decidable. In the context of satisfiability modulo theories, the problem restricted to conjunctive sets of literals, that is, sets of polynomial constraints, is of particular importance. One of the central problems is the computation of good explanations of the unsatisfiability of such sets, i.e. obtaining a small subset of the input constraints whose conjunction is already unsatisfiable. We adapt two commonly used real quantifier elimination methods, cylindrical algebraic decomposition and virtual substitution, to provide such conflict sets and demonstrate the performance of our method in practice

Deterministically Computing Reduction Numbers of Polynomial Ideals

We discuss the problem of determining reduction number of a polynomial ideal I in n variables. We present two algorithms based on parametric computations. The first one determines the absolute reduction number of I and requires computation in a polynomial ring with (n-dim(I))dim(I) parameters and n-dim(I) variables. The second one computes via a Grobner system the set of all reduction numbers of the ideal I and thus in particular also its big reduction number. However,it requires computations in a ring with n.dim(I) parameters and n variables.Comment: This new version replaces the earlier version arXiv:1404.1721 and it has been accepted for publication in the proceedings of CASC 2014, Warsaw, Polna

TheoryGuru: A Mathematica Package to Apply Quantifier Elimination Technology to Economics

We consider the use of Quantifier Elimination (QE) technology for automated reasoning in economics. There is a great body of work considering QE applications in science and engineering but we demonstrate here that it also has use in the social sciences. We explain how many suggested theorems in economics could either be proven, or even have their hypotheses shown to be inconsistent, automatically via QE. However, economists who this technology could benefit are usually unfamiliar with QE, and the use of mathematical software generally. This motivated the development of a Mathematica Package TheoryGuru, whose purpose is to lower the costs of applying QE to economics. We describe the package's functionality and give examples of its use.Comment: To appear in Proc ICMS 201

Satisfiability Checking and Symbolic Computation

Symbolic Computation and Satisfiability Checking are viewed as individual research areas, but they share common interests in the development, implementation and application of decision procedures for arithmetic theories. Despite these commonalities, the two communities are currently only weakly connected. We introduce a new project SC-square to build a joint community in this area, supported by a newly accepted EU (H2020-FETOPEN-CSA) project of the same name. We aim to strengthen the connection between these communities by creating common platforms, initiating interaction and exchange, identifying common challenges, and developing a common roadmap. This abstract and accompanying poster describes the motivation and aims for the project, and reports on the first activities.Comment: 3 page Extended Abstract to accompany an ISSAC 2016 poster. Poster available at http://www.sc-square.org/SC2-AnnouncementPoster.pd

Basic Module Theory over Non-Commutative Rings with Computational Aspects of Operator Algebras

The present text surveys some relevant situations and results where basic Module Theory interacts with computational aspects of operator algebras. We tried to keep a balance between constructive and algebraic aspects.Comment: To appear in the Proceedings of the AADIOS 2012 conference, to be published in Lecture Notes in Computer Scienc

Combined Decision Techniques for the Existential Theory of the Reals

Methods for deciding quantifier-free non-linear arithmetical conjectures over *** are crucial in the formal verification of many real-world systems and in formalised mathematics. While non-linear (rational function) arithmetic over *** is decidable, it is fundamentally infeasible: any general decision method for this problem is worst-case exponential in the dimension (number of variables) of the formula being analysed. This is unfortunate, as many practical applications of real algebraic decision methods require reasoning about high-dimensional conjectures. Despite their inherent infeasibility, a number of different decision methods have been developed, most of which have "sweet spots" --- e.g., types of problems for which they perform much better than they do in general. Such "sweet spots" can in many cases be heuristically combined to solve problems that are out of reach of the individual decision methods when used in isolation. RAHD ("Real Algebra in High Dimensions") is a theorem prover that works to combine a collection of real algebraic decision methods in ways that exploit their respective "sweet-spots." We discuss high-level mathematical and design aspects of RAHD and illustrate its use on a number of examples

A Linear Algebra Approach for Detecting Binomiality of Steady State Ideals of Reversible Chemical Reaction Networks

Motivated by problems from Chemical Reaction Network Theory, we investigate whether steady state ideals of reversible reaction networks are generated by binomials. We take an algebraic approach considering, besides concentrations of species, also rate constants as indeterminates. This leads us to the concept of unconditional binomiality, meaning binomiality for all values of the rate constants. This concept is different from conditional binomiality that applies when rate constant values or relations among rate constants are given. We start by representing the generators of a steady state ideal as sums of binomials, which yields a corresponding coefficient matrix. On these grounds we propose an efficient algorithm for detecting unconditional binomiality. That algorithm uses exclusively elementary column and row operations on the coefficient matrix. We prove asymptotic worst case upper bounds on the time complexity of our algorithm. Furthermore, we experimentally compare its performance with other existing methods