Oplysninger om | engelsk ord HYPERCUBES

Eksempler på brug af HYPERCUBES i en sætning

• The term nasik would apply to all dimensions of magic hypercubes in which the number of correctly summing paths (lines) through any cell of the hypercube is P =.
• The term unit cube or unit hypercube is also used for hypercubes, or "cubes" in n-dimensional spaces, for values of n other than 3 and edge length 1.
• Despite his deteriorating health, Hendricks continued his work with magic hypercubes, achieving during this time: the first perfect magic tesseract (order 16), in April 1999; the first order 32 perfect magic tesseract; the first inlaid magic tesseract (order 6 with inlaid order 3) in October 1999; and the first bimagic cube (order 25), June 2000.
• In fuzzy logic, he introduced fuzzy cognitive maps, fuzzy subsethood, additive fuzzy systems, ratio measures of fuzziness, the shape of fuzzy sets, the conditional variance of fuzzy systems, and the geometric view of (finite) fuzzy sets as points in hypercubes and its relationship to the ongoing debate of fuzziness versus probability.
• Originally the little n-cubes operad or the little intervals operad (initially called little n-cubes PROPs) was defined by Michael Boardman and Rainer Vogt in a similar way, in terms of configurations of disjoint axis-aligned n-dimensional hypercubes (n-dimensional intervals) inside the unit hypercube.
• Cubicity is defined in the same way as boxicity but with axis-parallel hypercubes instead of hyperrectangles.
• Cayley's second hyperdeterminant is defined for a restricted range of hypermatrix formats (including the hypercubes of any dimensions).
• It is also possible to define median graphs as the solution sets of 2-satisfiability problems, as the retracts of hypercubes, as the graphs of finite median algebras, as the Buneman graphs of Helly split systems, and as the graphs of windex 2; see the sections below.
• Folded cube graphs inherit from their hypercube subgraphs the property of having a Hamiltonian cycle, and from the hypercubes that double cover them the property of being a distance-transitive graph.
• The general question is: Which polygons can be equidissected into how many pieces? Particular attention has been given to trapezoids, kites, regular polygons, centrally symmetric polygons, polyominos, and hypercubes.

Sideforberedelse tog: 576,83 ms.