Related papers: Graph kinematics of discrete physical objects: bey…
In this series, we introduce and investigate the concept of connectoids, which captures the connectivity structure of various discrete objects such as undirected graphs, directed graphs, bidirected graphs, hypergraphs and finitary matroids.…
This paper aims to relate some properties of photon-like objects, considered as spatially finite time-stable physical entities with dynamical structure, to well defined properties of the corresponding electromagnetic strains defined as Lie…
There are several interrelated notions of discrete curvature on graphs. Many approaches utilize the optimal transportation metric on its probability simplex or the distance matrix of the graph. In this survey article, we compute formulas…
In a 6D model, where the extra dimensions form a discretised curved disk, we investigate the mass spectra and profiles of gravitons and Dirac fermions. The discretisation is performed in detail leading to a star-like geometry. In addition,…
A discrete theory of gravity locally invariant under the Poincar\'e group is considered as in a companion paper. We define a first order theory, in the sense of Palatini, on the metric-dual Voronoi complex of a simplicial complex. We follow…
Connected networks are a fundamental structure of neurobiology. Understanding these networks will help us elucidate the neural mechanisms of computation. Mathematically speaking these networks are `graphs' - structures containing objects…
The search for a mathematical foundation for the path integral of Euclidean quantum gravity calls for the construction of random geometry on the spacetime manifold. Following developments in physics on the two-dimensional theory, random…
The geometry of two-dimensional crystalline membranes dictates their mechanical, electronic and chemical properties. The local geometry of a surface is determined from the two invariants of the metric and the curvature tensors. Here we…
Gravitational waves from merging compact objects provides the opportunity to explore the properties of black holes and neutron stars in the strong regime of gravity. It is therefore of interest to explore the theoretical model that…
Shortcut sets are a vital instrument for reducing the diameter of a static graph and, consequently, its shortest path complexity, which is relevant in numerous subfields of graph theory. We explore the notion of shortcut sets in temporal…
We consider a dynamical system on a metric graph, that corresponds to a semiclassical solution of a time-dependent Schr\"odinger equation. We omit all details concerning mathematical physics and work with a purely discrete problem. We find…
The concept of torsion in geometry, although known for a long time, has not gained considerable attention by the physics community until relatively recently, due to its diverse and potentially important applications to a plethora of…
Diagrammatic approaches to perturbation theory transformed the practicability of calculations in particle physics. In the case of extended theories of gravity, however, obtaining the relevant diagrammatic rules is non-trivial: we must…
The purpose of this paper is to present an introduction to a point of view for discrete foundations of physics. In taking a discrete stance, we find that the initial expression of physical theory must occur in a context of noncommutative…
The present paper studies the post-Newtonian dynamics of N bodies in general relativity. We derive covariant equations of translational and rotational motion of N extended bodies having arbitrary distribution of mass and velocity of matter…
We study the physics of a single discrete gravitational extra dimension using the effective field theory for massive gravitons. We first consider a minimal discretization with 4D gravitons on the sites and nearest neighbor hopping terms. At…
Minimum spanning trees and forests are powerful sparsification techniques that remove cycles from weighted graphs to minimize total edge weight while preserving node connectivity. They have applications in computer science, network science,…
Defining distances over finite fields formally by $||x-y||:=(x_1-y_1)^2+\cdots + (x_d-y_d)^2$ for $x,y\in \mathbb{F}_q^d$, distance problems naturally arise in analogy to those studied by Erd\H{o}s and Falconer in Euclidean space. Given a…
It is argued that quantum traveling of D-particles presents the ``joining-splitting'' processes of field theory Feynman graphs. The amplitudes in $d$ dimensions can be corresponded with those of a $d+2$ dimensional theory in the Light-Cone…
In this paper we study the Steiner tree problem over a dynamic set of terminals. We consider the model where we are given an $n$-vertex graph $G=(V,E,w)$ with positive real edge weights, and our goal is to maintain a tree which is a good…