Related papers: Alternating patterns in commutator monomials

We give necessary and sufficient existence criteria, and methods for finding, continuous solutions of linear equations whose coefficients are polynomials.

The paper addresses the calculation of correlation functions of permanental polynomials of matrices with random entries. By exploiting a convenient contour integral representation of the matrix permanent some explicit results are provided…

We give estimates for the convolution product of an arbitrary number of endlessly continuable functions. This allows us to deal with nonlinear operations for the corresponding resurgent series, e.g. substitution into a convergent power…

Non-associative algebras appear in some quantum-mechanical systems, for instance if a charged particle in a distribution of magnetic monopoles is considered. Using methods of deformation quantization it is shown here, that algebras for such…

For various $2\leq n,m \leq 6$, we propose some new algorithms for multiplying an $n\times m$ matrix with an $m \times 6$ matrix over a possibly noncommutative coefficient ring.

Charlier configurations provide a combinatorial model for Charlier polynomials. We use this model to give a combinatorial proof of a multilinear generating function for Charlier polynomials. As special cases of the multilinear generating…

Given a collection P of k^2 commutative polynomials in 2k^2 commutative variables, the objective is to find a condensed representation of these polynomials in terms of a single non-commutative polynomial p(X,Y) in two k x k matrix variables…

We discuss counting problems linked to finite versions of Cantor's diagonal of infinite tableaux. We extend previous results of [2] by refining an equivalence relation that reduces significantly the exhaustive generation. New enumerative…

In this paper we study a class of dynamical systems generated by iterations of multivariate permutation polynomial systems which lead to polynomial growth of the degrees of these iterations. Using these estimates and the same techniques…

We pose and answer several questions concerning the number of ways to fold a polygon to a polytope, and how many polytopes can be obtained from one polygon; and the analogous questions for unfolding polytopes to polygons. Our answers are,…

Representations of polynomial covariance commutation relations by pairs of linear integral and differential operators are constructed in the space of infinitely continuously differentiable functions. Representations of polynomial covariance…

Let $A$ be an algebra and let $f$ be a nonconstant noncommutative polynomial. In the first part of the paper, we consider the relationship between $[A,A]$, the linear span of commutators in $A$, and span$f(A)$, the linear span of the image…

A recently-established necessary condition for polynomials that preserve the class of entrywise nonnegative matrices of a fixed order is shown to be necessary and sufficient for the class of nonnegative monomial matrices. Along the way, we…

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

We consider the 2-generated free metabelian associative and Lie algebras over the complex field and the invariants of the dihedral groups of finite order acting on these algebras. In the associative case we find a finite set of generators…

Consider the algebra Q<<x_1,x_2,...>> of formal power series in countably many noncommuting variables over the rationals. The subalgebra Pi(x_1,x_2,...) of symmetric functions in noncommuting variables consists of all elements invariant…

The theory of symmetric functions has been extended to the case where each variable is paired with an anticommuting one. The resulting expressions, dubbed superpolynomials, provide the natural N=1 supersymmetric version of the classical…

We develop a combinatorial model of the associated Hermite polynomials and their moments, and prove their orthogonality with a sign-reversing involution. We find combinatorial interpretations of the moments as complete matchings, connected…

Under what circumstances might every extension of a combinatorial structure contain more copies of another one than the original did? This property, which we call prolificity, holds universally in some cases (e.g., finite linear orders) and…

It is shown that commutator identities on associative algebras generate solutions of linearized integrable equations. Next, a special kind of the dressing procedure is suggested that in a special class of integral operators enables to…