Zobrazeno 1 - 10
of 168
pro vyhledávání: '"RINALDO, GIANCARLO"'
We prove that cycles, wheels and block graphs have sequentially Cohen-Macaulay binomial edge ideals. Moreover, we provide a construction of new families of sequentially Cohen-Macaulay graphs by cones.
Comment: In this version we have made a subs
Comment: In this version we have made a subs
Externí odkaz:
http://arxiv.org/abs/2405.08671
We classify path polyominoes which are level and pseudo-Gorenstein. Moreover, we compute all level and pseudo-Gorenstein simple thin polyominoes with rank less than or equal to 10. We also compute the regularity of the pseudo-Gorenstein simple thin p
Externí odkaz:
http://arxiv.org/abs/2308.05461
Several algebraic properties of a binomial edge ideal $J_G$ can be interpreted in terms of combinatorial properties of its associated graph $G$. In particular, the so-called cut-point sets of a graph $G$, special sets of vertices that disconnect $G$
Externí odkaz:
http://arxiv.org/abs/2306.17076
A combinatorial property that characterizes Cohen-Macaulay binomial edge ideals has long been elusive. A recent conjecture ties the Cohen-Macaulayness of a binomial edge ideal $J_G$ to special disconnecting sets of vertices of its underlying graph $G
Externí odkaz:
http://arxiv.org/abs/2212.09181
Autor:
Rinaldo, Giancarlo, Sarkar, Rajib
Publikováno v:
J. Algebra, 2023, 632, pp. 363-383
We prove that level binomial edge ideals with regularity 2 and pseudo-Gorenstein binomial edge ideals with regularity 3 are cones, and we describe them completely. Also, we characterize level and pseudo-Gorenstein binomial edge ideals of bipartite gr
Externí odkaz:
http://arxiv.org/abs/2208.05340
Let $G$ be a simple graph on $n$ vertices and let $J_{G,m}$ be the generalized binomial edge ideal associated to $G$ in the polynomial ring $K[x_{ij}, 1\le i \le m, 1\le j \le n]$. We classify the Cohen-Macaulay generalized binomial edge ideals. More
Externí odkaz:
http://arxiv.org/abs/2112.15136
Publikováno v:
Res Math Sci (2022) 9:39
In this paper we provide a full combinatorial characterization of sequentially Cohen-Macaulay binomial edge ideals of closed graphs. In addition, we show that a binomial edge ideal of a closed graph is approximately Cohen-Macaulay if and only if it i
Externí odkaz:
http://arxiv.org/abs/2112.04361
We present a conjecture about the reduced Hilbert series of the coordinate ring of a simple polyomino in terms of particular arrangements of non-attacking rooks that can be placed on the polyomino. By using a computational approach, we prove that the
Externí odkaz:
http://arxiv.org/abs/2111.01907
We describe the simplicial complex $\Delta$ such that the initial ideal of $J_G$ is the Stanley-Reisner ideal of $\Delta$. By $\Delta$ we show that if $J_G$ is $(S_2)$ then $G$ is accessible. We also characterize all accessible blocks with whiskers o
Externí odkaz:
http://arxiv.org/abs/2107.04539
We study powers of binomial edge ideals associated with closed and block graphs.
Externí odkaz:
http://arxiv.org/abs/2009.08341