Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSymbolic Rees algebras, vertex covers and irreducible representations of Rees cones
120
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Let G be a simple graph and let J be its ideal of vertex covers. We give a graph theoretical description of the irreducible b-vertex covers of G, i.e., we describe the minimal generators of the symbolic Rees algebra of J. Then we study the irreducible b-vertex covers of the blocker of G, i.e., we study the minimal generators of the symbolic Rees algebra of the edge ideal of G. We give a graph theoretical description of the irreducible binary b-vertex covers of the blocker of G. It is shown that they correspond to irreducible induced subgraphs of G. As a byproduct we obtain a method, using Hilbert bases, to obtain all irreducible induced subgraphs of G. In particular we obtain all odd holes and antiholes. We study irreducible graphs and give a method to construct irreducible b-vertex covers of the blocker of G with high degree relative to the number of vertices of G.
rate research
Read More
In this thesis we are interested in studying algebraic properties of monomial algebras, that can be linked to combinatorial structures, such as graphs and clutters, and to optimization problems. A goal here is to establish bridges between commutative algebra, combinatorics and optimization. We study the normality and the Gorenstein property-as well as the canonical module and the a-invariant-of Rees algebras and subrings arising from linear optimization problems. In particular, we study algebraic properties of edge ideals and algebras associated to uniform clutters with the max-flow min-cut property or the packing property. We also study algebraic properties of symbolic Rees algebras of edge ideals of graphs, edge ideals of clique clutters of comparability graphs, and Stanley-Reisner rings.
Let $G$ be a simple graph on $n$ vertices and $J_G$ denote the binomial edge ideal of $G$ in the polynomial ring $S = mathbb{K}[x_1, ldots, x_n, y_1, ldots, y_n].$ In this article, we compute the second graded Betti numbers of $J_G$, and we obtain a minimal presentation of it when $G$ is a tree or a unicyclic graph. We classify all graphs whose binomial edge ideals are almost complete intersection, prove that they are generated by a $d$-sequence and that the Rees algebra of their binomial edge ideal is Cohen-Macaulay. We also obtain an explicit description of the defining ideal of the Rees algebra of those binomial edge ideals.
We establish basic properties of a sheaf of graded algebras canonically associated to every relative affine scheme $f : X rightarrow S$ endowed with an action of the additive group scheme $mathbb{G}_{ a,S}$ over a base scheme or algebraic space $S$, which we call the (relative) Rees algebra of the $mathbb{G}_{ a,S}$-action. We illustrate these properties on several examples which played important roles in the development of the algebraic theory of locally nilpotent derivations and give some applications to the construction of families of affine threefolds with Ga-actions.
Let $R$ be the face ring of a simplicial complex of dimension $d-1$ and ${mathcal R}(mathfrak{n})$ be the Rees algebra of the maximal homogeneous ideal $mathfrak{n}$ of $R.$ We show that the generalized Hilbert-Kunz function $HK(s)=ell({mathcal R}(mathfrak n)/(mathfrak n, mathfrak n t)^{[s]})$ is given by a polynomial for all large $s.$ We calculate it in many examples and also provide a Macaulay2 code for computing $HK(s).$
Building on coprincipal mesoprimary decomposition [Kahle and Miller, 2014], we combinatorially construct an irreducible decomposition of any given binomial ideal. In a parallel manner, for congruences in commutative monoids we construct decompositions that are direct combinatorial analogues of binomial irreducible decompositions, and for binomial ideals we construct decompositions into ideals that are as irreducible as possible while remaining binomial. We provide an example of a binomial ideal that is not an intersection of binomial irreducible ideals, thus answering a question of Eisenbud and Sturmfels [1996].
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
