Related papers: Determinant and inverse of join matrices on two se…

In this paper we use matrices, whose entries satisfy certain linear conditions, to obtain composition identities $f(x_i)f(y_i)=f(z_i)$, where $f(x_i)$ is an irreducible form, with integer coefficients, of degree $n$ in $n$ variables ($n$…

We explore the asymptotic convergence and nonasymptotic maximal inequalities of supermartingales and backward submartingales in the space of positive semidefinite matrices. These are natural matrix analogs of scalar nonnegative…

An element of a group is \emph{reversible} if it is conjugate to its own inverse, and it is \emph{strongly reversible} if it is conjugate to its inverse by an involution. A group element is strongly reversible if and only if it can be…

We investigate the join semilattice of modal operators on a Boolean algebra $B$. Furthermore, we consider pairs $(f,g)$ of modal operators whose supremum is the unary discriminator on $B$, and study the associated bi--modal algebras.

Under binary matrices we mean matrices whose entries take one of two values. In this paper, explicit formulae for calculating the determinant of some type of binary Toeplitz matrices are obtained. Examples of the application of the…

This paper studies the problem of decomposing a low-rank positive-semidefinite matrix into symmetric factors with binary entries, either $\{\pm 1\}$ or $\{0,1\}$. This research answers fundamental questions about the existence and…

We describe the variety of fixed points of a unipotent operator acting on the space of matrices. We compute the determinant and the rank of a generic (symmetric, or anti-symmetric) matrix in the fixed variety, yielding information about the…

If a graph has a non-singular adjacency matrix, then one may use the inverse matrix to define a (labeled) graph that may be considered to be the inverse graph to the original one. It has been known that an adjacency matrix of a tree is…

Subsets of a matrix algebra over a field that are invariant under conjugation and contain the linear span of each two of their commuting elements are described. They obviously include the subsets of diagonalizable and nilpotent matrices. In…

We introduce determinantal sieving, a new, remarkably powerful tool in the toolbox of algebraic FPT algorithms. Given a polynomial $P(X)$ on a set of variables $X=\{x_1,\ldots,x_n\}$ and a linear matroid $M=(X,\mathcal{I})$ of rank $k$,…

Recently there has been several works estimating the number of $n\times n$ matrices with elements from some finite sets $\mathcal X$ of arithmetic interest and of a given determinant. Typically such results are compared with the trivial…

We study the functional equation $A\circ X=X\circ B$, where $A,$ $B$, and $X$ are polynomials over $\mathbb C$. Using previous results of the author about polynomials sharing preimages of compact sets, we show that for given $B$ its…

Using results of Fayers on the structure of Specht modules, we prove two different formulae for the determinant of matrices which are obtained by amalgamating the entries of two smaller matrices. In particular, this gives formulae for…

In this paper, we consider the problem of representing a multivariate polynomial as the determinant of a definite (monic) symmetric/Hermitian linear matrix polynomial (LMP). Such a polynomial is known as determinantal polynomial.…

We exhibit explicit expressions, in terms of components, of discriminants, determinants, characteristic polynomials and polynomial identities for matrices of higher rank. We define permutation tensors and in term of them we construct…

This paper generalizes the results obtained in an earlier paper (math.OA/0003087) for finite factors to infinite but still semifinite factors. First we give a characterization of cyclic and separating vectors for infinite semifinite factors…

Parametrization of complex 4 x 4 - matrices G in terms of Dirac tensor parameters (A,B,A_{l},B_{l},F_{kl}) or equivalent four complex 4-vectors (k,m,n,l) is investigated. In the given parametrization, the problem of inverting any 4 x 4…

We compute two parametric determinants in which rows and columns are indexed by compositions, where in one determinant the entries are products of binomial coefficients, while in the other the entries are products of powers. These results…

It is known that that the centralizer of a matrix over a finite field depends, up to conjugacy, only on the type of the matrix, in the sense defined by J. A. Green. In this paper an analogue of the type invariant is defined that in general…

We derive an identity for the determinant of the sum of two $n\times n$ matrices, $A$ and $B$, whose entries are defined via contour integrals. Specifically, we consider $A(i,j)=\frac{1}{2\pi\mathrm{i}}\oint_0…