Extending the notion of indispensable binomials of a toric ideal ((14), (7)), we define indispensable monomials of a toric ideal and establish some of their properties. They are u...
We present an algorithm for computing generators for the ideal of algebraic relations among sequences which are given by homogeneous linear recurrence equations with constant coef...
Narrowing is a computation implemented by some declarative programming languages. Research in the last decade has produced significant results on the theory and foundation of nar...
We examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. the Hamming graph H(n, 2). We find the automorphism groups and the parameters of the cod...
The topic of this article is decision procedures for satisfiability modulo theories (SMT) of arbitrary quantifier-free formulæ. We propose an approach that decomposes the formu...