Sciweavers

134 search results - page 14 / 27
» Combinatorics of diagrams of permutations
Sort
View
COMBINATORICS
2006
116views more  COMBINATORICS 2006»
13 years 9 months ago
Classifying Descents According to Equivalence mod k
In [5] the authors refine the well-known permutation statistic "descent" by fixing parity of one of the descent's numbers. In this paper, we generalize the results o...
Sergey Kitaev, Jeffrey B. Remmel
COMBINATORICS
2007
73views more  COMBINATORICS 2007»
13 years 9 months ago
The Skew and Relative Derangements of Type B
By introducing the notion of relative derangements of type B, also called signed relative derangements, which are defined in terms of signed permutations, we obtain a type B anal...
William Y. C. Chen, Jessica C. Y. Zhang
CPM
2004
Springer
138views Combinatorics» more  CPM 2004»
14 years 3 months ago
Reversal Distance without Hurdles and Fortresses
Abstract. This paper presents an elementary proof of the HannenhalliPevzner theorem on the reversal distance of two signed permutations. It uses a single PQ-tree to encode the vari...
Anne Bergeron, Julia Mixtacki, Jens Stoye
COMBINATORICS
2006
114views more  COMBINATORICS 2006»
13 years 9 months ago
The Maximum Distinguishing Number of a Group
Let G be a group acting faithfully on a set X. The distinguishing number of the action of G on X, denoted DG(X), is the smallest number of colors such that there exists a coloring...
Melody Chan
COMBINATORICS
2006
104views more  COMBINATORICS 2006»
13 years 9 months ago
Factorial Grothendieck Polynomials
In this paper, we study Grothendieck polynomials indexed by Grassmannian permutations from a combinatorial viewpoint. We introduce the factorial Grothendieck polynomials which are...
Peter McNamara