Syzygies for Metropolis base chains
DOI10.1016/J.LAA.2010.12.021zbMATH Open1211.60032OpenAlexW2022912816MaRDI QIDQ632467FDOQ632467
Publication date: 25 March 2011
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2010.12.021
Computational methods in Markov chains (60J22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Syzygies, resolutions, complexes and commutative rings (13D02)
Cites Work
- Statistical problems involving permutations with restricted positions
- Monte Carlo strategies in scientific computing
- Fast projection methods for minimal design problems in linear system theory
- Polynomials for classification trees and applications
- \(n\)D polynomial matrices with applications to multidimensional signal analysis
- Indicator function and complex coding for mixed fractional factorial designs
- On the complexity of computing syzygies
- Algebraic algorithms for sampling from conditional distributions
- On syzygy modules for polynomial matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Uses Software
This page was built for publication: Syzygies for Metropolis base chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632467)
