Algebraic properties of the binomial edge ideal of a complete bipartite graph
| dc.contributor.author | Schenzel, Peter | |
| dc.contributor.author | Sohail Zafar | |
| dc.date.accessioned | 2015-03-05T12:54:22Z | |
| dc.date.available | 2015-03-05T12:54:22Z | |
| dc.date.issued | 2014 | |
| dc.description.abstract | Let JG denote the binomial edge ideal of a connected undirected graph on n vertices. This is the ideal generated by the binomials xiyj xjyi; 1 _ i < j _ n; in the polynomial ring S = K[x1; : : : ; xn; y1; : : : ; yn] where fi; jg is an edge of G. We study the arithmetic properties of S=JG for G, the complete bipartite graph. In particular we compute dimensions, depths, Castelnuovo-Mumford regularities, Hilbert functions and multiplicities of them. As main results we give an explicit description of the modules of decencies, the duals of local co homology modules, and prove the purity of the minimal free resolution of S=JG. | en_US |
| dc.identifier.citation | 23. Schenzel, P., & Zafar, S. (2014). Algebraic properties of the binomial edge ideal of a complete bipartite graph, to appear in An. St. Univ. Ovidius Constanta, Ser. Mat, 22(2), 217-237. | en_US |
| dc.identifier.uri | https://escholar.umt.edu.pk/handle/123456789/1421 | |
| dc.language.iso | en | en_US |
| dc.publisher | An. St. Univ. Ovidius Constanta | en_US |
| dc.title | Algebraic properties of the binomial edge ideal of a complete bipartite graph | en_US |
| dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Algebraic properties of the binomial edge ideal of a complete bipartite graph.pdf
- Size:
- 790.63 KB
- Format:
- Adobe Portable Document Format
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: