<p>In this paper, with any weakly factorial domain <i>R</i> that admits at least two maximal ideals, we associate an undirected graph denoted by <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_803_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="60" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {MGP}(R)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="double-struck">MGP</mi> <mo stretchy="false">(</mo> <mi>R</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> with vertex set <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_803_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="243" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathcal{S}\mathcal{Q}(R) = \{Rq\mid q\in \mathcal {P}(R)\backslash J(R)\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">S</mi> <mi mathvariant="script">Q</mi> <mo stretchy="false">(</mo> <mi>R</mi> <mo stretchy="false">)</mo> <mo>=</mo> <mo stretchy="false">{</mo> <mi>R</mi> <mi>q</mi> <mo>∣</mo> <mi>q</mi> <mo>∈</mo> <mi mathvariant="script">P</mi> <mo stretchy="false">(</mo> <mi>R</mi> <mo stretchy="false">)</mo> <mo stretchy="true">\</mo> <mi>J</mi> <mo stretchy="false">(</mo> <mi>R</mi> <mo stretchy="false">)</mo> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation>, where <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_803_Article_IEq3.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="40" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathcal {P}(R)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">P</mi> <mo stretchy="false">(</mo> <mi>R</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> is the set of all primary elements of <i>R</i>, <i>J</i>(<i>R</i>) is the Jacobson radical of <i>R</i>, and distinct vertices <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_803_Article_IEq4.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="28" /> </InlineMediaObject> <EquationSource Format="TEX">\(Rq_{1}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>R</mi> <msub> <mi>q</mi> <mn>1</mn> </msub> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_803_Article_IEq5.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="28" /> </InlineMediaObject> <EquationSource Format="TEX">\(Rq_{2}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>R</mi> <msub> <mi>q</mi> <mn>2</mn> </msub> </mrow> </math></EquationSource> </InlineEquation> are adjacent if and only if <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_803_Article_IEq6.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="112" /> </InlineMediaObject> <EquationSource Format="TEX">\(Rq_{1} +Rq_{2}\subseteq \mathfrak {m}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>R</mi> <msub> <mi>q</mi> <mn>1</mn> </msub> <mo>+</mo> <mi>R</mi> <msub> <mi>q</mi> <mn>2</mn> </msub> <mo>⊆</mo> <mi mathvariant="fraktur">m</mi> </mrow> </math></EquationSource> </InlineEquation> for some maximal ideal <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_803_Article_IEq7.gif" Format="GIF" Height="11" Rendition="HTML" Resolution="72" Type="Linedraw" Width="15" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathfrak {m}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="fraktur">m</mi> </math></EquationSource> </InlineEquation> of <i>R</i>. We call <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_803_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="60" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {MGP}(R)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="double-struck">MGP</mi> <mo stretchy="false">(</mo> <mi>R</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> the maximal graph of <i>R</i>. This paper aims to study the interplay between the graph-theortic properties of <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_803_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="60" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {MGP}(R)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="double-struck">MGP</mi> <mo stretchy="false">(</mo> <mi>R</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> and the ring-theoretic properties of <i>R</i>. Some necessary (resp., sufficient) conditions on the set of all maximal ideals of <i>R</i> are provided such that <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_803_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="60" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {MGP}(R)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="double-struck">MGP</mi> <mo stretchy="false">(</mo> <mi>R</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> is connected. In some cases, a necessary and sufficient condition is determined such that <InlineEquation ID="IEq11"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_803_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="60" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {MGP}(R)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="double-struck">MGP</mi> <mo stretchy="false">(</mo> <mi>R</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> is connected. We provide several examples of weakly factorial domains <i>R</i> such that <InlineEquation ID="IEq12"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_803_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="60" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {MGP}(R)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="double-struck">MGP</mi> <mo stretchy="false">(</mo> <mi>R</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> is connected. We also discuss some results on a subgraph of <InlineEquation ID="IEq13"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_803_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="60" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {MGP}(R)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="double-struck">MGP</mi> <mo stretchy="false">(</mo> <mi>R</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> denoted by <InlineEquation ID="IEq14"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_803_Article_IEq14.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="80" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {SGMGP}(R)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="double-struck">SGMGP</mi> <mo stretchy="false">(</mo> <mi>R</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> with vertex set <InlineEquation ID="IEq15"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_803_Article_IEq15.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="53" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathcal{S}\mathcal{Q}(R)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">S</mi> <mi mathvariant="script">Q</mi> <mo stretchy="false">(</mo> <mi>R</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> and distinct vertices <InlineEquation ID="IEq16"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_803_Article_IEq4.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="28" /> </InlineMediaObject> <EquationSource Format="TEX">\(Rq_{1}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>R</mi> <msub> <mi>q</mi> <mn>1</mn> </msub> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq17"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_803_Article_IEq5.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="28" /> </InlineMediaObject> <EquationSource Format="TEX">\(Rq_{2}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>R</mi> <msub> <mi>q</mi> <mn>2</mn> </msub> </mrow> </math></EquationSource> </InlineEquation> are adjacent if and only if <InlineEquation ID="IEq18"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_803_Article_IEq18.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="137" /> </InlineMediaObject> <EquationSource Format="TEX">\(Rq_{1}\cap Rq_{2}\ne Rq_{1}q_{2}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>R</mi> <msub> <mi>q</mi> <mn>1</mn> </msub> <mo>∩</mo> <mi>R</mi> <msub> <mi>q</mi> <mn>2</mn> </msub> <mo>≠</mo> <mi>R</mi> <msub> <mi>q</mi> <mn>1</mn> </msub> <msub> <mi>q</mi> <mn>2</mn> </msub> </mrow> </math></EquationSource> </InlineEquation>.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Some properties of the maximal graph of a non-quasi-local weakly factorial domain and a subgraph of it

  • S. Visweswaran

摘要

In this paper, with any weakly factorial domain R that admits at least two maximal ideals, we associate an undirected graph denoted by \(\mathbb {MGP}(R)\) MGP ( R ) with vertex set \(\mathcal{S}\mathcal{Q}(R) = \{Rq\mid q\in \mathcal {P}(R)\backslash J(R)\}\) S Q ( R ) = { R q q P ( R ) \ J ( R ) } , where \(\mathcal {P}(R)\) P ( R ) is the set of all primary elements of R, J(R) is the Jacobson radical of R, and distinct vertices \(Rq_{1}\) R q 1 and \(Rq_{2}\) R q 2 are adjacent if and only if \(Rq_{1} +Rq_{2}\subseteq \mathfrak {m}\) R q 1 + R q 2 m for some maximal ideal \(\mathfrak {m}\) m of R. We call \(\mathbb {MGP}(R)\) MGP ( R ) the maximal graph of R. This paper aims to study the interplay between the graph-theortic properties of \(\mathbb {MGP}(R)\) MGP ( R ) and the ring-theoretic properties of R. Some necessary (resp., sufficient) conditions on the set of all maximal ideals of R are provided such that \(\mathbb {MGP}(R)\) MGP ( R ) is connected. In some cases, a necessary and sufficient condition is determined such that \(\mathbb {MGP}(R)\) MGP ( R ) is connected. We provide several examples of weakly factorial domains R such that \(\mathbb {MGP}(R)\) MGP ( R ) is connected. We also discuss some results on a subgraph of \(\mathbb {MGP}(R)\) MGP ( R ) denoted by \(\mathbb {SGMGP}(R)\) SGMGP ( R ) with vertex set \(\mathcal{S}\mathcal{Q}(R)\) S Q ( R ) and distinct vertices \(Rq_{1}\) R q 1 and \(Rq_{2}\) R q 2 are adjacent if and only if \(Rq_{1}\cap Rq_{2}\ne Rq_{1}q_{2}\) R q 1 R q 2 R q 1 q 2 .