Related papers: A matrix equation for association schemes
For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…
We consider nonsymmetric hermitian complex Hadamard matrices belonging to the Bose-Mesner algebra of commutative nonsymmetric association schemes. First, we give a characterization of the eigenmatrix of a commutative nonsymmetric…
The general correlation function for the eigenvalues of $p$ complex hermitian matrices coupled in a chain is given as a single determinant. For this we use a slight generalization of a theorem of Dyson.
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…
For the bi-orthogonal polynomials with the third degree polynomial potential functions, the 3 x 3 matrix Riemann-Hilbert problem is explicitly constructed. The developed approach admits an extension to the bi-orthogonal polynomials with…
It is shown in the paper that each Hecke symmetry R with the R-symmetric algebra freely generated by 3 commuting elements is determined by a bivector and a symmetric bilinear form on a 3-dimensional vector space. A general formula for such…
$2\times2$ matrix polynomials of the form $P_{n}(z)= \Sigma^{n}_{j=0}\,\sigma_{j}\,z^{j}$, for the cases $n=1,2,3$ are constructed, and the nature of PT-symmetry is examined across different points $z=(x,y)$ in the complex plane. The…
In this paper we outline a Matrix Ansatz approach to some problems of combinatorial enumeration. The idea is that many interesting quantities can be expressed in terms of products of matrices, where the matrices obey certain relations. We…
In our previous paper math/0502157 we classified a large class of finite-dimensional pointed Hopf algebras up to isomorphism. However the following problem was left open for Hopf algebras of of type $A,D$ or $E_6$, that is whose Cartan…
This article proposes a bivariate polynomial problem for finite-order real matrices that endows a \textit{`sufficient condition'} for a map from the standard vector spaces of finite-order real matrices to the same dimensional bivariate…
We introduce a family of compatible Poisson brackets on the space of $2\times 2$ polynomial matrices, which contains the reflection equation algebra bracket. Then we use it to derive a multi-Hamiltonian structure for a set of integrable…
It is well known that a family of $n\times n$ commuting matrices can be simultaneously triangularized by a unitary similarity transformation. The diagonal entries of the triangular matrices define the $n$ joint eigenvalues of the family. In…
Recently much effort has been made towards the introduction of non-Hermitian random matrix models respecting $PT$-symmetry. Here we show that there is a one-to-one correspondence between complex $PT$-symmetric matrices and split-complex and…
We consider the famous Strassen algorithm for fast multiplication of matrices. We show that this algorithm has a nontrivial finite group of automorphisms of order 36 (namely the direct product of two copies of the symmetric group on 3…
Association schemes on triples (ASTs) are ternary analogues of classical association schemes, whose relations and adjacency algebras are ternary instead of binary. We provide a survey of the current progress in the study of ASTs,…
This paper solves a long standing open problem of whether NP-complete problems could be solved in polynomial time on a deterministic Turing machine by showing that the indistinguishable binomial decision tree can be formed in a 3-SAT…
An $r$-matrix is a matrix with symbols in $\{0,1,\ldots,r-1\}$. A matrix is simple if it has no repeated columns. Let ${\cal F}$ be a finite set of $r$-matrices. Let $\hbox{forb}(m,r,{\cal F})$ denote the maximum number of columns possible…
We call a matrix completely mixable if the entries in its columns can be permuted so that all row sums are equal. If it is not completely mixable, we want to determine the smallest maximal and largest minimal row sum attainable. These…
We prove that there exist bipartite Ramanujan graphs of every degree and every number of vertices. The proof is based on analyzing the expected characteristic polynomial of a union of random perfect matchings, and involves three…
A topological mating is a map defined by gluing together the filled Julia sets of two quadratic polynomials. The identifications are visualized and understood by pinching ray-equivalence classes of the formal mating. For postcritically…