Results 31 to 40 of about 138,912 (199)
The aim of this work is to study the v-number of edge ideals of clutters and graphs. We relate the v-number with the regularity of edge ideals and study the combinatorial structure of the graphs whose edge ideals have their second symbolic power Cohen-Macaulay.
Jaramillo, Delio, Villarreal, Rafael H.
openaire +2 more sources
Depth and Stanley depth of the edge ideals of the powers of paths and cycles
Let k be a positive integer. We compute depth and Stanley depth of the quotient ring of the edge ideal associated to the kth power of a path on n vertices.
Iqbal Zahid, Ishaq Muhammad
doaj +1 more source
Regularity of second power of edge ideals
Introduction The study of the minimal free resolution of homogenous ideals and their powers is an interesting and active area of research in commutative algebra.
Seyed Amin Seyed Fakhari
doaj
Ideal acoustic quantum spin Hall phase in a multi-topology platform
Here the authors investigate a comprehensive topological phase diagram of bilayer hexagonal acoustic lattice, including ideal quantum spin Hall phase with gapless helical edge states. They realize a broadband topological slow wave.
Xiao-Chen Sun +5 more
doaj +1 more source
Generalized binomial edge ideals
This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr bner basis can be computed by studying paths in the graph.
openaire +2 more sources
Cohen–Macaulayness for symbolic power ideals of edge ideals
Let $S = K[x_1,..., x_n]$ be a polynomial ring over a field $K$. Let $I(G) \subseteq S$ denote the edge ideal of a graph $G$. We show that the $\ell$th symbolic power $I(G)^{(\ell)}$ is a Cohen-Macaulay ideal (i.e., $S/I(G)^{(\ell)}$ is Cohen-Macaulay) for some integer $\ell \ge 3$ if and only if $G$ is a disjoint union of finitely many complete graphs.
RINALDO, GIANCARLO +2 more
openaire +4 more sources
On the binomial edge ideals of block graphs
We find a class of block graphs whose binomial edge ideals have minimal regularity. As a consequence, we characterize the trees whose binomial edge ideals have minimal regularity.
Chaudhry Faryal +2 more
doaj +1 more source
Binomial edge ideals of regularity 3 [PDF]
Let $J_G$ be the binomial edge ideal of a graph $G$. We characterize all graphs whose binomial edge ideals, as well as their initial ideals, have regularity $3$. Consequently we characterize all graphs $G$ such that $J_G$ is extremal Gorenstein. Indeed, these characterizations are consequences of an explicit formula we obtain for the regularity of the ...
Saeedi Madani, Sara, Kiani, Dariush
openaire +2 more sources
Nondegenerate two-way edge channels of plasmons in networks
An effective one-dimensional channel is formed at the periphery of a two-dimensional electron gas by electronic edge states. Robust edge states with suppressed dissipation arise from the Landau quantization in a strong magnetic field, and propagation ...
Ken-ichi Sasaki
doaj +1 more source
Vertical Diamond p-n Junction Diode with Step Edge Termination Structure Designed by Simulation
In this paper, diamond-based vertical p-n junction diodes with step edge termination are investigated using a Silvaco simulation (Version 5.0.10.R). Compared with the conventional p-n junction diode without termination, the step edge termination shows ...
Guangshuo Cai +6 more
doaj +1 more source

