ﻻ يوجد ملخص باللغة العربية
We derive an equation that is analogous to a well-known symmetric function identity: $sum_{i=0}^n(-1)^ie_ih_{n-i}=0$. Here the elementary symmetric function $e_i$ is the Frobenius characteristic of the representation of $mathcal{S}_i$ on the top homology of the subset lattice $B_i$, whereas our identity involves the representation of $mathcal{S}_ntimes mathcal{S}_n$ on the Segre product of $B_n$ with itself. We then obtain a q-analogue of a polynomial identity given by Carlitz, Scoville and Vaughan through examining the Segre product of the subspace lattice $B_n(q)$ with itself. We recognize the connection between the Euler characteristic of the Segre product of $B_n(q)$ with itself and the representation on the Segre product of $B_n$ with itself by recovering our polynomial identity from specializing the identity on the representation of $mathcal{S}_itimes mathcal{S}_i$.
In this paper we shall survey the various methods of evaluating Hankel determinants and as an illustration we evaluate some Hankel determinants of a q-analogue of Catalan numbers. Here we consider $frac{(aq;q)_{n}}{(abq^{2};q)_{n}}$ as a q-analogue o
Zero forcing is a combinatorial game played on a graph where the goal is to start with all vertices unfilled and to change them to filled at minimal cost. In the original variation of the game there were two options. Namely, to fill any one single ve
Motivated by the Hankel determinant evaluation of moment sequences, we study a kind of Pfaffian analogue evaluation. We prove an LU-decomposition analogue for skew-symmetric matrices, called Pfaffian decomposition. We then apply this formula to evalu
We answer a question posed by Michael Aissen in 1979 about the $q$-analogue of a classical theorem of George Polya (1922) on the algebraicity of (generalized) diagonals of bivariate rational power series. In particular, we prove that the answer to Ai
A $q$-analogue of a $t$-design is a set $S$ of subspaces (of dimension $k$) of a finite vector space $V$ over a field of order $q$ such that each $t$ subspace is contained in a constant $lambda$ number of elements of $S$. The smallest nontrivial feas