Matthew Fayers

  1. An LLT-type algorithm for computing higher-level canonical bases.

    Authors: Matthew Fayers
    Subjects: Quantum Algebra
    Abstract

    We give a fast algorithm for computing the canonical basis of an irreducible
    highest-weight module for $U_q(\hat{\mathfrak{sl}}_e)$, generalising the LLT
    algorithm.

  2. Partition models for the crystal of the basic $U_q(\hat{\mathfrak{sl}}_n)$-module.

    Authors: Matthew Fayers
    Subjects: Combinatorics
    Abstract

    For each $n\geqslant3$, we construct an uncountable family of models of the
    crystal of the basic $U_q(\hat{\mathfrak{sl}}_n)$-module. These models are all
    based on partitions, and include the usual $n$-regular and $n$-restricted
    models, as well as Berg's ladder crystal, as special cases.

  3. On the irreducible Specht modules for Iwahori--Hecke algebras of type A with $q=-1$.

    Authors: Matthew Fayers
    Subjects: Representation Theory
    Abstract

    Let $p$ be a prime and $\mathbb{F}$ a field of characteristic $p$, and let
    $\mathcal{H}_n$ denote the Iwahori--Hecke algebra of the symmetric group
    $\mathfrak{S}_n$ over $\mathbb{F}$ at $q=-1$. We prove that there are only
    finitely many partitions $\lambda$ such that both $\lambda$ and $\lambda'$ are
    2-singular and the Specht module $S^\lambda$ for $\mathcal{H}_{|\la|}$ is
    irreducible.

  4. General runner removal and the Mullineux map.

    Authors: Matthew Fayers
    Subjects: Representation Theory
    Abstract

    We prove a new `runner removal theorem' for $q$-decomposition numbers of the
    level 1 Fock space of type $A^{(1)}_{e-1}$, generalising earlier theorems of
    James--Mathas and the author. By combining this with another theorem relating
    to the Mullineux map, we show that the problem of finding all $q$-decomposition
    numbers indexed by partitions of a given weight is a finite computation.

Syndicate content