Archimedean ice
The topic of this work is a specific configuration of graphs, so-called ices. They should not be confounded with cold physical objects (although some of them may play a role of the mathematical model for statistical physics properties of a real ice). Here an ice is the arrangement of arrows connecting lattice vertices in such a way that the numbers of arrows arriving to and departing from a lattice point are equal to each other. The Archimedean ice corresponds to bonds between vertices of Archimedean lattices defined via the tiling of a plane by regular polygons. The main results of the article consist of a series of theorems considering ice configurations and conditions for their mutual transformations and entropy properties for Kagome, triangular and 3.4.6.4 lattices.
- Sampling Eulerian orientations of triangular lattice graphs
- New two-dimensional ice models
- Diamond ice.
- scientific article; zbMATH DE number 1510579 (Why is no real title available?)
- The ice model on the three-dimensional Hanoi graph
- Generation-recombination magnetic monopole noise in 2D artificial spin ices
This page was built for publication: Archimedean ice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q379576)