English
Related papers

Related papers: On strongly clean matrices over commutative clean …

200 papers

We present algorithms to compute the Smith Normal Form of matrices over two families of local rings. The algorithms use the \emph{black-box} model which is suitable for sparse and structured matrices. The algorithms depend on a number of…

Symbolic Computation · Computer Science 2012-05-01 Mustafa Elsheikh , Mark Giesbrecht , Andy Novocin , B. David Saunders

We introduce the concept of strongly independent matrices over any field, and prove the existence of such matrices for certain fields and the non-existence for algebraically closed fields. Then we apply strongly independent matrices over…

Dynamical Systems · Mathematics 2021-02-19 Huichi Huang , Hanfeng Li , Enhui Shi , Hui Xu

The concept of parity check matrices of linear binary codes has been extended by Heden [9] to parity check systems of nonlinear binary codes. In the present paper we extend this concept to parity check systems of nonlinear codes over finite…

Information Theory · Computer Science 2016-04-26 Thomas Westerbäck

We define and explore in details the class of GUSC rings, that are those rings whose non-invertible elements are uniquely strongly clean. These rings are a common generalization of the so-called USC rings, introduced by Chen-Wang-Zhou in J.…

Rings and Algebras · Mathematics 2024-01-09 Peter Danchev , Omid Hasanzadeh , Ahmad Moussavi

The concept of a fully interlacing matrix of formal power series with real coefficients is introduced. This concept extends and strengthens that of an interlacing sequence of real-rooted polynomials with nonnegative coefficients, in the…

Combinatorics · Mathematics 2024-04-22 Christos A. Athanasiadis , David G. Wagner

We consider codes defined over an affine algebra $\mathcal A=R[X_1,\dots,X_r]/\left\langle t_1(X_1),\dots,t_r(X_r)\right\rangle$, where $t_i(X_i)$ is a monic univariate polynomial over a finite commutative chain ring $R$. Namely, we study…

Information Theory · Computer Science 2017-09-19 E. Martínez-Moro , A. Piñera-Nicolás , I. F. Rúa

We introduce and investigate the so-called D-regularly nil clean rings by showing that these rings are, in fact, a non-trivial generalization of the classical von Neumann regular rings and of the strongly $\pi$-regular rings. Some other…

Rings and Algebras · Mathematics 2019-12-06 Peter V. Danchev

We point out that the usual argument used to prove that $R$ is strongly $F$-regular if and only if $R_{Q}$ is strongly $F$-regular for every prime ideal $Q \in \Spec R$, does not generalize to the case of pairs $(R, \ba^t)$. The author's…

Commutative Algebra · Mathematics 2010-05-11 Karl Schwede

We significantly strengthen results on the structure of matrix rings over finite fields and apply them to describe the structure of the so-called weakly $n$-torsion clean rings. Specifically, we establish that, for any field $F$ with either…

Rings and Algebras · Mathematics 2023-03-20 Adel N. Abyzov , Stephen D. Cohen , Peter V. Danchev , Daniel T. Tapkin

Yet another proof of the result asserting that a morphism of commutative rings is an effective descent morphism for modules if and only if it is pure is given. Moreover, it is shown that this result cannot be derived from Moerdijk's descent…

Category Theory · Mathematics 2012-06-18 Bachuki Mesablishvili

It was conjectured by White in 1980 that the toric ring associated to a matroid is defined by symmetric exchange relations. This conjecture was extended to discrete polymatroids by Herzog and Hibi, and they prove that the conjecture holds…

Commutative Algebra · Mathematics 2022-01-19 Lisa Nicklasson

In regard to our recent studies of rings with (strongly, weakly) nil-clean-like properties, we explore in-depth both the structural and characterization properties of those rings whose elements that are not units are weakly nil-clean. Group…

Rings and Algebras · Mathematics 2024-07-16 Peter Danchev , Arash Javan , Omid Hasanzadeh , Ahmad Moussavi

We give a precise definition of mutation of skew symmetrizable matrices over group rings and relate it to folding and mutation of quivers with symmetries. These matrices can have non-zero diagonal entries and we explain a mutation rule in…

Combinatorics · Mathematics 2026-01-23 Dani Kaufman , Carmen Alves Sabin

We define the concepts of weakly precious and precious rings which generalize the notions of weakly clean and nil-clean rings. We obtain some fundamental properties of these rings. We also obtain certain subclasses of such rings and then…

Rings and Algebras · Mathematics 2014-11-04 Nahid Ashrafi , Marjan Sheibani , Huanyin Chen

We describe isomorphisms between strongly triangular matrix rings that were defined earlier in Berkenmeier et al. (2000) as ones having a complete set of triangulating idempotents, and we show that the so-called triangulating idempotents…

Rings and Algebras · Mathematics 2012-10-18 P. N. Anh , L. van Wyk

In this note we develop a coalgebraic approach to the study of solutions of linear difference equations over modules and rings. Some known results about linearly recursive sequences over base fields are generalized to linearly (bi)recursive…

Rings and Algebras · Mathematics 2007-05-23 Jawad Y. Abuhlail

Idempotent elements play a fundamental role in ring theory, as they encode significant information about the underlying algebraic structure. In this paper, we study idempotent matrices from two perspectives. First, we analyze the partially…

Rings and Algebras · Mathematics 2025-10-13 Sen-Peng Eu , Yong-Siang Lin , Wei-Liang Sun

We gather some classical results and examples that show strict inclusion between the families of unital rings, rings with enough idempotents, rings with sets of local units, locally unital rings, s-unital rings and idempotent rings.

Rings and Algebras · Mathematics 2019-05-28 Patrik Nystedt

Let $R$ be a finite commutative ring with unity $1_R$ and $k \in R$. Properties of one-sided $k$-orthogonal $n \times n$ matrices over $R$ are presented. When $k$ is idempotent, these matrices form a semigroup structure. Consequently new…

Information Theory · Computer Science 2021-03-11 Virgilio P. Sison , Charles R. Repizo

The authors and Fischer recently proved that any hereditary property of two-dimensional matrices (where the row and column order is not ignored) over a finite alphabet is testable with a constant number of queries, by establishing the…

Combinatorics · Mathematics 2017-06-14 Noga Alon , Omri Ben-Eliezer
‹ Prev 1 4 5 6 7 8 10 Next ›