Related papers: The Planar Rook Algebra and Pascal's Triangle
We construct C-algebras for a class of surfaces that are inverse images of certain polynomials of arbitrary degree. By using the directed graph associated to a matrix, the representation theory can be understood in terms of ``loop'' and…
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and…
Rook polynomials are a powerful tool in the theory of restricted permutations. It is known that the rook polynomial of any board can be computed recursively, using a cell decomposition technique of Riordan. In this paper, we give a new…
We study the representation theory of three towers of algebras which are related to the symmetric groups and their Hecke algebras. The first one is constructed as the algebras generated simultaneously by the elementary transpositions and…
The rook polynomial is a generating function that enumerates the number of ways to place rooks, with no two in the same row or column, on a collection of cells regarded as a pruned chessboard. In combinatorial commutative algebra, special…
We use binary trees to study the Bratteli diagram of Sylow 2-subgroups of symmetric groups. We show that it is simple, has a recursive structure, and self-similarities at all scales. We contrast its subgraph of one-dimensional…
In this article we associate a combinatorial differential graded algebra to a cubic planar graph G. This algebra is defined combinatorially by counting binary sequences, which we introduce, and several explicit computations are provided. In…
The goal of this paper is to lay the foundations for a combinatorial study, via orthogonal functions and intertwining operators, of category O for the rational Cherednik algebra of type G(r,p,n). As a first application, we give a…
We introduce in this section an Algebraic and Combinatorial approach to the theory of Numbers. The approach rests on the observation that numbers can be identified with familiar combinatorial objects namely rooted trees, which we shall here…
There is a Rota-Baxter algebra structure on the field $A=\mathbf{k}((t))$ with $ P$ being the projection map $A=\mathbf{k}[[t]]\oplus t^{-1}\mathbf{k}[t^{-1}]$ onto $ \mathbf{k}[[ t]]$. We study the representation theory and…
We investigate the representation theory of certain specializations of the Ariki-Koike algebras, obtained by setting $q=0$ in a suitably normalized version of Shoji's presentation. We classify the simple and projective modules, and describe…
In this paper, we enumerate lattice paths with certain constraints and apply the corresponding results to develop formulas for calculating the dimensions of submodules of a class of modules for planar upper triangular rook monoids. In…
We study the representation theory of graded Hecke algebras, starting from scratch and focusing on representations that are obtained with induction from a discrete series representation of a parabolic subalgebra. We determine all…
Take S to be a 4-dimensional Sklyanin (elliptic) algebra that is module-finite over its center Z; thus, S is PI. Our first result is the construction of a Poisson Z-order structure on S such that the induced Poisson bracket on Z is…
In this paper, we discuss modules and structures of the planar upper triangular rook monoid B_n. We first show that the order of B_n is a Catalan number, then we investigate the properties of a module V over B_n generated by a set of…
Cohen and Taylor introduced Plesken Lie algebra as certain Lie algebra constructed using finite groups. Arjun and Romeo described the linear representation of these Lie algebras induced from group representation in [1]. Hence the authors…
The Circle Packing Theorem states that every planar graph can be represented as the tangency graph of a family of internally-disjoint circles. A well-known generalization is the Primal-Dual Circle Packing Theorem for 3-connected planar…
We study paths in the p-Bratteli diagram associated with hook partitions, where p is an odd prime. By comparing blocks along a path, we define inversions and descents. We prove that the sign balance derived from inversions vanishes at every…
In this article, we study rational matrix representations of VZ $p$-groups ($p$ is any prime). Utilizing our findings on VZ $p$-groups, we explicitly obtain all inequivalent irreducible rational matrix representations of all $p$-groups of…
$O(N)$ invariants are the observables of real tensor models. We use regular colored graphs to represent these invariants, the valence of the vertices of the graphs relates to the tensor rank. We enumerate $O(N)$ invariants as $d$-regular…