Results 251 to 260 of about 15,366,710 (301)

On the faces of an n-dimensional cube

Computational Mathematics and Mathematical Physics, 2008
The structure of the faces of an n-dimensional cube is studied. Some combinatorial results describing the mutual arrangement and the metric characteristics of this structure are obtained.
V K Leont'Ev
exaly   +2 more sources

Resistance of an n-dimensional cube

Proceedings of the IEEE, 1965
Resistance across opposite vertices of n- dimensional cube with each edge at one ohm resistance expressed by equivalent ...
O.J. Tretiak, T.S. Huang
openaire   +1 more source

Maximum Matchings in the n-Dimensional Cube

Mathematical Notes, 2001
It is proved that in an \(n\)-dimensional hypercube for every odd \(n\geq 3\) it is possible to find efficiently a maximal matching with \(m= {n\choose r}+ \sum_{i=\theta}^{(r-2+ \theta)/2} {n\choose 2i-\theta}\) edges, where \(r= (n-1)/2\) and \(\theta= 1\) if \(n\equiv 3\bmod 4\) and \(\theta= 0\) if \(n\equiv 1\bmod 4\).
openaire   +2 more sources

Generalization of Rubik’s cube group to n-dimensional case

Journal of Knot Theory and Its Ramifications, 2020
In this paper, Rubik’s cube group in [Formula: see text]-dimensional case is described. In that case, some interesting effects arise, which is related with angular rotations. For [Formula: see text], the group [Formula: see text] arises, which can be realized as a factor group of [Formula: see text] by commutation [Formula: see text].
openaire   +2 more sources

How many triangles and quadrilaterals are there in an n-dimensional augmented cube?

Theoretical Computer Science, 2019
The article counts how many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube. It turns out that the number of triangles is equal to \(2^{n} (n-1)\) (for \(n=3,4,5,\ldots )\), and the number of quadrilaterals is equal to \(2^{n-2} (2n^{2} +5n-11)\) (for \(n=3,4,5,\ldots \)).
Qiang Dong, Xi Wang
openaire   +3 more sources

A (4n−9)/3 diagnosis algorithm on n-dimensional cube network

Information Sciences, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaofan Yang 0001, Yuan Yan Tang
openaire   +1 more source

Switching functions on an n-dimensional cube

Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics, 1954
THE analysis and synthesis of 2-terminal combinational networks from the standpoint of truth tables and Boolean algebra have been treated in great detail.1,2 In this paper these networks will be considered from a somewhat different viewpoint, mainly a switching function will be considered as a set of Vertexes on an n-dimensional cube (n-cube).
openaire   +1 more source

Clique matchings in the k-ary n-dimensional cube

Siberian Mathematical Journal, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Maximal length of circuit in a unitary n-dimensional cube

Mathematical Notes of the Academy of Sciences of the USSR, 1969
In a unit n-dimensional cube a circuit is constructed of length const · 2n. Thus, the order is found of the maximal length of a circuit.
openaire   +1 more source

Recurrence in Systems with Randomly Perturbed Trajectories on the n-Dimensional Cube

International Journal of Bifurcation and Chaos, 2014
We generalize some properties of (f, δ)-recurrence introduced in [Szała, 2013] to n-dimensional case and show that (f, δ)-recurrence and uniform (f, δ)-recurrence are equivalent. We also study properties of one-dimensional nonautonomous dynamical systems with randomly perturbed trajectories.
openaire   +2 more sources