Velocity polytopes of periodic graphs and a no-go theorem for digital physics

DOI10.1016/J.DISC.2013.02.010zbMath1279.05040arXiv1109.1963OpenAlexW2011118188MaRDI QIDQ389478

Tobias Fritz

Publication date: 20 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.1963

zbMATH Keywords

voltage graphgain graphperiodic graphcycles in graphsdigital physicsperiodic net

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (1)

Intrinsic local distances: a mixed solution to Weyl's tile argument

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Periodic graphs
• Generating all graph coverings by permutation voltage assignments
• Spektren periodischer Graphen
• A mathematical bibliography of signed and gain graphs and allied areas
• Voltage graphs
• The quantum field as a quantum computer
• Emergence of space-time from topologically homogeneous causal networks
• Digital mechanics. An information process based on reversible universal cellular automata
• Nomenclature and generation of three-periodic nets: the vector method
• Algebraic Graph Theory
• Minimum Cost Paths in Periodic Graphs
• Crystal topologies – the achievable and inevitable symmetries
• Euclidian embeddings of periodic nets: definition of a topologically induced complete set of geometric descriptors for crystal structures

This page was built for publication: Velocity polytopes of periodic graphs and a no-go theorem for digital physics