#### Filter Results:

- Full text PDF available (35)

#### Publication Year

1986

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Luis David García-Puente, Michael Stillman, Bernd Sturmfels
- J. Symb. Comput.
- 2005

We study the algebraic varieties defined by the conditional independence statements of Bayesian networks. A complete algebraic classification is given for Bayesian networks on at most five random variables. Hidden variables are related to the geometry of higher secant varieties.

- David Bayer, Michael Stillman
- J. Symb. Comput.
- 1992

- E. Becker, M. Bronstein, +6 authors Bernd Sturmfels
- 2001

- Irena Peeva, Mike Stillman
- 1999

We obtain local equations for the toric Hilbert scheme, which parametrizes all ideals with the same multigraded Hilbert function as a given toric ideal. We also prove a conjecture of Sturmfels' providing a criterion for an ideal to have such a Hilbert function.

Multivariate polynomial dynamical systems over finite fields have been studied in several contexts, including engineering and mathematical biology. An important problem is to construct models of such systems from a partial specification of dynamic properties, e.g., from a collection of state transition measurements. Here, we consider static models, which… (More)

- Roberto La Scala, Michael Stillman
- J. Symb. Comput.
- 1998

In the present paper we study algorithms based on the theory of Gröbner bases for computing free resolutions of modules over polynomial rings. We propose a technique which consists in the application of special selection strategies to the Schreyer algorithm. The resulting algorithm is efficient and, in the graded case, allows a straightforward… (More)

We show that the Hilbert scheme, that parametrizes all ideals with the same Hilbert function over an exterior algebra, is connected. We give a new proof of Hartshorne's Theorem that the classical Hilbert scheme is connected. More precisely: if Q is either a polynomial ring or an exterior algebra, we prove that every two strongly stable ideals in Q with the… (More)

- Bjarke Hammersholt Roune, Michael Stillman
- ISSAC
- 2012

We report on our experiences exploring state of the art Gröbner basis computation. We investigate signature based algorithms in detail. We also introduce new practical data structures and computational techniques for use in both signature based Gröbner basis algorithms and more traditional variations of the classic Buchberger algorithm. Our… (More)

- David Bayer, Michael Stillman
- J. Symb. Comput.
- 1988