3,847 research outputs found

    A number-theoretic approach to homotopy exponents of SU(n)

    Get PDF
    We use methods of combinatorial number theory to prove that, for each n>1n>1 and any prime pp, some homotopy group πi(SU(n))\pi_i(SU(n)) contains an element of order pn−1+ordp([n/p]!)p^{n-1+ord_p([n/p]!)}, where ordp(m)ord_p(m) denotes the largest integer α\alpha such that pαp^{\alpha} divides mm.Comment: 20 page

    Polynomial extension of Fleck's congruence

    Full text link
    Let pp be a prime, and let f(x)f(x) be an integer-valued polynomial. By a combinatorial approach, we obtain a nontrivial lower bound of the pp-adic order of the sum ∑k=r(modpβ)(nk)(−1)kf([(k−r)/pα]),\sum_{k=r(mod p^{\beta})}\binom{n}{k}(-1)^k f([(k-r)/p^{\alpha}]), where α≥β≥0\alpha\ge\beta\ge 0, n≥pα−1n\ge p^{\alpha-1} and r∈Zr\in Z. This polynomial extension of Fleck's congruence has various backgrounds and several consequences such as ∑k=r(modpα)(nk)ak≡0(modp[(n−pα−1)/ϕ(pα)])\sum_{k=r(mod p^\alpha)}\binom{n}{k} a^k\equiv 0 (mod p^{[(n-p^{\alpha-1})/\phi(p^\alpha)]}) provided that α>1\alpha>1 and a≡−1(modp)a\equiv-1(mod p).Comment: 11 page
    • …
    corecore