Gröbner bases for complete uniform families (Q1870286): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4305609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic matching in Boolean algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the density of sets of divisors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shattering news / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sperner families of bounded VC-dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hilbert function and complexity lower bounds for symmetric Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on recent formulas of Wilson and Frankl / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some tapas of computer algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems and mod \(p\) rank of inclusion matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A diagonal form for the incidence matrices of \(t\)-subsets vs. \(k\)- subsets / rank
 
Normal rank

Latest revision as of 15:13, 5 June 2024

scientific article
Language Label Description Also known as
English
Gröbner bases for complete uniform families
scientific article

    Statements

    Gröbner bases for complete uniform families (English)
    0 references
    0 references
    0 references
    11 May 2003
    0 references
    The main result of the paper is the determination of a reduced Gröbner basis for the polynomial ideal over a field which vanishes on the set of characteristic vectors of the complete uniform families \({[n] \choose d}\) of \(d\)-subsets of \([n]=\{1,2, \ldots , n\}\). It turns out that the Gröbner basis is dependent only on the order of the variables. Applications to known combinatorial results are given.
    0 references
    uniform family
    0 references
    inclusion matrix
    0 references
    Hilbert function
    0 references
    reduced Gröbner basis
    0 references

    Identifiers