This paper is concerned with processes by which a vector of n positive elements can be expanded as a sequence of permutations. The principal transformation considered is shown to generate a unique permutation expansion from every normalized vector, and the question of rate of convergence is examined. Other similar transformations are discussed less com-pletely. The idea of considering such transformations was suggested by an empirical investigation of M. G. Kendall. 1. Introduction. Kendall (1962) has described a process by which a set of n numbers is rearranged in ascending order, the ordered numbers are differenced, the n — 1 differences are rearranged in order, differences are again taken and so on. From information provided only by the ...
We consider random permutation matrices following a one-parameter family of deformations of the unif...
An exchange based technique for generating permutation is presented in this paper.This strategy invo...
Ordinary representations of permutations in Genetic Algorithms (GA) is handicapped with producing of...
International audienceThis paper studies an evolutionary representation/crossover combination for pe...
Models for random permutations with nonuniform probability distribution are ubiq-uitous in many bran...
This paper derives new synthesis methods for arbitrary N-valued functions of n M-valued variables as...
We study aspects of the enumeration of permutation classes, sets of permutations closed downwards un...
AbstractIn this paper we study a class of dynamical systems generated by iterations of multivariate ...
In this paper, we give some new algebraic properties of a sequence transformation due to Drummond fo...
Slepians permutation codes are investigated in detail. In particular we optimize the initial vector ...
We establish a phase transition for permutation classes (downsets of permutations under the permutat...
Any permutation statistic ƒ : S → C may be represented uniquely as a, possibly infinite, linear comb...
AbstractA permutation with a signature Q=(q1,q2,…,qn−1) where qi is either 1 or −1, is a permutation...
Abstract. We consider the problem of factorization of permutations. We begin with a discussion of so...
Editor: Permutation tests have been proposed for a variety of problems going back to the early works...
We consider random permutation matrices following a one-parameter family of deformations of the unif...
An exchange based technique for generating permutation is presented in this paper.This strategy invo...
Ordinary representations of permutations in Genetic Algorithms (GA) is handicapped with producing of...
International audienceThis paper studies an evolutionary representation/crossover combination for pe...
Models for random permutations with nonuniform probability distribution are ubiq-uitous in many bran...
This paper derives new synthesis methods for arbitrary N-valued functions of n M-valued variables as...
We study aspects of the enumeration of permutation classes, sets of permutations closed downwards un...
AbstractIn this paper we study a class of dynamical systems generated by iterations of multivariate ...
In this paper, we give some new algebraic properties of a sequence transformation due to Drummond fo...
Slepians permutation codes are investigated in detail. In particular we optimize the initial vector ...
We establish a phase transition for permutation classes (downsets of permutations under the permutat...
Any permutation statistic ƒ : S → C may be represented uniquely as a, possibly infinite, linear comb...
AbstractA permutation with a signature Q=(q1,q2,…,qn−1) where qi is either 1 or −1, is a permutation...
Abstract. We consider the problem of factorization of permutations. We begin with a discussion of so...
Editor: Permutation tests have been proposed for a variety of problems going back to the early works...
We consider random permutation matrices following a one-parameter family of deformations of the unif...
An exchange based technique for generating permutation is presented in this paper.This strategy invo...
Ordinary representations of permutations in Genetic Algorithms (GA) is handicapped with producing of...