Sciweavers

158 search results - page 2 / 32
» Some counting problems related to permutation groups
Sort
View
COCO
1997
Springer
127views Algorithms» more  COCO 1997»
13 years 9 months ago
A Nonadaptive NC Checker for Permutation Group Intersection
In this paper we design a nonadaptive NC checker for permutation group intersection, sharpening a result from Blum and Kannan 3]. This is a consequence of two results. First we sh...
Vikraman Arvind, Jacobo Torán
COMBINATORICS
2007
74views more  COMBINATORICS 2007»
13 years 5 months ago
Statistics on the Multi-Colored Permutation Groups
We define an excedance number for the multi-colored permutation group i.e. the wreath product (Zr1 × · · · × Zrk ) Sn and calculate its multi-distribution with some natural ...
Eli Bagno, Ayelet Butman, David Garber
CADE
2003
Springer
14 years 5 months ago
Certifying Solutions to Permutation Group Problems
We describe the integration of permutation group algorithms with proof planning. We consider eight basic questions arising in computational permutation group theory, for which our ...
Arjeh M. Cohen, Scott H. Murray, Martin Pollet, Vo...
ENDM
2007
64views more  ENDM 2007»
13 years 5 months ago
The complexity of the Weight Problem for permutation groups
Given a metric d on a permutation group G, the corresponding weight problem is to decide whether there exists an element g ∈ G such that d(g, e) = k for some k ∈ N. In this pa...
Peter J. Cameron, Taoyang Wu
JCT
2011
141views more  JCT 2011»
13 years 16 days ago
Bijections for Baxter families and related objects
The Baxter number Bn can be written as Bn = n k=0 Θk,n−k−1 with Θk,ℓ = 2 (k + 1)2 (k + 2) k + ℓ k k + ℓ + 1 k k + ℓ + 2 k . These numbers have first appeared in the...
Stefan Felsner, Éric Fusy, Marc Noy, David ...