We show that the Double Coset Membership problem for permutation groups possesses perfect zero-knowledge proofs.

This paper presents a solution of the polycirculant conjecture which states that every vertex-transitive graph G has an automorphism that permutes the vertices in cycles of the same length. This is done by identifying vertex-transitive graphs as coset graphs. For a coset graph H, an equivalence relation ∼ is defined on the vertices of cosets with classes as double cosets of the stabiliser and a...

We study a class of double coset spaces RA\G1 × G2/RC , where G1 and G2 are connected reductive algebraic groups, and RA and RC are certain spherical subgroups of G1×G2 obtained by “identifying” Levi factors of parabolic subgroups in G1 and G2. Such double cosets naturally appear in the symplectic leaf decompositions of Poisson homogeneous spaces of complex reductive groups with the Belavin–Dri...

The Todd-Coxeter algorithm described in [13] remains a primary reference for coset enumeration programs. It may be viewed as a means of constructing permutation representations of finitely presented groups. A number of effective computer programs for singlecoset enumeration have been described, see, for example, [2, 7, 8]. Enumerating double cosets, rather than single cosets, gives substantial ...

We extend the analysis [18] of the canonical structure of the Wess-Zumino-Witten theory to the bulk and boundary coset G/H models. The phase spaces of the coset theories in the closed and in the open geometry appear to coincide with those of a double ChernSimons theory on two different 3-manifolds. In particular, we obtain an explicit description of the canonical structure of the boundary G/G c...