Related papers: Determinants of Block Matrices with Noncommuting B…

Let R be a commutative ring and let n,m be two positive integers. Let be the polynomial ring in m x n commuting independent variables R. The symmetric group on n letters acts diagonally on A(n,m). We give generators and relations of the…

Let $R$ be a commutative ring with identity. An element $r \in R$ is said to be absolutely irreducible in $R$ if for all natural numbers $n>1$, $r^n$ has essentially only one factorization namely $r^n = r \cdots r$. If $r \in R$ is…

Let $k$ be a nonnegative integer, and let $\alpha$ and $\beta$ be two permutations of $n$ symbols. We say that $\alpha$ and $\beta$ $k$-commute if $H(\alpha\beta, \beta\alpha)=k$, where $H$ denotes the Hamming metric between permutations.…

Let Y be the variety of (skew) symmetric nxn-matrices of rank less than or equal to r. In paper we construct a full faithful embedding between the derived category of a non-commutative resolution of Y, constructed earlier by the authors,…

A commutative ring R is locally stable provided that for any $a,b\in R$ such that $aR+bR=R$, there exist some $y\in R$ such that $R/(a+by)R$ has stable range 1.For a Bezout ring $R$, we prove that $R$ is an elementary divisor ring if and…

In this note, we give a necessary and sufficient condition for a matrix A in M to be finitely G-determined, where M is the ring of 2 x 2 matrices whose entries are formal power series over an infinite field, and G is a group acting on M by…

This paper introduces inexact versions of several block-splitting preconditioners for solving the three-by-three block linear systems arising from a special class of indefinite least squares problems. We first establish the convergence…

Baur and Marsh computed the determinant of a matrix assembled from the cluster variables in a cluster algebra of type A. In this article we wish to describe two variations. On the one hand, we compute determinants of matrices assembled from…

We construct $R$-matrices (with a multidimensional spectral parameter) that include additive as well as non-additive parameters. They satisfy the colored Yang-Baxter equation. The solutions depend on a set of commuting operators. They…

We consider the state determination problem using Mutually Unbiased Bases(MUBs). For spin-1, spin-3/2 and spin-2 systems, analogous to Pauli operators of spin-1/2 system, which are experimentally implementable and correspond to the optimum…

In this paper, we present a new formula of the determinant tensor $det_n$ for $n \times n$ matrices. In \cite{kim2023newdet4}, Kim, Ju, and Kim found a new formula of $4 \times 4$ determinant tensor $det_4$ which is available when the base…

Let $R$ be a finite ring and $r \in R$. The aim of this paper is to study the probability that the commutator of a randomly chosen pair of elements of $R$ equals $r$.

We present a stationary iteration based upon a block splitting for a class of indefinite least squares problem. Convergence of the proposed method is investigated and optimal value of the involving parameter is used. The induced…

This article studies separating invariants for the ring of multisymmetric polynomials in $m$ sets of $n$ variables over an arbitrary field $\mathbb{K}$. We prove that in order to obtain separating sets it is enough to consider polynomials…

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…

The Varchenko matrix is known to have a well-structured determinant for complexes of oriented matroids (COMs). COMs can be characterized as partial cubes that do not have certain forbidden pc-minors. In this work, we generalize the…

The element distinctness problem is the problem of determining whether the elements of a list are distinct, that is, if $x=(x_1,...,x_N)$ is a list with $N$ elements, we ask whether the elements of $x$ are distinct or not. The solution in a…

Given a square, nonsingular matrix of univariate polynomials $\mathbf{F}\in\mathbb{K}[x]^{n\times n}$ over a field $\mathbb{K}$, we give a deterministic algorithm for finding the determinant of $\mathbf{F}$. The complexity of the algorithm…

Let $p$ be a multilinear polynomial in several non-commuting variables with coefficients in a quadratically closed field $K$ of any characteristic. It has been conjectured that for any $n$, the image of $p$ evaluated on the set $M_n(K)$ of…

A new determinant inequality of positive semidefinite matrices is discovered and proved by us. This new inequality is useful for attacking and solving a variety of optimization problems arising from the design of wireless communication…