Spiking neural P systems with anti-spikes (shortly named ASN P systems) are a class of distributed and parallel neural-like computing systems. Besides spikes, neurons in ASN P systems can also contain a number of anti-spikes. Whenever spikes and anti-spikes meet in a neuron, they annihilate each other immediately in a maximal manner, that is, the annihilation has priority over neuron’s spiking....

Let I be a monomial squarefree ideal of a polynomial ring S over a field K such that the sum of every three different ideals of its minimal prime ideals is the maximal ideal of S, or more generally a constant ideal. We associate to I a graph on [s], s = |MinS/I|, on which we may read the depth of I. In particular, depthS I does not depend on char K. Also we show that I satisfies Stanley’s Conje...

There is a natural graph associated to the zero-divisors of a commutative semiring with non-zero identity. In this article we essentially study zero-divisor graphs with respect to primal and non-primal ideals of a commutative semiring R and investigate the interplay between the semiring-theoretic properties of R and the graph-theoretic properties of ΓI(R) for some ideal I of R. We also show tha...

In this paper, we propose a sparse and low-rank decomposition of annihilating filter-based Hankel matrix for removing MR artifacts such as motion, RF noises, or herringbone artifacts. Based on the observation that some MR artifacts are originated from k-space outliers, we employ a recently proposed image modeling method using annihilating filter-based low-rank Hankel matrix approach (ALOHA) to ...

This paper studies connections between the preprojective modules over the path algebra of a finite connected quiver without oriented cycles, the (+)-admissible sequences of vertices, and the Weyl group. For each preprojective module, there exists a unique up to a certain equivalence shortest (+)-admissible sequence annihilating the module. A (+)-admissible sequence is the shortest sequence anni...

We characterize all pairs of graphs (G1, G2), for which the binomial edge ideal JG1,G2 has linear relations. We show that JG1,G2 has a linear resolution if and only if G1 and G2 are complete and one of them is just an edge. We also compute some of the graded Betti numbers of the binomial edge ideal of a pair of graphs with respect to some graphical terms. In particular, we show that for every p...

‎Let $X=left(‎ ‎begin{array}{llll}‎ ‎ x_1 & ldots & x_{n-1}& x_n\‎ ‎ x_2& ldots & x_n & x_{n+1}‎ ‎end{array}right)$ be the Hankel matrix of size $2times n$ and let $G$ be a closed graph on the vertex set $[n].$ We study the binomial ideal $I_Gsubset K[x_1,ldots,x_{n+1}]$ which is generated by all the $2$-minors of $X$ which correspond to the edges of $G.$ We show that $I_G$ is Cohen-Macaula...

let $i$ be a proper ideal of a commutative semiring $r$ and let $p(i)$ be the set of all elements of $r$ that are not prime to $i$. in this paper, we investigate the total graph of $r$ with respect to $i$, denoted by $t(gamma_{i} (r))$. it is the (undirected) graph with elements of $r$ as vertices, and for distinct $x, y in r$, the vertices $x$ and $y$ are adjacent if and only if $x + y in p(i)...

We prove that a binomial edge ideal of a graph G has a quadratic Gröbner basis with respect to some term order if and only if the graph G is closed with respect to a given labelling of the vertices. We also state some criteria for the closedness of a graph G that do not depend on the labelling of its vertex set.