On directed zero-divisor graphs of finite rings

For an artinian ring $R$, the directed zero-divisor graph $\Gamma(R)$ is connected if and only if there is no proper one-sided identity element in $R$. Sinks and sources are characterized and clarified for finite ring $R$, especially, it is proved that for {\it any} ring $R$, if there exists a source $b$ in $\Gamma(R)$ with $b^2=0$, then $|R|=4$ and $R=\{0,a,b,c\}$, where $a$ and $c$ are left identity elements and $ba=0=bc$. Such a ring $R$ is also the only ring such that $\Gamma (R)$ has exactly one source. This shows that $\Gamma(R)$ can not be a network for any ring $R$.Comment: 13 pages; with some minor improvement

Monomial ideals under ideal operations

In this paper, we show for a monomial ideal $I$ of $K[x_1,x_2,\ldots,x_n]$ that the integral closure \ol{I} is a monomial ideal of Borel type (Borel-fixed, strongly stable, lexsegment, or universal lexsegment respectively), if $I$ has the same property. We also show that the $k^{th}$ symbolic power $I^{(k)}$ of $I$ preserves the properties of Borel type, Borel-fixed and strongly stable, and $I^{(k)}$ is lexsegment if $I$ is stably lexsegment. For a monomial ideal $I$ and a monomial prime ideal $P$, a new ideal $J(I, P)$ is studied, which also gives a clear description of the primary decomposition of $I^{(k)}$. Then a new simplicial complex $_J\bigtriangleup$ of a monomial ideal $J$ is defined, and it is shown that $I_{_J\bigtriangleup^{\vee}} = \sqrt{J}$. Finally, we show under an additional weak assumption that a monomial ideal is universal lexsegment if and only if its polarization is a squarefree strongly stable ideal.Comment: 18 page

Perfect Sets and ff-Ideals

A square-free monomial ideal $I$ is called an {\it $f$-ideal}, if both $\delta_{\mathcal{F}}(I)$ and $\delta_{\mathcal{N}}(I)$ have the same $f$-vector, where $\delta_{\mathcal{F}}(I)$ ($\delta_{\mathcal{N}}(I)$, respectively) is the facet (Stanley-Reisner, respectively) complex related to $I$. In this paper, we introduce and study perfect subsets of $2^{[n]}$ and use them to characterize the $f$-ideals of degree $d$. We give a decomposition of $V(n, 2)$ by taking advantage of a correspondence between graphs and sets of square-free monomials of degree $2$, and then give a formula for counting the number of $f$-ideals of degree $2$, where $V(n, 2)$ is the set of $f$-ideals of degree 2 in $K[x_1,\ldots,x_n]$. We also consider the relation between an $f$-ideal and an unmixed monomial ideal.Comment: 15 page