Related papers: Zero-Sum Triangles for Involutory, Idempotent, Nil…
Commutative semirings with divisible additive semigroup are studied. We show that an additively divisible commutative semiring is idempotent, provided that it is finitely generated and torsion. In case that a one-generated additively…
We give a criterion for rings with $\m^3=0$ which are obtained as connected sums of two other rings to have non-trivial totally acyclic modules.
A selfadjoined block tridiagonal matrix with positive definite blocks on the off-diagonals is by definition a Jacobi matrix with matrix entries. Transfer matrix techniques are extended in order to develop a rotation number calculation for…
We explore how the combinatorial arrangement of prescribed zeros in a matrix affects the possible eigenvalues that the matrix can obtain. We demonstrate that there are inertially arbitrary patterns having a digraph with no 2-cycle, unlike…
The notion of clean rings and 2-good rings have many variations, and have been widely studied. We provide a few results about two new variations of these concepts and discuss the theory that ties these variations to objects and properties…
In 2020, Cossu and Zanardo raised a conjecture on the idempotent factorization on singular matrices in the form $\begin{pmatrix} p&z\\ \bar{z}&\sfrac{\lVert z\rVert}{p} \end{pmatrix},$ where $p$ is a prime integer which is irreducible but…
Determinants of structured matrices play a fundamental role in both pure and applied mathematics, with wide-ranging applications in linear algebra, combinatorics, coding theory, and numerical analysis. In this work, the enumeration of…
We characterize a family of number triangles whose production matrices are closely related to the original number triangle. We study a number of such triangles that are of combinatorial significance. For a specific subfamily, these…
In this paper we provide concrete constructions of idempotents to represent typical singular matrices over a given ring as a product of idempotents and apply these factorizations for proving our main results. We generalize works due to…
We consider the theoretical and numerical aspects of the quadrature rules associated with a sequence of polynomials generated by a special $R_{II}$ recurrence relation. We also look into some methods for generating the nodes (which lie on…
The primary goal of this paper is to introduce and investigate generalized incomplete exponential functions with matrix parameters. Integral representation, differential formula, addition formula, multiplication formula, and recurrence…
We investigate determinantal varieties for symmetric matrices that have zero blocks along the main diagonal. In theoretical physics, these arise as Gram matrices for kinematic variables in quantum field theories. We study the ideals of…
We study which matrices are sums of idempotents over a field of non-zero characteristic; in particular, we prove that any such matrix, provided it is large enough, is actually a sum of five idempotents, and even of four when the field is a…
By using the quasi-determinant the construction of Gel'fand et al. leads to the inverse of a matrix with noncommuting entries. In this work we offer a new method that is more suitable for physical purposes and motivated by deformation…
There is a decomposition of a Lie algebra for open matrix chains akin to the triangular decomposition. We use this decomposition to construct unitary irreducible representations. All multiple meson states can be retrieved this way.…
We give several descriptions of positive quadrature formulas which are exact for trigonometric -, respectively, Laurent polynomials of degree less or equal $n-1-m$, $0\leq m\leq n-1$. A complete and simple description is obtained with the…
We determine those k-tuples of conjugacy classes of matrices, from which it is possible to choose matrices which have no common invariant subspace and have sum zero. This is an additive version of the Deligne-Simpson problem. We deduce the…
A number $s$ is the sum of the entries of the inverse of an $n \times n, (n \geq 3)$ upper triangular matrix with entries from the set $\{0, 1\}$ if and only if $s$ is an integer lying between $2-F_{n-1}$ and $2+F_{n-1}$, where $F_n$ is the…
We define recurrence matrices and study a few properties (links with automatic sequences, branch groups etc.) of them.
We investigate the problem asking when any square matrix whose entries lie in a finite field of characteristic 2 is decomposable into the sum of a diagonalizable matrix and a nilpotent matrix with index of nilpotency at most 2 and, as a…