Related papers: Identities of the Kauffman Monoid $\mathcal{K}_3$

Let C be a depth-3 circuit with n variables, degree d and top fanin k (called sps(k,d,n) circuits) over base field F. It is a major open problem to design a deterministic polynomial time blackbox algorithm that tests if C is identically…

In this paper we formulate combinatorial identities that give representation of positive integers as linear combination of even powers of 2 with binomial coefficients. We present side by side combinatorial as well as computer generated…

Let ${\frak K}$ be a class of combinatorial objects invariant with respect to a given regular cyclic group. It is proved that the isomorphism of any two objects $X,Y\in{\frak K}$ can be tested in polynomial time in sizes of $X$ and $Y$.

In the paper we provide some polynomial identities for finite-dimensional algebras. A list of well known single polynomial identities is exposed and the classification of all $2$-dimensional algebras with respect to these identities is…

We study \emph{multiplicity equivalence} testing of automata over partially commutative monoids (pc monoids) and show efficient algorithms in special cases, exploiting the structure of the underlying non-commutation graph of the monoid.…

The classic Cayley identity states that \det(\partial) (\det X)^s = s(s+1)...(s+n-1) (\det X)^{s-1} where X=(x_{ij}) is an n-by-n matrix of indeterminates and \partial=(\partial/\partial x_{ij}) is the corresponding matrix of partial…

The matrix elements of unitary $SU_q(3)$ corepresentations, which are analogues of the symmetric powers of the natural repesentation, are shown to be the bivariate $q$-Krawtchouk orthogonal polynomials, thus providing an algebraic…

We prove some combinatorial identities using the Polya urn and the closely related Hoppe urn.

We develop a combinatorial approach to the study of semigroups and monoids with finite presentations satisfying small overlap conditions. In contrast to existing geometric methods, our approach facilitates a sequential left-right analysis…

Let $\mathbb{F}$ be a field of characteristic $p$, and let $UT_n(\mathbb{F})$ be the algebra of $n \times n$ upper triangular matrices over $\mathbb{F}$ with an involution of the first kind. In this paper we describe: the set of all…

In this note, we prove some combinatorial identities and obtain a simple form of the eigenvalues of $q$-Kneser graphs.

A polynomial-time algorithm for computing the permanent in any field of characteristic 3 is presented in this article. The principal objects utilized for that purpose are the Cauchy and Vandermonde matrices, the discriminant function and…

In this paper, we obtain a generalization of an identity due to Carlitz on Bernoulli polynomials. Then we use this generalized formula to derive two symmetric identities which reduce to some known identities on Bernoulli polynomials and…

We provide geometric methods and algorithms to verify, construct and enumerate pairs of words (of specified length over a fixed $m$-letter alphabet) that form identities in the semigroup $\ut{n}$ of $n\times n$ upper triangular tropical…

We study the problem of determining a matrix whose $k$th multiplicative compound is a prescribed matrix~$M$. The cardinality of the set of matrices whose $k$th multiplicative compound equals~$M$ is characterized in terms of $\rank(M)$. On…

In this paper, we provide a deterministic polynomial time algorithm that determines satisfiability of 3-SAT. The complexity analysis for the algorithm takes into account no efficiency and yet provides a low enough bound, that efficient…

Using the braided version of Lawvere's algebraic theories and Mac Lane's PROPs, we introduce polynomial identities for arbitrary algebraic structures in a braided monoidal category C as well as their codimensions in the case when C is…

We first establish the result that the Narayana polynomials can be represented as the integrals of the Legendre polynomials. Then we represent the Catalan numbers in terms of the Narayana polynomials by three different identities. We give…

Let K be a field of positive characteristic p, let R be either a group algebra K[G] or a restricted enveloping algebra u(L), and let I be the augmentation ideal of R. We first characterize those R for which I satisfies a polynomial identity…

We naturally obtain some combinatorial identities finding the difference analogs of hyperbolic and trigonometric functions of order $n.$ In particular, we obtain the identities connected with the proved in the paper the addition formulas…