Related papers: A matrix approach to the Yang multiplication theor…
The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion-contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a…
The problem of polynomial least squares fitting in the standard Lagrange basis is addressed in this work. Although the matrices involved in the corresponding overdetermined linear systems are not totally positive, rectangular totally…
This paper is devoted to the study of the log-convexity of combinatorial sequences. We show that the log-convexity is preserved under componentwise sum, under binomial convolution, and by the linear transformations given by the matrices of…
We propose a method based on the Wang-Landau algorithm to numerically generate the spectral densities of random matrix ensembles. The method employs Dyson's log-gas formalism for random matrix eigenvalues and also enables one to…
We give a general multiplication-convolution identity for the multivariate and bivariate rank generating polynomial of a matroid. The bivariate rank generating polynomial is transformable to and from the Tutte polynomial by simple algebraic…
Based on the method which is given in Ref. [Sun et.al. arXiv:0904.0092v1], we present another $9\times 9$ unitary $\breve{R}-$matrix, solution of the Yang-Baxter Equation, is obtained in this paper. The entanglement properties of…
We study integrable dynamical systems described by a Lax pair involving a spectral parameter. By solving the classical Yang-Baxter equation when the R-matrix has two poles we show that they can be interpreted as natural motions on a twisted…
We present a simple proof of the factorization of (complex) symmetric matrices into a product of a square matrix and its transpose, and discuss its application in establishing a uniqueness property of certain antilinear operators.
We calculate the general planar dual-conformally invariant double-pentagon and pentabox integrals in four dimensions. Concretely, we derive one-fold integral representations for these elliptic integrals over polylogarithms of weight three.…
Consider the Laguerre polynomials and deform them by the introduction in the measure of an exponential singularity at zero. In [Chen Y., Its A., J. Approx. Theory 162 (2010), 270-297, arXiv:0808.3590] the authors proved that this…
A method of constructing $n^{2}\times n^{2}$ matrix solutions(with $n^{3}$ matrix elements) of Temperley-Lieb algebra relation is presented in this paper. The single loop of these solutions are $d=\sqrt{n}$. Especially, a $9\times9-$matrix…
This dissertation presents a multifaceted look into the structural decomposition of permutation classes. The theory of permutation patterns is a rich and varied field, and is a prime example of how an accessible and intuitive definition…
Several years ago, it was proposed that the usual solutions of the Yang-Baxter equation associated to Lie groups can be deduced in a systematic way from four-dimensional gauge theory. In the present paper, we extend this picture, fill in…
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…
In this paper, we connect two well established theories, the Fibonacci numbers and the Jordan algebras. We give a series of matrices, from literature, used to obtain recurrence relations of second-order and polynomial sequences. We also…
We have new solutions to the Yang-Baxter equation, from which we have constructed new link invariants containing more than two arbitrary parameters. This may be regarded as a generalization of the Jones' polynomial. We have also found…
A constructive proof of identification of multilinear decompositions of multiway arrays is presented. It can be applied to show identification in a variety of multivariate latent structures. Examples are finite-mixture models and hidden…
Linear algebra algorithms often require some sort of iteration or recursion as is illustrated by standard algorithms for Gaussian elimination, matrix inversion, and transitive closure. A key characteristic shared by these algorithms is that…
Efficient deterministic algorithms to construct representations of lattice path matroids over finite fields are presented. They are built on known constructions of hierarchical secret sharing schemes, a recent characterization of…
If $R$ is a commutative unital ring and $M$ is a unital $R$-module, then each element of $\operatorname{End}_R(M)$ determines a left $\operatorname{End}_{R}(M)[X]$-module structure on $\operatorname{End}_{R}(M)$, where…