Search arXivSearch

arXiv · 1212.2916

Causal cells: spacetime polytopes with null hyperfaces

Abstract

We consider polyhedra and 4-polytopes in Minkowski spacetime - in particular, null polyhedra with zero volume, and 4-polytopes that have such polyhedra as their hyperfaces. We present the basic properties of several classes of null-faced 4-polytopes: 4-simplices, "tetrahedral diamonds" and 4-parallelotopes. We propose a "most regular" representative of each class. The most-regular parallelotope is of particular interest: its edges, faces and hyperfaces are all congruent, and it features both null hyperplanes and null segments. A tiling of spacetime with copies of this polytope can be viewed alternatively as a lattice with null edges, such that each point is at the intersection of four lightrays in a tetrahedral pattern. We speculate on the relevance of this construct for discretizations of curved spacetime and for quantum gravity.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yasha Neiman. 2013-01-08. Causal cells: spacetime polytopes with null hyperfaces. https://doi.org/10.1007/s10711-012-9823-0

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO