Some meeting points of gröbner bases and combinatorics

Bálint Felszeghy, Lajos Rónyai

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Citations (Scopus)

Abstract

Let be a field, be a set of points, and denote by I(V) the vanishing ideal of V in the polynomial ring. Several interesting algebraic and combinatorial problems can be formulated in terms of some finite V, and then Gröbner bases and standard monomials of I(V) yield a powerful tool for solving them. We present the Lex Game method, which allows one to efficiently compute the lexicographic standard monomials of I(V) for any finite set. We apply this method to determine the Gröbner basis of I(V) for some V of combinatorial and algebraic interest, and present four applications of this type. We give a new easy proof of a theorem of Garsia on a generalization of the fundamental theorem of symmetric polynomials. We also reprove Wilson's theorem concerning the modulo p rank of some inclusion matrices. By examining the Gröbner basis of the vanishing ideal of characteristic vectors of some specific set systems, we obtain results in extremal combinatorics. Finally, we point out a connection among the standard monomials of I(V) and I(Vc), where V⊆ {0,1}n and Vc={0,1}n\V. This has immediate consequences in combinatorial complexity theory. The main results have appeared elsewhere in several papers. We collected them into a unified account to demonstrate the usefulness of Gröbner basis methods in combinatorial settings.

Original languageEnglish
Title of host publicationAlgorithmic Algebraic Combinatorics and Gröbner Bases
PublisherSpringer Berlin Heidelberg
Pages207-227
Number of pages21
ISBN (Print)9783642019593
DOIs
Publication statusPublished - Dec 1 2009

Keywords

  • Gröbner basis
  • Hilbert function
  • Inclusion matrix
  • Lexicographic order
  • Rank formula
  • Standard monomial
  • Vanishing ideal

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Some meeting points of gröbner bases and combinatorics'. Together they form a unique fingerprint.

  • Cite this

    Felszeghy, B., & Rónyai, L. (2009). Some meeting points of gröbner bases and combinatorics. In Algorithmic Algebraic Combinatorics and Gröbner Bases (pp. 207-227). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-01960-9_6