Results 1 to 10 of about 1,404 (215)
Some of the next articles are maybe not open access.
Algebraic invariants of the edge ideals of whisker graphs of cubic circulant graphs [PDF]
Let Q be a polynomial ring over a field F and I be an edge ideal associated with the whisker graph of a cubic circulant graph. We discuss the regularity, depth, Stanley depth, and projective dimension of Q/I.
Mujahid Ullah Khan Afridi +2 more
doaj +2 more sources
Regularity of the edge ideals of perfect [ν,h]-ary trees and some unicyclic graphs [PDF]
We compute the Castelnuovo-Mumford regularity of the quotient rings of edge ideals of perfect [ν,h]-ary trees and some unicyclic graphs.
Fatima Tul Zahra +2 more
doaj +2 more sources
Efficient next-generation reservoir computing: An analog in-memory implementation using memristor crossbar arrays [PDF]
Summary: Reservoir computing has garnered significant attention for its efficiency in processing temporal signals, while the proposed next-generation reservoir computing (NG-RC) further enhances computational efficiency.
Zhuosheng Lin +5 more
doaj +2 more sources
Monomial Ideals with Primary Components given by Powers of Monomial Prime Ideals [PDF]
We characterize monomial ideals which are intersections of powers of monomial prime ideals and study classes of ideals with this property, among them polymatroidal ideals.
Jürgen Herzog, Marius Vlădoiu
openalex +5 more sources
Klyachko Diagrams of Monomial Ideals [PDF]
AbstractIn this paper, we introduce the notion of a Klyachko diagram for a monomial ideal I in a certain multi-graded polynomial ring, namely the Cox ring R of a smooth complete toric variety, with irrelevant maximal ideal B. We present procedures to compute the Klyachko diagram of I from its monomial generators, and to retrieve the B −saturation Isat ...
Rosa M. Miró‐Roig +1 more
openalex +5 more sources
Normality criteria for monomial ideals [PDF]
In this paper we study the normality of monomial ideals using linear programming and graph theory. We give normality criteria for monomial ideals, for ideals generated by monomials of degree two, and for edge ideals of graphs and clutters and their ideals of covers.
Luis A. Dupont +2 more
openalex +3 more sources
ON A CLASS OF MONOMIAL IDEALS [PDF]
AbstractLet $S$ be a polynomial ring over a field $K$ and let $I$ be a monomial ideal of $S$. We say that $I$ is MHC (that is, $I$ satisfies the maximal height condition for the associated primes of $I$) if there exists a prime ideal $\mathfrak{p}\in {\mathrm{Ass} }_{S} \hspace{0.167em} S/ I$ for which $\mathrm{ht} (\mathfrak{p})$ equals the number of ...
Keivan Borna, Raheleh Jafari
openalex +3 more sources

