We derive a general formula for the fine structure constant in D-dimensional space in the International System of Units. Our formula for the fine structure constant in D-dimensional space will be useful for future studies in theories with higher spatial dimensions and in time variation of the fine

Abstract not found

be applied in a three-dimensional space. Finally, we generalize them to d-dimensional space.

protocol can be used for nodes located in d-dimensional Euclidean spaces (d ≥ 2). Third, node locations are specified by coordinates which may be accurate, inaccurate, or arbitrary. Conceptually, our routing structure consists of a Delaunay triangulation (DT) overlay on an arbitrary connectivity graph. We

A measurement is a quantitative description of the transformation required to carry one state to another state. For example, measuring the position of an object involves determining what translation and rotations that will move the axes

We investigate ideal quantum gases in D-dimensional space and confined in a generic external potential by using the semiclassical approximation. In particular, we derive density of states, density profiles and critical temperatures for Fermions and Bosons trapped in isotropic power-law potentials

We study a natural information dissemination problem for multiple mobile agents in a bounded Euclidean space. Agents are placed uniformly at random in the d-dimensional space {−n,..., n} d at time zero, and one of the agents holds a piece of information to be disseminated. All the agents

In this letter, we compute the corrections to the fine structure constant in D-dimensional space. These corrections stem from the generalized uncertainty principle. We also calculate the time variation of the corrected fine structure constant. 1

Almost all geographic routing protocols have been designed for 2D. We present a novel geographic routing protocol, MDT, for 2D, 3D, and higher dimensions with these properties: (i) guaranteed delivery for any connected graph of nodes and physical links, and (ii) low routing stretch from efficient

We present a new algorithm for reliable computation of the Euclidean Voronoi diagram vertex for a set of spheres in a xed length oating-point arithmetic. The algorithm is provided for the d-dimensional case and is implemented for the 3-dimensional Voronoi diagram of a set of spheres.