Related papers: Two generalizations of ideal matrices and their ap…
Distance ideals generalize the Smith normal form of the distance matrix of a graph. The family of graphs with 2 trivial distance ideals contains the family of graphs whose distance matrix has at most 2 invariant factors equal to 1. Here we…
New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…
In this paper, we consider graded near-rings over a monoid $G$ as a generalizations of graded rings over groups. We introduce certain innovative graded prime ideals and study some of its basic properties over graded near-rings.
In the context of linear inverse problems, we propose and study a general iterative regularization method allowing to consider large classes of regularizers and data-fit terms. The algorithm we propose is based on a primal-dual diagonal…
We construct a class of positive linear maps on matrix algebras. We find conditions when these maps are atomic, decomposable and completely positive. We obtain a large class of atomic positive linear maps. As applications in quantum…
Ideals in Leavitt path algebras have been shown to share many properties with those of integral domains. Since studying factorizations of ideals in integral domains into special types of ideals (particularly, prime, prime-power, primary,…
In order to precondition Toeplitz systems, we present a new class of simultaneously diagonalizable real matrices, the Gamma-matrices, which include both symmetric circulant matrices and a subclass of the set of all reverse circulant…
Lenstra's concept of Euclidean ideals generalizes the Euclidean algorithm; a domain with a Euclidean ideal has cyclic class group, while a domain with a Euclidean algorithm has trivial class group. This paper generalizes Harper's variation…
Using the idea of quasi-ideals of $P$-regular nearrings, the concept of bi-ideals of $P$-regular nearrings is generalized, which is an extension of the concept of quasi-ideals of $P$-regular nearrings and some interesting characterizations…
As a result of their applications in network coding, space-time coding, and coding for criss-cross errors, matrix codes have garnered significant attention; in various contexts, these codes have also been termed rank-metric codes,…
In this article we overview those aspects of the theory of affine semigroups and their algebras that have been relevant for our own research, and pose several open problems. Answers to these problems would contribute substantially to the…
Given a parity-check matrix $H_m$ of a $q$-ary Hamming code, we consider a partition of the columns into two subsets. Then, we consider the two codes that have these submatrices as parity-check matrices. We say that anyone of these two…
We characterize monomial ideals which are intersections of monomial prime ideals and study classes of ideals with this property, among them polymatroidal ideals.
The problem of diagonalizing a class of complicated matrices, to be called ultrametric matrices, is investigated. These matrices appear at various stages in the description of disordered systems with many equilibrium phases by the technique…
We solve a problem posed by Cardinali and Sastry [2] about factorization of $2$-covers of finite classical generalized quadrangles. To that end, we develop a general theory of cover factorization for generalized quadrangles, and in…
We discuss and provide nontrivial evidence for a large class of dualities in three-dimensional field theories with different gauge groups. We match the full partition functions of the dual phases for any value of the couplings to underpin…
We show that for the edge ideals of the graphs consisting of one cycle or two cycles of any length connected through a vertex or a path, the arithmetical rank equals the projective dimension.
The generalized sequence of numbers is defined by W_{n}=pW_{n-1}+qW_{n-2} with initial conditions W_{0}=a and W_{1}=b for a,b,p,q\inZ and n\geq2, respectively. Let W_{n}=circ(W_{1},W_{2},...,W_{n}). The aim of this paper is to establish…
By double ideal quotient, we mean $(I:(I:J))$ where ideals $I$ and $J$. In our previous work [11], double ideal quotient and its variants are shown to be very useful for checking prime divisor and generating primary component. Combining…
Cyclic codes are an interesting type of linear codes and have applications in communication and storage systems due to their efficient encoding and decoding algorithms. They have been studied for decades and a lot of progress has been made.…