A combinatorial translation principle and diagram combinatorics for the general linear group
Rudolf Tange
备注：
This paper is a continuation of arXiv:2011.03606 and arXiv:0806.4500, and it shares some general notation with both. To appear in Transformation Groups
Let k be an algebraically closed field of characteristic p>0. We compute the Weyl filtration multiplicities in indecomposable tilting modules and the decomposition numbers for the general linear group over k in terms of cap diagrams under the assumption that p is bigger than the greatest hook length in the partitions involved. Then we introduce and study the rational Schur functor from a category of GL_n-modules to the category of modules for the walled Brauer algebra. As a corollary we obtain the decomposition numbers for the walled Brauer algebra when p is bigger than the greatest hook length in the partitions involved. This is a sequel to an earlier paper on the symplectic group and the Brauer algebra.
Let k be an algebraically closed field of characteristic p>2. We compute the Weyl filtration multiplicities in indecomposable tilting modules and the decomposition numbers for the symplectic group over k in terms of cap-curl diagrams under the assumption that p is bigger than the greatest hook length in the largest partition involved. As a corollary we obtain the decomposition numbers for the Brauer algebra under the same assumptions. Our work combines ideas from work of Cox and De Visscher and work of Shalile with techniques from the representation theory of reductive groups.
For $A$ a gentle algebra, and $X$ and $Y$ string modules, we construct a combinatorial basis for Hom($X,τY$). We use this to describe support $τ$-tilting modules for $A$. We give a combinatorial realization of maps in both directions realizing the bijection between support $τ$-tilting modules and functorially finite torsion classes. We give an explicit basis of Ext$^1(Y,X)$ as short exact sequences. We analyze several constructions given in a more restricted, combinatorial setting by McConville, showing that many but not all of them can be extended to general gentle algebras.
We establish an explicit combinatorial/homological characterization of supports for linear degenerations of flag varieties. For such purpose, we introduce the concept of an excessive multisegment. It provides a new class of combinatorial objects counted by Motzkin numbers.
We investigate quiver representations over $\mathbb{F}_1$. Coefficient quivers are combinatorial gadgets equivalent to $\mathbb{F}_1$-representations of quivers. We focus on the case when the quiver $Q$ is a pseudotree. For such quivers, we first use the notion of coefficient quivers to provide a complete classification of asymptotic behaviors of indecomposable representations over $\mathbb{F}_1$. Then, we prove some fundamental structural results about the Lie algebras associated to pseudotrees. Finally, we construct examples of $\mathbb{F}_1$-representations $M$ of a quiver $Q$ by using cove…
The representation theory of the symmetric groups S_n is intimately related to combinatorics: combinatorial objects such as Young tableaux and combinatorial algorithms such as Murnaghan-Nakayama rule. In the limit as n tends to infinity, the structure of these combinatorial objects and algorithms becomes complicated and it is hard to extract from them some meaningful answers to asymptotic questions. In order to overcome these difficulties, a kind of dual combinatorics of the representation theory of the symmetric groups was initiated in 1990s. We will concentrate on one of its highlights: Kero…
We give a purely combinatorial proof of the positivity of the stabilized forms of the generalized exponents associated to each classical root system. In finite type A_{n-1}, we rederive the description of the generalized exponents in terms of crystal graphs without using the combinatorics of semistandard tableaux or the charge statistic. In finite type C_n, we obtain a combinatorial description of the generalized exponents based on the so-called distinguished vertices in crystals of type A_{2n-1}, which we also connect to symplectic King tableaux. This gives a combinatorial proof of the positi…
Ramanujan graphs have extremal spectral properties, which imply a remarkable combinatorial behavior. In this paper we compute the high dimensional Hodge-Laplace spectrum of Ramanujan triangle complexes, and show that it implies a combinatorial expansion property, and a pseudo-randomness result. For this purpose we prove a Cheeger-type inequality and a mixing lemma of independent interest.
The Murnaghan--Nakayama rule is a combinatorial rule for the character values of symmetric groups. We give a new combinatorial proof by explicitly finding the trace of the representing matrices in the standard basis of Specht modules. This gives an essentially bijective proof of the rule. A key lemma is an extension of a straightening result proved by the second author to skew-tableaux. Our module theoretic methods also give short proofs of Pieri's rule and Young's rule.
We present an explicit combinatorial realization of the commutor in the category of crystals which was first studied by Henriques and Kamnitzer. Our realization is based on certain local moves defined by van Leeuwen.
We give a combinatorial evaluation of Iwahori Whittaker functions for unramified genuine principal series representations on metaplectic covers of the general linear group over a non-archimedean local field. To describe the combinatorics, we introduce new combinatorial data that we call colored data: colored Lusztig data, colored Gelfand-Tsetlin patterns, and colored lattice models. We show that all three are equivalent. To achieve the result, we give an explicit Iwahori decomposition for the maximal unipotent subgroup of a split reductive group which gives the parametrization of the generaliz…
We propose a new description of Endofunctors of Module Categories, based upon a combinatorial category comprising finite sets and so-called mazes. Polynomial and numerical functors both find a natural interpretation in this frame-work. Since strict polynomial functors, according to the work of Salomonsson, are encoded by multi-sets, the two strains of functors may be compared and contrasted through juxtaposing the respective combinatorial structures, leading to the Polynomial Functor Theorem, giving an effective criterion for when a numerical (polynomial) functor is strict polynomial.
Exceptional sequences are important sequences of quiver representations in the study of representation theory of algebras. They are also closely related to the theory of cluster algebras and the combinatorics of Coxeter groups. We combinatorially classify exceptional sequences of a family of type D Dynkin quivers, and we show how our model for exceptional sequences connects to the combinatorics of type D noncrossing partitions.
A $q$-analogue of combinatorics concerning the Cartan matrix for the Iwahori-Hecke algebra of type $A$ is investigated. We give several descriptions for the determinant of the graded Cartan matrix, which imply some combinatorial identities. A conjectural expression for the elementary divisors is also presented.
We present several direct bijections between different combinatorial interpretations of the Littlewood-Richardson coefficients. The bijections are defined by explicit linear maps which have other applications.
In this paper, we continue the development of a new combinatorial model for the irreducible characters of a complex semisimple Lie group. This model, which will be referred to as the alcove path model, can be viewed as a discrete counterpart to the Littelmann path model. It leads to an extensive generalization of the combinatorics of irreducible characters from Lie type A (where the combinatorics is based on Young tableaux, for instance) to arbitrary type. The main results of this paper are: (1) a combinatorial description of the crystal graphs corresponding to the irreducible representations …
Several bases of the Garsia-Haiman modules for hook shapes are given, as well as combinatorial decomposition rules for these modules. These bases and rules extend the classical ones for the coinvariant algebra of type $A$. We also give a decomposition of the Garsia-Haiman modules into descent representations.
We study some combinatorial and algebraic properties of certain quadratic algebras related with dynamical classical and classical Yang-Baxter equations. One can find more details about the content of present paper in Extended Abstract.
In this paper we study the combinatorial consequences of the relationship between rational Cherednik algebras of type $G(l,1,n)$, cyclic quiver varieties and Hilbert schemes. We classify and explicitly construct $\mathbb{C}^*$-fixed points in cyclic quiver varieties and calculate the corresponding characters of tautological bundles. Furthermore, we give a combinatorial description of the bijections between $\mathbb{C}^*$-fixed points induced by the Etingof-Ginzburg isomorphism and Nakajima reflection functors. We apply our results to obtain a new proof as well as a generalization of the $q$-ho…
In a highly influential paper, Bidigare, Hanlon and Rockmore showed that a number of popular Markov chains are random walks on the faces of a hyperplane arrangement. Their analysis of these Markov chains took advantage of the monoid structure on the set of faces. This theory was later extended by Brown to a larger class of monoids called left regular bands. In both cases, the representation theory of these monoids played a prominent role. In particular, it was used to compute the spectrum of the transition operators of the Markov chains and to prove diagonalizability of the transition operator…
We present a study of three families of Kronecker coefficients, which we describe in terms of reduced Kronecker coefficients. This study is grounded on the generating function of the coefficients, proved by a bijection between two combinatorial objects. This study includes the connection between plane partitions and these three families of reduced Kronecker coefficients, providing us their combinatorial interpretation. As an application, we verify that the saturation hypothesis holds for our three families of reduced Kronecker coefficients. The study also includes other interpretation in terms…
We explore various combinatorial problems mostly borrowed from physics, that share the property of being continuously or discretely integrable, a feature that guarantees the existence of conservation laws that often make the problems exactly solvable. We illustrate this with: random surfaces, lattice models, and structure constants in representation theory.
