A Theory of the Connectivity Dimensionality Field in Edge-Vertex Graphs and Discrete-Continuous Dual Spaces

Author: Thomas A. Manz <tom[a]space-mixing-theory.com>
Size: 91 pages (1.4 MB)
Reference: Journal of Space Mixing, 2008, 3, 1-91.

Over the years, a number of measures have been defined for the purpose of determining the number of independent dimensions contained in a space. The most common dimensionality measures are the topological dimensionality and various kinds of fractal dimensionalities. While each of these dimensionality measures is useful in its own right, none of them accurately quantifies the effective number of independent directions passing through locations contained in a local region of a space. This article introduces a new dimensionality measure, called the connectivity dimensionality field, which is the true measure for the effective number of independent directions passing through locations in a space. In contrast to the fractal dimensionality, the connectivity dimensionality field is a topological property because its value at each material location is invariant to deformations of the space preserving connectivity. The connectivity dimensionality field is a fundamental concept that applies to many different kinds of discrete spaces, continuous spaces, and discrete-continuous dual spaces. A discrete space is a space in which positions cannot be varied differentially, and a continuous space is a space in which positions can be varied differentially. A discrete-continuous dual space has complementary discrete and continuous representations, and a process called discrete-continuous dual matching relates the discrete and continuous representations to each other. This article formally defines two basic types of discrete-continuous duality: (a) asymptotic and (b) strict. A rigorous method is provided for computing the connectivity dimensionality field in edge-vertex graphs, continuous spaces, and discrete-continuous dual spaces. Many examples are given to illustrate the key concepts. Single points, unbranched lines, and periodic lattices are examples of discrete-continuous dual spaces in which the connectivity dimensionality field is a constant nonnegative integer. In other types of discrete-continuous dual spaces, the connectivity dimensionality field contains inherent uncertainty. For the first time, a comprehensive theory is derived that predicts the inherent uncertainty associated with the connectivity dimensionality field in discrete-continuous dual spaces. The study of discrete-continuous dual spaces with variable connectivity dimensionality fields transcends variable-based mathematics.

Keywords: connectivity dimensionality field, discrete-continuous duality, strictly and asymptotically discrete-continuous dual spaces, graph theory, edge-vertex graphs, large-world networks, lattices, fractals, topological dimensionality, fractal dimensionality, mathematical dimensionality, quartropy, hyperability, hypercalculus, compact cross-section, discrete-continuous dual matching, hyperbubbles, compact or hidden dimensions, complementarity, transcending variable-based mathematics

Full-text: PDF
 

 

A Theory of the Connectivity Dimensionality Field in Edge-Vertex Graphs and Discrete-Continuous Dual Spaces

By Thomas A. Manz

If you enjoyed this article, please consider signing up for courtesy email service which will notify you when new articles are posted to this web site. This email will contain the abstracts of new articles and a direct hyperlink to them. Your email address will not be used for any other purposes.

To subscribe, enter the security code, your first name and email address and hit submit. (You can always unsubscribe if you do not like the service.)

Retype Security Code: captcha

Your First Name:

Enter Email:


                                                      www.space-mixing-theory.com