University of Tehran

output

19932026

most citedSTDP-based spiking deep convolutional neural networks for object recognition

794 citations

Showing math.ACShow all

29 papers · 1 filter

math.AC2020★ 3 cited

On the depth of symbolic powers of edge ideals of graphs

S. A. Seyed Fakhari

Assume that $G$ is a graph with edge ideal $I (G)$ and star packing number $α_{2} (G)$ . We denote the $s$ -th symbolic power of $I (G)$ by $I (G)^{(s)}$ . It is shown that the inequality $…

math.AC2019★ 3 cited

Regularity of symbolic powers of edge ideals of Cameron-Walker graphs

S. A. Seyed Fakhari

A Cameron-Walker graph is a graph for which the matching number and the induced matching number are the same. Assume that $G$ is a Cameron-Walker graph with edge ideal $I (G)$ , and…

math.AC2019★ 1 cited

Regularity of symbolic powers of edge ideals of unicyclic graphs

S. A. Seyed Fakhari

Let $G$ be a unicyclic graph with edge ideal $I (G)$ . For any integer $s \geq 1$ , we denote the $s$ -th symbolic power of $I (G)$ by $I (G)^{(s)}$ . It is shown that ${\rm reg}(I(G)^{(s)…

math.AC2018★ 2 cited

Some remarks on the comparability of ideals in semirings

H. Behzadipour, P. Nasehpour

A semiring is uniserial if its ideals are totally ordered by inclusion. First, we show that a semiring $S$ is uniserial if and only if the matrix semiring $M_{n} (S)$ is uniserial. As…

math.AC2017

Regularity of symbolic powers of cover ideals of graphs

S. A. Seyed Fakhari

Let $G$ be a graph which belongs to either of the following classes: (i) bipartite graphs, (ii) unmixed graphs, or (iii) claw--free graphs. Assume that $J (G)$ is the cover ideal $G…

math.AC2017

Castelnuovo-Mumford regularity of Koszul cycles and Koszul homologies

Kamran Lamei, Navid Nemati

We extend to one dimensional quotients the result of A. Conca and S. Murai on the convexity of the regularity of Koszul cycles. By providing a relation between the regularity of Ko…