We compute the dimension $d_{n,r}(q) = \dim(\IR_q^r)$ of the defining module $\IR_q^r$ for the $q$-partition algebra. This module comes from $r$-iterations of Harish-Chandra restriction and induction on $\GL_n(\FF_q)$. This dimension is a polynomial in $q$ that specializes as $d_{n,r}(1) = n^r$ and $d_{n,r}(0) = B(r)$, the $r$th Bell number. We compute $d_{n,r}(q)$ in two ways. The first is purely combinatorial. We show that $d_{n,r}(q) = \sum_λf^λ(q) m_r^λ$, where $f^λ(q)$ is the $q$-hook number and $m_r^λ$ is the number of $r$-vacillating tableaux. Using a Schensted bijection, we write this as a sum over integer sequences which, when $q$-counted by inverse major index, gives $d_{n,r}(q)$. The second way is algebraic. We find a basis of $\IR_q^r$ that is indexed by $n$-restricted $q$-set partitions of $\{1,..., r\}$, and we show that there are $d_{n,r}(q)$ of these.
Extending the notion of $r$-(class) regular partitions, we define $(r_{1},...,r_{m})$-class regular partitions. A partition identity is presented and described by making use of the Glaisher correspondence.
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…
The aim of this paper is to develop the combinatorics of constructions associated to what we call \emph{triangular partitions}. As introduced in arXiv:2102.07931, these are the partitions whose cells are those lying below the line joining points $(r,0)$ and $(0,s)$, for any given positive reals $r$ and $s$. Classical notions such as Dyck paths and parking functions are naturally generalized by considering the set of partitions included in a given triangular partition. One of our striking results is that the restriction of the Young lattice to triangular partition has a planar Hasse diagram, wi…
The following thesis contains results on the combinatorial representation theory of the finite Hecke algebra $H_n(q)$. In Chapter 2 simple combinatorial descriptions are given which determine when a Specht module corresponding to a partition $λ$ is irreducible. This is done by extending the results of James and Mathas. These descriptions depend on the crystal of the basic representation of the affine Lie algebra $\widehat{\mathfrak{sl}_\ell}$. In Chapter 3 these results are extended to determine which irreducible modules have a realization as a Specht module. To do this, a new condition of irr…
We prove that the number of even parts and the number of times that parts are repeated have the same distribution over integer partitions with a fixed perimeter. This refines Straub's analog of Euler's Odd-Distinct partition theorem. We generalize the two concerned statistics to these of the part-difference less than $d$ and the parts not congruent to $1$ modulo $d+1$ and prove a distribution inequality, that has a similar flavor as Alder's ex-conjecture, over partitions with a prescribed perimeter. Both of our results are proved analytically and combinatorially.
We give some interpretations to certain integer sequences in terms of parameters on Grand-Dyck paths and coloured noncrossing partitions, and we find some new bijections relating Grand-Dyck paths and signed pattern avoiding permutations. Next we transfer a natural distributive lattice structure on Grand-Dyck paths to coloured noncrossing partitions and signed pattern avoiding permutations, thus showing, in particular, that it is isomorphic to the structure induced by the (strong) Bruhat order on a certain set of signed pattern avoiding permutations.
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.
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.
We examine "partition zeta functions" analogous to the Riemann zeta function but summed over subsets of integer partitions. We prove an explicit formula for a family of partition zeta functions already shown to have nice properties -- those summed over partitions of fixed length -- which yields complete information about analytic continuation, poles and trivial roots of the zeta functions in the family. Then we present a combinatorial proof of the explicit formula, which shows it to be a zeta function analog of MacMahon's partial fraction decomposition of the generating function for partitions…
We give the fermionic character formulas for the spaces of coinvariants obtained from level $k$ integrable representations of $\hat{\mathfrak sl}_2$. We establish the functional realization of the spaces dual to the coinvariant spaces. We parameterize functions in the dual spaces by rigged partitions, and prove the recursion relations for the sets of rigged partitions.
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 extend the block combinatorics partition theorems of Hindman and Milliken in the setting of the recursive system of the block Schreier families (B^xi) consisting of families defined for every countable ordinal xi. Results contain (a) a block partition Ramsey theorem for every countable ordinal xi (Hindman's theorem corresponding to xi=1, and Milliken's theorem to xi a finite ordinal), (b) a countable ordinal form of the block Nash-Williams partition theorem, and (c) a countable ordinal block partition theorem for sets closed in the infinite block analogue of Ellentuck's topolo…
We compare crystal combinatorics of the level 2 Fock space with the classification of unitary irreducible representations of type B rational Cherednik algebras to study how unitarity behaves under parabolic restriction. First, we show that any finite-dimensional unitary irreducible representation of such an algebra is labeled by a bipartition consisting of a rectangular partition in one component and the empty partition in the other component. This is a new proof of a result that can be deduced from theorems of Montarani and Etingof-Stoica. Second, we show that the crystal operators that remov…
Integer compositions, integer partitions, Fibonacci numbers, and generalizations of these have recently been shown to be interconnected via two-toned tilings of horizontal grids. In this article, we present refinements of two-toned tilings, describe functions which analyze them, and apply these to generalizations of integer compositions and partitions which interpolate between the two.
We study combinatorics of billiard partitions which arose recently in the description of periodic trajectories of ellipsoidal billiards in d-dimensional Euclidean and pseudo-Euclidean spaces. Such partitions uniquely codify the sets of caustics, up to their types, which generate periodic trajectories. The period of a periodic trajectory is the largest part while the winding numbers are the remaining summands of the corresponding partition. In order to take into account the types of caustics as well, we introduce weighted partitions. We provide closed forms for the generating functions of these…
We consider maximal non-$l$-intertwining collections, which are a higher-dimensional version of the maximal non-crossing collections which give clusters of Plücker coordinates in the Grassmannian coordinate ring, as described by Scott. We extend a method of Scott for producing such collections, which are related to tensor products of higher Auslander algebras of type $A$. We show that a higher preprojective algebra of the tensor product of two $d$-representation-finite algebras has a $d$-precluster-tilting subcategory. Finally we relate mutations of these collections to a form of tilting for t…
For all positive integers $k,l,n$, the Little Glaisher theorem states that the number of partitions of $n$ into parts not divisible by $k$ and occurring less than $l$ times is equal to the number of partitions of $n$ into parts not divisible by $l$ and occurring less than $k$ times. While this refinement of Glaisher theorem is easy to establish by computation of the generating function, there is still no one-to-one canonical correspondence explaining it. Our paper brings an answer to this open problem through an arithmetical approach. Furthermore, in the case $l=2$, we discuss the possibility …
In this paper, we construct bijections between Dyck paths, noncrossing partitions, and 231-avoiding permutations, which send the area statistic on Dyck paths to the inversion number on noncrossing partitions and on 231-avoiding permutations. This bijection has the additional property that it simultaneously sends the major index on Dyck paths to the sum of the major index and the inverse major index on noncrossing partitions and on 231-avoiding permutations, respectively. Moreover, we provide generalizations of these constructions to the group of signed permutations.
We recast the classical notion of standard tableaux in an alcove-geometric setting and extend these classical ideas to all reduced paths in our geometry. This broader path-perspective is essential for implementing the higher categorical ideas of Elias--Williamson in the setting of quiver Hecke algebras. Our first main result is the construction of light leaves bases of quiver Hecke algebras. These bases are richer and encode more structural information than their classical counterparts, even in the case of the symmetric groups. Our second main result provides path-theoretic generators for the …
We study oscillations in the eigenfunctions for a fractional Schrödinger operator on the real line. An argument in the spirit of Courant's nodal domain theorem applies to an associated local problem in the upper half plane and provides a bound on the number of nodal domains for the extensions of the eigenfunctions. Using the combinatorial properties of noncrossing partitions, we turn the nodal domain bound into an estimate for the number of sign changes in the eigenfunctions. We discuss applications in the periodic setting and the Steklov problem on planar domains.
MacMahon showed that the generating function for partitions into at most $k$ parts can be decomposed into a partial fractions-type sum indexed by the partitions of $k$. In this present work, a generalization of MacMahon's result is given, which in turn provides a full combinatorial explanation.
We review and present new studies on the relation between the partition functions of integrable lattice models and symmetric polynomials, and its combinatorial representation theory based on the correspondence, including our work. In particular, we examine the correspondence between the wavefunctions of the XXZ type, Felderhof type and the boson type integrable models and symmetric polynomials such as the Schur, Grothendieck and symplectic Schur functions. We also give a brief report of our work on generalizing the correspondence between the Felderhof models and factorial Schur and symplectic …
In this paper, we construct a bijection from a set of bounded free Motzkin paths to a set of bounded Motzkin prefixes that induces a bijection from a set of bounded free Dyck paths to a set of bounded Dyck prefixes. We also give bijections between a set of bounded cornerless Motzkin paths and a set of $t$-core partitions, and a set of bounded cornerless symmetric Motzkin paths and a set of self-conjugate $t$-core partitions. As an application, we get explicit formulas for the number of ordinary and self-conjugate $t$-core partitions with a fixed number of corners.
We study some algebraic and combinatorial features of two algebras that arise as quotients of Temperley-Lieb algebras of type $\tilde{C}$, namely, the two-boundary Temperley-Lieb algebra and the symplectic blob algebra. We provide a monomial basis for both algebras. The elements of these bases are parameterized by certain subsets of fully commutative elements. We enumerate these elements according to their affine length.
Symmetric functions provide one of the most efficient tools for combinatorial enumeration, in the context of objects that may be acted upon by permutations. Only assuming a basic knowledge of linear algebra, we introduce and describe the classical toolbox of symmetric functions, and give many examples of their uses. In particular, we present how classical formulas of enumerative combinatorics afford a natural generalization in terms of symmetric functions. We then rapidly present Macdonald symmetric functions and associated operators, to go on with the description of their relations to rectang…
For integers $e,\ell\geq 2$, the level $\ell$ Fock space has an $\mathfrak{sl}_\infty$-crystal structure arising from the action of a Heisenberg algebra, intertwining the $\widehat{\mathfrak{sl}_e}$-crystal. The vertices of these crystals are charged $\ell$-partitions. We give the combinatorial rule for computing the arrows anywhere in the $\mathfrak{sl}_\infty$-crystal. This allows us to pinpoint the location of any charged $\ell$-partition. As an application, we compute the support of the spherical representation of a cyclotomic rational Cherednik algebra, and in particular, the set of param…
The partition number $π(K)$ of a simplicial complex $K\subset 2^{[n]}$ is the minimum integer $ν$ such that for each partition $A_1\uplus\ldots\uplus A_ν= [n]$ of $[n]$ at least one of the sets $A_i$ is in $K$. A complex $K$ is $r$-unavoidable if $π(K)\leq r$. Motivated by the problems of Tverberg-Van Kampen-Flores type, and inspired by the `constraint method' of Blagojević, Frick, and Ziegler, arXiv:1401.0690 [math.CO], we study the combinatorics of $r$-unavoidable complexes.
A basis of the center of the 0-Hecke algebra of an arbitrary finite Coxeter group was described by He in 2015. This basis is indexed by certain equivalence classes of the Coxeter group whose explicit description is rather complicated. Even their number is not obvious. We consider case of the symmetric group $\mathfrak{S}_n$. Building on work of Geck, Kim and Pfeiffer, we obtain a complete set of representatives of the equivalence classes. This set is naturally parametrized by certain compositions of $n$ called maximal. It follows that the maximal compositions of $n$ index the basis of the cent…
One of our result is that 5 measurable sets in $R^8$ always admit an equipartition by 2 hyperplanes. This is an instance of a general equipartition problem (formulated by B. Gr{\" u}nbaum and H. Hadwiger) which can be reduced to the question of (non)existence of a $W_k$-equivariant map where $W_k$ is the group of symmetries of a $k$-cube. We show that the computation of relevant cohomology/bordism obstruction classes often reduces to the question of enumerating the classes of immersed curves in $\mathbb{R}^2$ with a prescribed type and number of intersections with the coordinate axes, which in…
Distance-based methods such as UPGMA (Unweighted Pair Group Method with Arithmetic Mean) continue to play a significant role in phylogenetic research. We use polyhedral combinatorics to analyze the natural subdivision of the positive orthant induced by classifying the input vectors according to tree topologies returned by the algorithm. The partition lattice informs the study of UPGMA trees. We give a closed form for the extreme rays of UPGMA cones on n taxa, and compute the normalized volumes of the UPGMA cones for small n. Keywords: phylogenetic trees, polyhedral combinatorics, partition lat…
The tensor powers of the vector representation associated to an infinite rank quantum group decompose into irreducible components with multiplicities independant of the infinite root system considered. Although the irreducible modules obtained in this way are not of highest weight, they admit a crystal basis and a canonical basis. This permits in particular to obtain for each familly of classical Lie algebras a Robinson-Schensted correspondence on biwords defined on infinite alphabets. We then depict a structure of bi-crystal on these bi-words. This RS-correspondence yields also a plactic alge…
Sometimes we need the approximate value of the partition number in a simple and efficient way. There are already several formulae to calculate the partition number p(n). But they are either inconvenient for most people (not majored in math) who do not want do write programs, or unsatisfying in accuracy. By bringing in two parameters in the Hardy-Ramanujan's Asymptotic formula and fitting the data of the two parameters by least square method, iteration method and some other special designed methods, several revised elementary estimation formulae with high accuracy for p(n) are obtained. With th…
We introduce bijections between generalized type $A_n$ noncrossing partitions (that is, associated to arbitrary standard Coxeter elements) and fully commutative elements of the same type. The latter index the diagram basis of the classical Temperley-Lieb algebra, while for each choice of standard Coxeter element the corresponding noncrossing partitions also index a basis, given by the images in the Temperley-Lieb algebra of the simple elements of the dual Garside structure (associated to this choice of standard Coxeter element) of the Artin braid group on $n+1$ strands. We then show that our b…
The Littelmann path moel gives a realization of the crystals of integrable representations of symmetrizable Kac-Moody Lie algebras. Recent work of Gaussent-Littelmann and others has demonstrated a connection between this model and the geometry of the loop Grassmannian. The alcove walk model is a version of the path model which is intimately connected to the combinatorics of the affine Hecke algebra. In this paper we define a refined alcove walk model which encodes the points of the affine flag variety. We show that this combinatorial indexing naturally indexes the "cells" in generalized Mirkov…
This paper gives a Schur-Weyl duality approach to the representation theory of the affine Hecke algebras of type C with unequal parameters. The first step is to realize the affine braid group of type $C_k$ as the group of braids on $k$ strands with two poles. Generalizing familiar methods from the one pole (type A) case, this provides commuting actions of the quantum group $U_q\mathfrak{g}$ and the affine braid group of type $C_k$ on a tensor space $M\otimes N \otimes V^{\otimes k}$. Special cases provide Schur-Weyl pairings between the affine Hecke algebra of type $C_k$ and the quantum group …
This is a survey on the categorification of the poset of generalized non-crossing partitions, using the representation theory of a hereditary artin algebra H, looking at the set P of exceptional subcategories in mod H. This categorification is due to Ingalls and Thomas, and a subsequent paper by Igusa and Schiffler. Starting point is a refinement of the classical tilting theory for mod H, replacing torsion pairs by torsion triples, thus putting it into the realm of the stability theory of King. The torsion pairs in mod H correspond nicely to the perpendicular pairs of exceptional subcategories…
In this paper we study the topology of the strata, indexed by number partitions $λ$, in the natural stratification of the space of monic hyperbolic polynomials of degree $n$. We prove stabilization theorems for removing an independent block or an independent relation in $λ$. We also prove contractibility of the one-point compactifications of the strata indexed by a large class of number partitions, including $λ=(k^m,1^r)$, for $m\geq 2$. Furthermore, we study the maps between the homology groups of the strata, induced by imposing additional relations (resonances) on the number partition $λ$, o…
We explore combinatorics associated with the degenerate Hecke algebra at $q=0$, obtaining a formula for a system of orthogonal idempotents, and also exploring various pattern avoidance results. Generalizing constructions for the 0-Hecke algebra, we explore the representation theory of $\JJ$-trivial monoids. We then discuss two-tensors of crystal bases for $U_q(\tilde{\mathfrak{sl}_2})$, establishing a complementary result to one of Bandlow, Schilling, and Thiéry on affine crystals arising from promotion operators. Finally, we give a computer implementation of Stembridge's local axioms for simp…
The numerical Hilbert series combinatorics and the comodule Hilbert series combinatorics are introduced, and some applications are presented, including the MacMahon Master Theorem.
We summarize some combinatoric problems solved by the higher Catalan numbers. These problems are generalizations of the combinatoric problems solved by the Catalan numbers. The generating function of the higher Catalan numbers appeared recently as an auxiliary function in enumerating maps and explicit computations of the asymptotic expansion of the partition function of random matrices in the unitary ensemble case. We give combinatoric proofs of the formulas for the number of genus 0 and genus 1 maps.
We demonstrate that statistics of certain classes of set partitions is described by generating functions related to the Burgers, Ibragimov--Shabat and Korteweg--de Vries integrable hierarchies.
Frieze patterns of numbers, introduced in the early 70's by Coxeter, are currently attracting much interest due to connections with the recent theory of cluster algebras. The present paper aims to review the original work of Coxeter and the new developments around the notion of frieze, focusing on the representation theoretic, geometric and combinatorial approaches.
We consider a partially asymmetric exclusion process (PASEP) on a finite number of sites with open and directed boundary conditions. Its partition function was calculated by Blythe, Evans, Colaiori, and Essler. It is known to be a generating function of permutation tableaux by the combinatorial interpretation of Corteel and Williams. We prove bijectively two new combinatorial interpretations. The first one is in terms of weighted Motzkin paths called Laguerre histories and is obtained by refining a bijection of Foata and Zeilberger. Secondly we show that this partition function is the generati…
A universal framework for Hopf algebras in combinatorics
Research Center for Mathematics and Interdisciplinary Sciences, Shandong University（山东大学数学与交叉科学研究院）；Frontiers Science Center for Nonlinear Expectations, Ministry of Education（教育部非线性期望前沿科学中心）；Department of Mathematics, University of British Columbia（不列颠哥伦比亚大学数学系）
We present a beautiful interplay between combinatorial topology and homological algebra for a class of monoids that arise naturally in algebraic combinatorics. We explore several applications of this interplay. For instance, we provide a new interpretation of the Leray number of a clique complex in terms of non-commutative algebra. Résumé. Nous présentons une magnifique interaction entre la topologie combinatoire et l'algèbre homologique d'une classe de monoïdes qui figurent naturellement dans la combinatoire algébrique. Nous explorons plusieurs applications de cette interaction. Par exemple, …
We construct new examples of non-nil algebras with any number of generators, which are direct sums of two locally nilpotent subalgebras. As all previously known examples, our examples are contracted semigroup algebras and the underlying semigroups are unions of locally nilpotent subsemigroups. In our constructions we make more transparent than in the past the close relationship between the considered problem and combinatorics of words.
In order to extend the Schützenberger's factorization to general perturbations, the combinatorial aspects of the Hopf algebra of the $ϕ$-deformed stuffle product is developed systematically in a parallel way with those of the shuffle product.
We prove that the partition function for tripartite double-dimer configurations of a planar bipartite graph satisfies a recurrence related to the Desnanot-Jacobi identity from linear algebra. A similar identity for the dimer partition function was established nearly 20 years ago by Kuo and has applications to random tiling theory and the theory of cluster algebras. This work was motivated in part by the potential for applications in these areas. Additionally, we discuss an application to Donaldson-Thomas and Pandharipande-Thomas theory which will be the subject of a forthcoming paper. The proo…
