Results 251 to 260 of about 662 (278)
Some of the next articles are maybe not open access.
Array Permutation by Index-Digit Permutation
Journal of the ACM, 1976An array may be reordered according to a common permutation of the digits of each of its element indices. The digit-reversed reordering which results from common fast Fourier transform (FFT) algorithms is an example. By examination of this class of permutation in detail, very efficient algorithms for transforming very long arrays are developed.
openaire +1 more source
Conditions for Permutability of Congruences in Implication Algebras [PDF]
Order, 2009 In this paper we give conditions on an implication algebra A so that two congruences θ1, θ2 on A permute, i.e. θ1 ○ θ2 = θ2 ○ θ1. We also provide simpler conditions for permutability in finite implication algebras. Finally we present some applications of
Castaño, Diego Nicolás +1 more
exaly +2 more sources
Journal of the ACM, 1968
In this paper the construction of a switching network capable of n !-permutation of its n input terminals to its n output terminals is described. The building blocks for this network are binary cells capable of permuting their two input terminals to their two output ...
openaire +1 more source
In this paper the construction of a switching network capable of n !-permutation of its n input terminals to its n output terminals is described. The building blocks for this network are binary cells capable of permuting their two input terminals to their two output ...
openaire +1 more source
Communications of the ACM, 1976
Classical permutation enumeration algorithms encounter special cases requiring additional computation every nth permutation when generating the n! permutations on n marks. Four new algorithms have the attribute that special cases occur every n(n—1) permutations. Two of the algorithms produce the next permutation with a single exchange of two marks. The
openaire +2 more sources
Classical permutation enumeration algorithms encounter special cases requiring additional computation every nth permutation when generating the n! permutations on n marks. Four new algorithms have the attribute that special cases occur every n(n—1) permutations. Two of the algorithms produce the next permutation with a single exchange of two marks. The
openaire +2 more sources
Journal of the London Mathematical Society, 1991
The group \(\hbox{Sym }\mathbb{R}\) of permutations of the set \(\mathbb{R}\) of real numbers is considered in the paper. Let \(P_ 0\) be its subgroup of power functions \(x\mapsto x^{m/n}\) where \(m\), \(n\) are positive odd integers, \(T\) be the subgroup of translations \(x\mapsto x+a\) where \(a\) is a real algebraic number, and \(M\) be the ...
Adeleke, S. A. +2 more
openaire +2 more sources
The group \(\hbox{Sym }\mathbb{R}\) of permutations of the set \(\mathbb{R}\) of real numbers is considered in the paper. Let \(P_ 0\) be its subgroup of power functions \(x\mapsto x^{m/n}\) where \(m\), \(n\) are positive odd integers, \(T\) be the subgroup of translations \(x\mapsto x+a\) where \(a\) is a real algebraic number, and \(M\) be the ...
Adeleke, S. A. +2 more
openaire +2 more sources
Sets of permutations and their realization by permutation networks
J. Inf. Process. Cybern., 1985The realization of sets of permutations by permutation networks which are serial connections of some layers with only one binary control input for each layer are systematically investigated.
Ferdinand Börner +2 more
openaire +1 more source
Complex Systems, 2004
This paper investigates some series of integers which are derived from a recursively defined sequence of permutations of words. Such a recursion can be interpreted as a dynamic system. Geometrical representations of these series appear to be self-similar, symmetrical, and factorizable.
openaire +2 more sources
This paper investigates some series of integers which are derived from a recursively defined sequence of permutations of words. Such a recursion can be interpreted as a dynamic system. Geometrical representations of these series appear to be self-similar, symmetrical, and factorizable.
openaire +2 more sources
The permutability of p-sylowizers of some p-subgroups in finite groups
Archiv Der Mathematik, 2020Donglin Lei, Xianhua Li, Li Xianhua
exaly
New trends on the permutability equation
Aequationes Mathematicae, 2013Humberto Bustince +2 more
exaly