相关论文: Non-commutative Sylvester's determinantal identity
We prove a recursive identity involving formal iterated logarithms and formal iterated exponentials. These iterated logarithms and exponentials appear in a natural extension of the logarithmic formal calculus used in the study of…
Using ideas from automata theory we design a new efficient (deterministic) identity test for the \emph{noncommutative} polynomial identity testing problem (first introduced and studied in \cite{RS05,BW05}). We also apply this idea to the…
We establish a simple identity and using it we find a new proof of a result of Kloosterman.
This paper is concerned with the construction of a small, but non-trivial, example of a polynomial identity algebra, which we call the \emph{Jackson algebra}, that will be used in sequels to this paper to study non-commutative arithmetic…
In this paper, we study the non-Newtonian version of C-algebras. Further, we generalize some results which hold for the classical C-algebras. We also discuss some illustrative examples to show accuracy and effectiveness of the new findings.…
We consider a complete filtered Rota-Baxter algebra of weight $\lambda$ over a commutative ring. Finding the unique solution of a non-homogeneous linear algebraic equation in this algebra, we generalize Spitzer's identity in both…
We obtain a combinatorial formula related to the shear transformation for semi-invariants of binary forms, which implies the classical characterization of semi-invariants in terms of a differential operator. Then, we present a combinatorial…
An identity that is reminiscent of the Littlewood identity plays a fundamental role in recent proofs of the facts that alternating sign triangles are equinumerous with totally symmetric self-complementary plane partitions and that…
This document presents an alternative proof of Sylvester's theorem stating that "the product of $n$ consecutive numbers strictly greater than $n$ is divisible by a prime strictly greater than $n$". In addition, the paper proposes stronger…
We generalize the Abel--Hurwitz identities to an almost entirely noncommutative setting. Namely, let $V$ be a finite set of size $n$, and let $\mathbb{L}$ be any noncommutative ring. For each $s\in V$, let $x_{s}\in\mathbb{L}$. Set $x\left(…
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…
We interpret the symmetrized weight enumerator of linear codes over finite commutative Frobenius rings as a summation over multisets and thereby provide a new proof of the MacWilliams identity for the symmetrized weight enumerator. The…
We introduce a new approach to the classification of operator identities, based on basic concepts from the theory of algebraic operads together with computational commutative algebra applied to determinantal ideals of matrices over…
Classical binomial identities are established by giving probabilistic interpretations to the summands. The examples include Vandermonde identity and some generalizations.
In this paper, we prove two identities on the partition of a totally positive algebraic integer over a totally real number field which are the generalization of the Sylvester Theorem and that of the Rogers-Ramanujan Identities.…
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 obtain a common generalization of two types of Sylvester formulas for compound determinants and its Pfaffian analogue. As applications, we give generalizations of the Giambelli identity to skew Schur functions and the Schur identity to…
In this paper, another proof of Pell identities is presented by using the determinant of tridiagonal matrices. It is calculated via the Laplace expansion.
In this article we provide with combinatorial proofs of some recent identities due to Sury and McLaughlin. We show that, the solution of a general linear recurrence with constant coefficients can be interpreted as a determinant of a matrix.…
We provide a refinement of MacMahon's partition identity on sequence-avoiding partitions, and use it to produce another mod 6 partition identity. In addition, we show that our technique also extends to cover Andrews's generalization of…