Matchings in simplicial complexes, circuits and toric varieties

Authors:
Anargyros Katsabekis;Apostolos Thoma
Affiliations:
Department of Mathematics, University of Ioannina, Ioannina 45110, Greece;Department of Mathematics, University of Ioannina, Ioannina 45110, Greece
Venue:
Journal of Combinatorial Theory Series A
Year:
2007

Citing 2
Cited 0

Triangulations of polytopes and computational algebra

Triangulations of polytopes and computational algebra
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs

SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

Using a generalized notion of matching in a simplicial complex and circuits of vector configurations, we compute lower bounds for the minimum number of generators, the binomial arithmetical rank and the A-homogeneous arithmetical rank of a lattice ideal. Prime lattice ideals are toric ideals, i.e. the defining ideals of toric varieties.