174 search results - page 21 / 35 » Permutation Groups in NC |
COMBINATORICS
2006
13 years 7 months ago
2006
Let Sn be the group of permutations of [n] = {1, . . . , n}. The Bruhat order on Sn is a partial order relation, for which there are several equivalent definitions. Three well-kno...
AAECC
2009
Springer
14 years 2 months ago
2009
Springer
We show that an affine-invariant code C of length pm is not permutation equivalent to a cyclic code except in the obvious cases: m = 1 or C is either {0}, the repetition code or it...
AB
2007
Springer
13 years 11 months ago
2007
Springer
Given a permutation , the application of prefix reversal f(i) to reverses the order of the first i elements of . The problem of Sorting By Prefix Reversals (also known as pancake ...
COCOA
2008
Springer
13 years 8 months ago
2008
Springer
Solution symmetries in integer linear programs often yield long Branch-and-Bound based solution processes. We propose a method for finding elements of the permutation group of sol...
COMBINATORICS
2000
13 years 7 months ago
2000
Two tournaments T1 and T2 on the same vertex set X are said to be switching equivalent if X has a subset Y such that T2 arises from T1 by switching all arcs between Y and its comp...