Related papers: Identities of the Kauffman Monoid $\mathcal{K}_3$
We consider pairs of maps from a discrete group to the unitary group. The deficiencies of these maps from being homomorphisms may be great, but if they are close to each other then we call such pairs balanced. We show that balanced pairs…
We introduce an affinization of the quantum Kac-Moody algebra associated to a symmetric generalized Cartan matrix. Based on the affinization, we construct a representation of the quantum Kac-Moody algebra by vertex operators from bosonic…
In a recent paper, Kuperberg described the first subexponential time algorithm for solving the dihedral hidden subgroup problem. The space requirement of his algorithm is super-polynomial. We describe a modified algorithm whose running time…
In this paper we give combinatorial proofs of some well known identities and obtain some generalizations. We give a visual proof of a result of Chapman and Costas-Santos regarding the determinant of sum of matrices. Also we find a new…
Newton's identities provide a way to express elementary symmetric polynomials in terms of power polynomials over fields of characteristic zero. In this article, we study the failure of this relation in positive characteristic and what can…
We study in detail mirror symmetry for the quartic K3 surface in P3 and the mirror family obtained by the orbifold construction. As explained by Aspinwall and Morrison, mirror symmetry for K3 surfaces can be entirely described in terms of…
In this paper we introduce three combinatorial models for symmetrized poly-Bernoulli numbers. Based on our models we derive generalizations of some identities for poly-Bernoulli numbers. Finally, we set open questions and directions of…
The computational cost of simulating quantum many-body systems can often be reduced by taking advantage of physical symmetries. While methods exist for specific symmetry classes, a general algorithm to find the full permutation symmetry…
The incomplete tribonacci polynomials, denoted by T_n^{(s)}(x), generalize the usual tribonacci polynomials T_n(x) and were introduced in [10], where several algebraic identities were shown. In this paper, we provide a combinatorial…
Littlewood-Richardson, Kronecker and plethysm coefficients are fundamental multiplicities of interest in Representation Theory and Algebraic Combinatorics. Determining a combinatorial interpretation for the Kronecker and plethysm…
Let $(\mathsf{hypo}_n,~^\sharp)$ be the hypoplactic monoid of finite rank $n$ with Sch\"{u}tzenberger's involution $^{\sharp}$. In this paper, we exhibit a faithful representation of $(\mathsf{hypo}_n,~^\sharp)$ as an involution monoid of…
Presented are polynomial identities which imply generalizations of Euler and Rogers--Ramanujan identities. Both sides of the identities can be interpreted as generating functions of certain restricted partitions. We prove the identities by…
We point out that the remarkable Knutson and Tao Saturation Theorem and polynomial time algorithms for LP have together an important and immediate consequence in Geometric Complexity Theory. The problem of deciding positivity of…
We establish a simple identity and using it we find a new proof of a result of Kloosterman.
In this note, we find a combinatorial identity which is closely related to the multi-dimensional integral $\gamma_{m}$ in the study of divisor functions. As an application, we determine the finite dual of the group algebra of infinite…
We introduce the combinatorial Lyubeznik resolution of monomial ideals. We prove that this resolution is isomorphic to the usual Lyubezbnik resolution. As an application, we give a combinatorial method to determine if an ideal is a…
We present a generalization of the Newton-Girard identities, along with some applications. As an addendum, we collect many evaluations of symmetric polynomials to which these identities apply.
In this paper, we fix a polynomial with complex coefficients and determine the eigenforms for SL2(Z) which can be expressed as the fixed polynomial evaluated at other eigenforms. In particular, we show that when one excludes trivial cases,…
We determine the values of s and t for which there is a coloring of the edges of the complete bipartite graph K_{s,t} which admits only the identity automorphism. In particular this allows us to determine the distinguishing number of the…
We show that positivity on $\mathbb{R}_+^n$ and on $\mathbb{R}^n$ of real symmetric polynomials of degree at most $p$ in $n\ge2$ variables is solvable by algorithms running in $\mathrm{poly}(n)$ time. For real symmetric quartics, we find…