Search arXivSearch

arXiv · 2004.14810

Some Relativistic and Gravitational Properties of the Wolfram Model

Abstract

The Wolfram Model, which is a slight generalization of the model first introduced by Stephen Wolfram in A New Kind of Science (NKS), is a discrete spacetime formalism in which space is represented by a hypergraph whose dynamics are determined by abstract replacement operations on set systems, and in which the conformal structure of spacetime is represented by a causal graph. The purpose of this article is to present rigorous mathematical derivations of many key properties of such models in the continuum limit, as first discussed in NKS, including the fact that large classes of them obey discrete forms of both special and general relativity. First, we prove that causal invariance (namely, the requirement that all causal graphs be isomorphic, irrespective of the choice of hypergraph updating order) is equivalent to a discrete version of general covariance, with changes to the updating order corresponding to discrete gauge transformations. This fact then allows one to deduce a discrete analog of Lorentz covariance, and the resultant physical consequences of discrete Lorentz transformations. We also introduce discrete notions of Riemann and Ricci curvature for hypergraphs, and prove that the correction factor for the volume of a discrete spacetime cone in a causal graph corresponding to curved spacetime of fixed dimensionality is proportional to a timelike projection of the discrete spacetime Ricci tensor, subsequently using this fact (along with the assumption that the updating rules preserve the dimensionality of the causal graph in limiting cases) to prove that the most general set of constraints on the discrete spacetime Ricci tensor corresponds to a discrete form of the Einstein field equations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jonathan Gorard. 2021-10-18. Some Relativistic and Gravitational Properties of the Wolfram Model. https://doi.org/10.25088/complexsystems.29.2.599

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Factorisability of Low Dimensional Non-Negative Integer Matrices

We consider the problem of determining if a given two-dimensional nonnegative integer matrix $M$ is the product of two such matrices, excluding trivial units. A matrix $M$ with no such factorisation is called prime and therefore belongs to the minimal (infinite rank) generator of $2 \times 2$ matrices over the natural numbers, otherwise it is called composite. We also consider the problem of finding a (non-unique) factorisation of a composite matrix. Our results have applications in computational group theory and the theory of codes, where such matrices are called incidence matrices. We analyse the complexity of primality and finding a factorisation for a composite matrix, providing a first efficient algorithm.

cs.DM

The parameterised complexity of generalised temporal domination on temporal graphs with modular structure

Inspired by the static problem $(α,β)$-Dominating Set, we propose a general temporal domination problem, called $(α,β)$-Temporal Dominating Set ($(α,β)$-TDS). We show that this problem encompasses Temporal Dominating Set, and additionally provides first temporal extensions of problems such as $k$-Dominating Set and $α$-Dominating Set. In this paper, we study the parameterised complexity of $(α,β)$-TDS with respect to temporal neighbourhood diversity (TND), temporal modular-width (TMW), and temporal cliquewidth (TCW). We obtain fixed parameter tractability results for all values of $α$ and $β$ with respect to TND; W[1]-hardness with respect to TMW and TCW whenever $β$ is in the problem input, or whenever $α\in (0,1)$ and $β$ is a fixed constant; and para-NP-hardness with respect to TCW when $α= 0$ and $β= 1$, or $α= 1$ and $β= 0$.

cs.DM