Sciweavers

14 search results - page 2 / 3
» Wreath Products of Permutation Classes
Sort
View
MST
2010
101views more  MST 2010»
13 years 3 months ago
Automatic Presentations and Semigroup Constructions
atic presentation for a relational structure is, informally, an abstract representation of the elements of that structure by means of a regular language such that the relations ca...
Alan J. Cain, Graham P. Oliver, Nikola Ruskuc, Ric...
IPL
2011
96views more  IPL 2011»
12 years 11 months ago
Restricted compositions and permutations: From old to new Gray codes
Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let ≺ denot...
Vincent Vajnovszki, Rémi Vernay
STOC
1993
ACM
109views Algorithms» more  STOC 1993»
13 years 9 months ago
Routing permutations on graphs via matchings
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
Noga Alon, Fan R. K. Chung, Ronald L. Graham
CC
2008
Springer
13 years 7 months ago
Generating SIMD Vectorized Permutations
Abstract. This paper introduces a method to generate efficient vectorized implementations of small stride permutations using only vector load and vector shuffle instructions. These...
Franz Franchetti, Markus Püschel
JCT
2010
112views more  JCT 2010»
13 years 3 months ago
Annular embeddings of permutations for arbitrary genus
In the symmetric group on a set of size 2n, let P2n denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as “pairings”, since each ...
I. P. Goulden, William Slofstra