Fuzzy hypercubes and their time-like evolution (Q780335): Difference between revisions

The paper under review is to define a fuzzy hypercube as a trigonometric extension of the binary structure of an \(N\)-dimensional Boolean hypercube, and to connect this concept with multivariate discrete probability distributions. An \(N\)-dimensional Boolean hypercube \(\mathbf{H}_N\) has \(2^N\) vertices as \(N\)-dimensional \(\{0, 1\}\) bit strings, and its decimal transcription of these vertices is the sequence \(H_N=\{0, \mu (N)| \Delta =1\}\) of \(2^N\) natural numbers, where \(\mu (N)\) is the Mersenne number associated with the Boolean unity vertex string \(\langle\mathbf{1}| = (1, 1, \dots, 1)\) and the zero number to the Boolean zero vertex \(\langle\mathbf{0}| = (0,0,\dots, 0)\). Section 2 recalls the Boolean hypercube, and Section 3 transforms from a classic Boolean hypercube to a fuzzy hypercube \(\mathbf{F}_1(\tau)\), \[ \{0, 1\} \to \{\sin^2 \tau, \cos^2 \tau\} \equiv \{S, C\}, \] for all \(\tau \in [0, \pi]\), \(S+C=1\). Thus the Boolean hypercube vertices (bit strings) transform to sequences of squared sines and cosines, analyzing the fuzzy hypercube via smoothly varying \(\tau\) to get a synchronous fuzzy hypercube. The \(N\)-dimensional fuzzy hypercube \(\mathbf{F}_N(\tau)\) reduces to the \(N\)-dimensional Boolean hypercube at \(\tau =0, \pi\): \(\mathbf{F}_N(0)=\mathbf{F}_N(\tau)=\mathbf{H}_N\). Define a transformation \[ T[\mathbf{H}_N] \Rightarrow \langle v| \in\mathbf{H}_N: 0\leftrightarrow 1 \Rightarrow T[\mathbf{H}_N] =\mathbf{H}_N. \] The transformation switching bits leaves the Boolean hypercube invariant, reverse order on the sequence of vertices, and \(T[\mathbf{F}_N(0)]=\mathbf{F}_N(\frac{\pi}{2})\). The fuzzy hypercube \(\mathbf{F}_N(\frac{\pi}{4})\) collapses all bits into a uniques bit \(\frac{1}{2}\) and identifies with the centroid of \(\mathbf{H}_N\). Define \(\mathbf{D}_N(\tau) = \frac{d}{d\tau}\mathbf{F}_N(\tau)\). Section 4 derives that the time evolution of a fuzzy asynchronous hypercube will be equivalent to a chaotic evolution of the hypercube vertex set, Section 5 gives an \(N\)-dimensional fuzzy hypercube with discrete binary pair of probabilities, Fermat probability distributions are presented as example. The conclusion in Section 6 mention potential applications in chemistry and physics. It would be real if there is a sound relation between the fuzzy hypercube and quantum computing, other than elementary extensions of \(\{0, 1\}\) bits. All properties discussed in the paper are elementary properties of sine and cosine functions.