نتایج جستجو برای: edge ideal

تعداد نتایج: 197645  

Journal: :Proceedings of the American Mathematical Society 2013

Journal: :International Journal of Astronautics and Aeronautical Engineering 2019

2006
Mike Roth Adam Van Tuyl

Let I(G) be the edge ideal associated to a simple graph G. We study the graded Betti numbers that appear in the linear strand of the minimal free resolution of I(G).

2009
SUSAN MOREY

Lower bounds are given for the depths of R/I for t ≥ 1 when I is the edge ideal of a tree or forest. The bounds are given in terms of the diameter of the tree, or in case of a forest, the largest diameter of a connected component and the number of connected components. These lower bounds provide a lower bound on the power for which the depths stabilize.

2004
Ricardo Alberich Jairo Rocha

Some new relations in the family of edge ideal metrics for biopolymers are proved. Also, some statistical relations among the metrics are shown using a big synthetic contact structure set; for unary contact structures, the relations are linear with a high significance.

2006
Margherita Barile

We determine the arithmetical rank of every edge ideal of a Ferrers graph.

2009
Eran Nevo Irena Peeva

We discuss the linearity of the minimal free resolution of a power of an edge ideal.

2004
Levi Schächter John A. Nation

An analytic expression for the limiting current in the vicinity of metallic and dielectric edges is developed. It is shown that the basic V law remains valid and, for large dielectric coefficients (er.5), the average limiting current density is not explicitly dependent on the angle of the metallic edge. Moreover, the limiting current depends primarily on the typical curvature of the emitter and...

ژورنال: پژوهش های ریاضی 2019

Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...

2008
Hidefumi Ohsugi Takayuki Hibi

Let G be a finite graph allowing loops, having no multiple edge and no isolated vertex. We associate G with the edge polytope PG and the toric ideal IG. By classifying graphs whose edge polytope is simple, it is proved that the toric ideals IG of G possesses a quadratic Gröbner basis if the edge polytope PG of G is simple. It is also shown that, for a finite graph G, the edge polytope is simple...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید