Related papers: The Combinatorial Astrology of Rabbi Abraham Ibn E…
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…
Contribution of Indian Mathematics since Vedic Period has been recognised by the Historians. Pingala (200 BC) in his book on 'Chandashaastra', a text related to the description and analysis of meters in poetic work, describes algorithms…
Gian-Carlo Rota suggested in one of his last articles the problem of developing a theory around the notion of integration algebras, complementary to the already existing theory of differential algebras. This idea was mainly motivated by…
A partly autobiographical survey of the development of enumerative and algebraic combinatorics in the 1960's and 1970's.
In 1640's, Blaise Pascal discovered a remarkable property of a hexagon inscribed in a conic - Pascal Theorem, which gave birth of the projective geometry. In this paper, a new geometric invariant of algebraic curves is discovered by a…
Following the method of combinatorial telescoping for alternating sums given by Chen, Hou and Mu, we present a combinatorial telescoping approach to partition identities on sums of positive terms. By giving a classification of the…
Many have have taken in hand to write a treatise on the Star of Bethlehem, particularly on Kepler's explanation as a stellar birth, triggered by Mars joining a great conjunction (a meeting of Jupiter and Saturn), as he observed it in…
A well-known problem in Algebraic Combinatorics, is the enumeration of circulant graphs. The failure of Adam's Conjecture for such graphs with order containing a repeated prime, led researchers to investigate the problem using two different…
We present new proofs of two identities arising in the work of Mourad Ismail using partition theoretic generating function interpretations.
In 1750, Gabriel Cramer famously stated, without proof, his eponymous rule for solving a system of linear equations with as many equations as unknowns. We give a purely combinatorial, and purely self-contained, proof of this old chestnut,…
We study the combinatorial representation theory of the ``planar rook algebra" $P_n$. This algebra has a basis consisting of planar rook diagrams and multiplication given by diagram concatenation. For each integer $0 \le k \le n$, we…
An elementary proof is given for a nonterminating "strange" cubic $_7F_6$-series summation formula of Gasper and Rahman, through the modified Abel lemma on summation by parts. As a byproduct, an interesting nonterminating…
We construct a combinatorial model that is described by the cube recurrence, a nonlinear recurrence relation introduced by Propp, which generates families of Laurent polynomials indexed by points in $\mathbb{Z}^3$. In the process, we prove…
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…
The optimal calculation order of a computational graph can be represented by a set of algebraic expressions. Computational graph and algebraic expression both have close relations and significant differences, this paper looks into these…
The topic of this paper is, on the one hand to introduce algebraic analysis results of \'Etienne B\'ezout (1730- 1783) not as we know them today but as he found them in his time, and on the other hand to emphasize his innovating viewpoints.…
Given six points $A,B,C,D,E,F$ on a nonsingular conic in the complex projective plane, Pascal's theorem says that the three intersection points $AE \cap BF, BD \cap CE, AD \cap CF$ are collinear. The line containing them is called a pascal,…
The aim of this paper is to find a general formula to generate any row of Pascal's triangle as an extension of the concept of $\left(11\right)^{n}$. In this study, the visualization of each row of Pascal's triangle has been presented by…
The Ramanujan polynomials were introduced by Ramanujan in his study of power series inversions. In an approach to the Cayley formula on the number of trees, Shor discovers a refined recurrence relation in terms of the number of improper…
This article proves the following theorem, first enunciated by Roger Penrose about 70 years ago but never published: In $\mathbb{R}P^{2}$, if conics are assigned to seven of the vertices of a combinatorial cube such that (i) conics…