Sciweavers

JCT
2010
82views more  JCT 2010»
13 years 2 months ago
Major index for 01-fillings of moon polyominoes
We propose a major index statistic on 01-fillings of moon polyominoes which, when specialized to certain shapes, reduces to the major index for permutations and set partitions. W...
William Y. C. Chen, Svetlana Poznanovic, Catherine...
DAM
2010
104views more  DAM 2010»
13 years 2 months ago
Sorting with networks of data structures
We consider the problem of sorting a permutation using a network of data structures as introduced by Knuth and Tarjan. In general the model as considered previously was restricted...
Therese C. Biedl, Alexander Golynski, Angèl...
SIAMDM
2008
69views more  SIAMDM 2008»
13 years 3 months ago
Labeled Partitions and the q-Derangement Numbers
Inspired by MacMahon's original proof of his celebrated theorem on the distribution of the major index over permutations, we give a reformulation of his argument in terms of l...
William Y. C. Chen, Deheng Xu
NJC
1998
86views more  NJC 1998»
13 years 3 months ago
Parametric Permutation Routing via Matchings
The problem of routing permutations on graphs via matchings is considered, and we present a general algorithm which can be parameterized by different heuristics. This leads to a ...
Peter Høyer, Kim S. Larsen
COMBINATORICS
1999
85views more  COMBINATORICS 1999»
13 years 3 months ago
Permutation Patterns and Continued Fractions
We find, in the form of a continued fraction, the generating function for the number of (132)-avoiding permutations that have a given number of (123) patterns, and show how to ext...
Aaron Robertson, Herbert S. Wilf, Doron Zeilberger
COMBINATORICS
1999
75views more  COMBINATORICS 1999»
13 years 3 months ago
On the Stanley-Wilf Conjecture for the Number of Permutations Avoiding a Given Pattern
Abstract. Consider, for a permutation Sk, the number F(n, ) of permutations in Sn which avoid as a subpattern. The conjecture of Stanley and Wilf is that for every there is a c...
Richard Arratia
IPL
2002
108views more  IPL 2002»
13 years 3 months ago
A heuristic to accelerate in-situ permutation algorithms
In-situ permutation algorithms are algorithms to permute an array of
Jörg Keller
RSA
2000
170views more  RSA 2000»
13 years 3 months ago
Delayed path coupling and generating random permutations
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
Artur Czumaj, Miroslaw Kutylowski
JSA
2000
103views more  JSA 2000»
13 years 3 months ago
O(n) routing in rearrangeable networks
In (2n)1)-stage rearrangeable networks, the routing time for any arbitrary permutation is X(n2 ) compared to its propagation delay O(n) only. Here, we attempt to identify the sets...
Nabanita Das, Krishnendu Mukhopadhyaya, Jayasree D...
DM
2000
66views more  DM 2000»
13 years 3 months ago
From Motzkin to Catalan permutations
For every integer j
Elena Barcucci, Alberto Del Lungo, Elisa Pergola, ...