Related papers: Zero-Sum Triangles for Involutory, Idempotent, Nil…
We provide a novel recursive method, which does not require any assumption, to compute the entries of the kth power of a semicirculant matrix. As an application, a method for computing the entries of the kth power of r-circulant matrices is…
We describe and present a new construction method for codes using encodings from group rings. They consist primarily of two types: zero-divisor and unit-derived codes. Previous codes from group rings focused on ideals; for example cyclic…
The purpose of this note is to extend in a simple and unified way the known results on interlacing of zeros of paraorthogonal polynomials on the unit circle. These polynomials can be regarded as the characteristic polynomials of any matrix…
Traces of inverse powers of a positive definite symmetric tridiagonal matrix give lower bounds of the minimal singular value of an upper bidiagonal matrix. In a preceding work, a formula for the traces which gives the diagonal entries of…
We consider a family of integer sequences generated by nonlinear recurrences of the second order, which have the curious property that the terms of the sequence, and integer multiples of the ratios of successive terms (which are also…
We study the triangle inequalities for angles (with different definitions) and present inequalities concerning the entries of correlation matrices through the positivity of $3\times 3$ matrices. We extend our discussions to the inequalities…
It is becoming increasingly clear that the supercharacter theory of the finite group of unipotent upper-triangular matrices has a rich combinatorial structure built on set-partitions that is analogous to the partition combinatorics of the…
Orthogonal sets of idempotents are used to design sets of unitary matrices, known as constellations, such that the modulus of the determinant of the difference of any two distinct elements is greater than $0$. It is shown that unitary…
In the current paper the authors linked two methods in order to evaluate general n-th order tridiagonal determinants. A breakdown free numerical algorithm is developed for computing the inverse of any nxn general nonsingular tridiagonal…
In this paper we introduce a class of regular bipartite graphs whose biadjacency matrices are circulant matrices and we describe some of their properties. Notably, we compute upper and lower bounds for the zero forcing number for such a…
We prove that if an involution in a ring is the sum of an idempotent and a nilpotent then the idempotent in this decomposition must be 1. As a consequence, we completely characterize weakly nil-clean rings introduced recently in [Breaz,…
We show that any nonsingular (real or complex) square matrix can be factorized into a product of at most three normal matrices, one of which is unitary, another selfadjoint with eigenvalues in the open right half-plane, and the third one is…
The manuscript studies configurations of non-overlapping non-bonding dominoes on finite rectangular boards of unit squares characterized by row and column number. The non-bonding dominoes are defined here by the requirement that any domino…
In this article we present a new recurrence formula for a finite sum involving the Fibonacci sequence. Furthermore, we state an algorithm to compute the sum of a power series related to Fibonacci series, without the use of term-by-term…
A problem that is frequently encountered in a variety of mathematical contexts, is to find the common invariant subspaces of a single, or set of matrices. A new method is proposed that gives a definitive answer to this problem. The key idea…
This paper studies symmetric tensor decompositions. For symmetric tensors, there exist linear relations of recursive patterns among their entries. Such a relation can be represented by a polynomial, which is called a generating polynomial.…
In this paper, we define Tribonacci-Lucas polynomials and present Tribonacci-Lucas numbers and polynomials as a binomial sum. Then, we introduce incomplete Tribonacci-Lucas numbers and polynomials. In addition we derive recurrence…
For a nonsingular matrix $A$, we propose the form $Tr(^t\!A A^{-1})$, the trace of the product of its transpose and inverse, as a new invariant under congruence of nonsingular matrices.
We derive a new set of sum rules between the neutrino mass and mixing parameters in vacuum and their effective counterparts in matter. The moduli of nine genuine lepton mixing matrix elements can then be calculated in terms of the…
The purpose of this paper is to introduce basic concepts that are fundamental in the examination of composite moduli, while avoiding the notoriously difficult problem of prime-factorization. We introduce a new class of numbers, called…