799 research outputs found

    On the distribution of conjugacy classes between the cosets of a finite group in a cyclic extension

    Full text link
    Let G be a finite group and H a normal subgroup such that G/H is cyclic. Given a conjugacy class g^G of G we define its centralizing subgroup to be HC_G(g). Let K be such that H\le K\le G. We show that the G-conjugacy classes contained in K whose centralizing subgroup is K, are equally distributed between the cosets of H in K. The proof of this result is entirely elementary. As an application we find expressions for the number of conjugacy classes of K under its own action, in terms of quantities relating only to the action of G.Comment: 12 page

    Rod-structure classification of gravitational instantons with U(1)xU(1) isometry

    Full text link
    The rod-structure formalism has played an important role in the study of black holes in D=4 and 5 dimensions with RxU(1)^{D-3} isometry. In this paper, we apply this formalism to the study of four-dimensional gravitational instantons with U(1)xU(1) isometry, which could serve as spatial backgrounds for five-dimensional black holes. We first introduce a stronger version of the rod structure with the rod directions appropriately normalised, and show how the regularity conditions can be read off from it. Requiring the absence of conical and orbifold singularities will in general impose periodicity conditions on the coordinates, and we illustrate this by considering known gravitational instantons in this class. Some previous results regarding certain gravitational instantons are clarified in the process. Finally, we show how the rod-structure formalism is able to provide a classification of gravitational instantons, and speculate on the existence of possible new gravitational instantons.Comment: 43 pages, 5 figures, LaTeX; minor changes made and reference added, published versio

    An Efficient Quantum Algorithm for some Instances of the Group Isomorphism Problem

    Full text link
    In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of isomorphism testing for nonabelian groups. Le Gall has constructed an efficient classical algorithm for a class of groups corresponding to one of the most natural ways of constructing nonabelian groups from abelian groups: the groups that are extensions of an abelian group AA by a cyclic group ZmZ_m with the order of AA coprime with mm. More precisely, the running time of that algorithm is almost linear in the order of the input groups. In this paper we present a quantum algorithm solving the same problem in time polynomial in the logarithm of the order of the input groups. This algorithm works in the black-box setting and is the first quantum algorithm solving instances of the nonabelian group isomorphism problem exponentially faster than the best known classical algorithms.Comment: 20 pages; this is the full version of a paper that will appear in the Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010

    Noncommutative integrability, paths and quasi-determinants

    Get PDF
    In previous work, we showed that the solution of certain systems of discrete integrable equations, notably QQ and TT-systems, is given in terms of partition functions of positively weighted paths, thereby proving the positive Laurent phenomenon of Fomin and Zelevinsky for these cases. This method of solution is amenable to generalization to non-commutative weighted paths. Under certain circumstances, these describe solutions of discrete evolution equations in non-commutative variables: Examples are the corresponding quantum cluster algebras [BZ], the Kontsevich evolution [DFK09b] and the TT-systems themselves [DFK09a]. In this paper, we formulate certain non-commutative integrable evolutions by considering paths with non-commutative weights, together with an evolution of the weights that reduces to cluster algebra mutations in the commutative limit. The general weights are expressed as Laurent monomials of quasi-determinants of path partition functions, allowing for a non-commutative version of the positive Laurent phenomenon. We apply this construction to the known systems, and obtain Laurent positivity results for their solutions in terms of initial data.Comment: 46 pages, minor typos correcte

    Hamiltonian Structure of PI Hierarchy

    Get PDF
    The string equation of type (2,2g+1)(2,2g+1) may be thought of as a higher order analogue of the first Painlev\'e equation that corresponds to the case of g=1g = 1. For g>1g > 1, this equation is accompanied with a finite set of commuting isomonodromic deformations, and they altogether form a hierarchy called the PI hierarchy. This hierarchy gives an isomonodromic analogue of the well known Mumford system. The Hamiltonian structure of the Lax equations can be formulated by the same Poisson structure as the Mumford system. A set of Darboux coordinates, which have been used for the Mumford system, can be introduced in this hierarchy as well. The equations of motion in these Darboux coordinates turn out to take a Hamiltonian form, but the Hamiltonians are different from the Hamiltonians of the Lax equations (except for the lowest one that corresponds to the string equation itself).Comment: This is a contribution to the Vadim Kuznetsov Memorial Issue on Integrable Systems and Related Topics, published in SIGMA (Symmetry, Integrability and Geometry: Methods and Applications) at http://www.emis.de/journals/SIGMA

    Around the Razumov-Stroganov conjecture: proof of a multi-parameter sum rule

    Full text link
    We prove that the sum of entries of the suitably normalized groundstate vector of the O(1) loop model with periodic boundary conditions on a periodic strip of size 2n is equal to the total number of n x n alternating sign matrices. This is done by identifying the state sum of a multi-parameter inhomogeneous version of the O(1) model with the partition function of the inhomogeneous six-vertex model on a n x n square grid with domain wall boundary conditions.Comment: 30 pages. v2: Eq. (3.38) corrected. v3: title changed, references added. v4: q and q^{-1} switched to conform to standard convention
    corecore