Related papers: On evaluation of permanents
Semipositive matrices (matrices that map at least one nonnegative vector to a positive vector) and minimally semipositive matrices (semipositive matrices whose no column-deleted submatrix is semipositive) are well studied in matrix theory.…
Accurate simulations of isotropic permanent magnets require to take the magnetization process into account and consider the anisotropic, nonlinear, and hysteretic material behaviour near the saturation configuration. An efficient method for…
Let $S$ be an additively idempotent semiring and $\mathbf{M}_n(S)$ be the semiring of all $n\times n$ matrices over $S$. We characterize the conditions of when the semiring $\mathbf{M}_n(S)$ is congruence-simple provided that the semiring…
We prove that for any $\lambda > 1$, fixed in advance, the permanent of an $n \times n$ complex matrix, where the absolute value of each diagonal entry is at least $\lambda$ times bigger than the sum of the absolute values of all other…
We investigate linearity of amalgams of subgroups of algebraic groups along intersections with algebraic subgroups. In the process, we establish linearity of certain "doubles" of linear groups, and obtain new examples of finitely generated…
Here we characterize the linear operators that preserve rank of matrices over additively idempotent and multiplicatively cancellative semirings. The main results in this article generalize the corresponding results on the two element…
Since for the classification of finite (congruence-)simple semirings it remains to classify the additively idempotent semirings, we progress on the characterization of finite simple additively idempotent semirings as semirings of…
In this study, we introduce the concept of commutative quaternions and commutative quaternion matrices. Firstly, we give some properties of commutative quaternions and their Hamilton matrices. After that we investigate commutative…
We study endomorphism rings of principally polarized abelian surfaces over finite fields from a computational viewpoint with a focus on exhaustiveness. In particular, we address the cases of non-ordinary and non-simple varieties. For each…
We study the problem when every matrix over a division ring is representable as either the product of traceless matrices or the product of semi-traceless matrices, and also give some applications of such decompositions. Specifically, we…
We give an elementary approach to studying whether rings of $S$-integers in complex quadratic fields are Euclidean with respect to the $S$-norm.
We study the structure of ideals generated by some classes of 2 \times 2 permanents of hypermatrices. This generalizes [9] on 2 x 2 permanental ideal of generic matrices. We compare the obtained structure to that of the corresponding…
We use algebraic geometry to study matrix rigidity, and more generally, the complexity of computing a matrix-vector product, continuing a study initiated by Kumar, et. al. We (i) exhibit many non-obvious equations testing for (border)…
We investigate the problem of deciding whether a system of linear equations, together with divisibility conditions on the variables, has a solution over holomorphy subrings of global fields. We obtain decidability results when we allow…
It is well-known that the evaluation of the permanent of an arbitrary $(-1,1)$-matrix is a formidable problem. Ryser's formula is one of the fastest known general algorithms for computing permanents. In this paper, Ryser's formula has been…
The matrix permanent belongs to the complexity class #P-Complete. It is generally believed to be computationally infeasible for large problem sizes, and significant research has been done on approximation algorithms for the matrix…
In this article, the ring of polynomials is studied in a systematic way through the theory of monoid rings. As a consequence, this study provides natural and canonical approaches in order to find easy and rigorous proofs and methods for…
We provide a complete classification of matrix semirings $\mathbf{M}_n(S)$ over two-element additively idempotent semirings $S$ with respect to the finite basis property.Our main theorem shows that for every integer $n \geq 2$,the semiring…
The computational complexity of the circuit evaluation problem for finite semirings is considered, where semirings are not assumed to have an additive or multiplicative identity. The following dichotomy is shown: If a finite semiring is…
In this note we construct a solution of a matrix interval linear equation of the form X=AX+B (the discrete stationary Bellman equation) over partially ordered semirings, including the semiring of nonnegative real numbers and all idempotent…