Zigzags in combinatorial tetrahedral chains and the associated Markov chain
From MaRDI portal
Publication:6642300
DOI10.1007/S00454-024-00631-3MaRDI QIDQ6642300
Publication date: 22 November 2024
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Geometric probability and stochastic geometry (60D05) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorial representation of tetrahedral chains
- PentHex puzzles. A reliable and efficient top-down approach to fullerene-structure enumeration
- An asymptotically closed loop of tetrahedra
- \(Z\)-knotted and \(Z\)-homogeneous triangulations of surfaces
- \(z\)-knotted triangulations of surfaces
- Connected sums of \(z\)-knotted triangulations
- On two types of \(Z\)-monodromy in triangulations of surfaces
- Geometric structure of chemistry-relevant graphs. Zigzags and central circuits
- A homological solution for the Gauss code problem in arbitrary surfaces
- Triangulations and applications
- Graphs on surfaces
- On chains of regular tetrahedra
- Finite Markov Chains and Algorithmic Applications
- Z-oriented triangulations of surfaces
- On lacets and their manifolds
Related Items (1)
This page was built for publication: Zigzags in combinatorial tetrahedral chains and the associated Markov chain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6642300)