Sciweavers

53 search results - page 7 / 11
» jsc 2008
Sort
View
JSC
2008
56views more  JSC 2008»
13 years 8 months ago
Indispensable monomials of toric ideals and Markov bases
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...
Satoshi Aoki, Akimichi Takemura, Ruriko Yoshida
JSC
2008
96views more  JSC 2008»
13 years 8 months ago
Computing the algebraic relations of C-finite sequences and multisequences
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...
Manuel Kauers, Burkhard Zimmermann
JSC
2010
105views more  JSC 2010»
13 years 7 months ago
Programming with narrowing: A tutorial
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...
Sergio Antoy
JSC
2010
132views more  JSC 2010»
13 years 7 months ago
Binary codes from the line graph of the n-cube
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...
W. Fish, Jennifer D. Key, E. Mwambene
JSC
2010
120views more  JSC 2010»
13 years 7 months ago
Theory decision by decomposition
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...
Maria Paola Bonacina, Mnacho Echenim