arXiv subjects

Mahdi Reza Khorsandi

Publications and source records attributed to Mahdi Reza Khorsandi.

4 recordsLinked to original sources

arXiv2024

Some factorization properties of idealization in commutative rings with zero divisors

We study some factorization properties of the idealization $R \mathop{(\! + \! )} M$ of a module $M$ in a commutative ring $R$ which is not necessarily a domain. We show that $R \mathop{(\! + \! )} M$ is ACCP if and only if $R$ is ACCP and $M$ satisfies ACC on its cyclic submodules. We give an example to show that the BF property is not necessarily preserved in idealization, and give some conditions under which $R \mathop{(\! + \! )} M$ is a BFR. We also characterize the idealization rings which are UFRs.

math.AC↗

arXiv2021

On the nonorientable genus of the generalized unit and unitary Cayley graphs of a commutative ring

Let $R$ be a commutative ring and let $U(R)$ be multiplicative group of unit elements of $R$. In 2012, Khashyarmanesh et al. defined generalized unit and unitary Cayley graph, $Γ(R, G, S)$, corresponding to a multiplicative subgroup $G$ of $U(R)$ and a non-empty subset $S$ of $G$ with $S^{-1}=\{s^{-1} \mid s\in S\}\subseteq S$, as the graph with vertex set $R$ and two distinct vertices $x$ and $y$ are adjacent if and only if there exists $s\in S$ such that $x+sy \in G$. In this paper, we characterize all Artinian rings $R$ whose $Γ(R,U(R), S)$ is projective. This leads to determine all Artinian rings whose unit graphs, unitary Cayley garphs and co-maximal graphs are projective. Also, we prove that for an Artinian ring $R$ whose $Γ(R, U(R), S)$ has finite nonorientable genus, $R$ must be a finite ring. Finally, it is proved that for a given positive integer $k$, the number of finite rings $R$ whose $Γ(R, U(R), S)$ has nonorientable genus $k$ is finite.

math.AC↗

arXiv2020

Absence of $1$-Nearly Platonic Graphs

A $t$-nearly platonic graph is a finite, connected, regular, simple and planar graph in which all but exactly $t$ numbers of its faces have the same length. It is proved that there is no 2-connected $1$-nearly platonic graph. In this paper, we prove that there is no $1$-nearly platonic graph.

math.CO↗

arXiv2017

MCD-finite Domains and Ascent of IDF Property in Polynomial Extensions

An integral domain is said to have the IDF property when every non-zero element of it has only a finite number of non-associate irreducible divisors. A counterexample has already been found showing that IDF property does not necessarily ascend in polynomial extensions. In this paper, we introduce a new class of integral domains, called MCD-finite domains, and show that for any domain $D$, $D[X]$ is an IDF domain if and only if $D$ is both IDF and MCD-finite. This result entails all the previously known sufficient conditions for the ascent of the IDF property. Our new characterization of polynomial domains with the IDF property enables us to use a different construction and build another counterexample which strengthen the previously known result on this matter.

math.AC↗