The polynomial degrees of Grassmann and Segre varieties over GF(2) (Q2470456): Difference between revisions

From MaRDI portal
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 08:15, 5 March 2024

scientific article
Language Label Description Also known as
English
The polynomial degrees of Grassmann and Segre varieties over GF(2)
scientific article

    Statements

    The polynomial degrees of Grassmann and Segre varieties over GF(2) (English)
    0 references
    0 references
    14 February 2008
    0 references
    The author deals with polynomial degrees of Grassmann and Segre varietes over GF(2) and two important results are given as Theorem 3.2 and Theorem 3.4 respectively: i) For \(m\leq n\) the polynomial degree \(\delta _{m,n}\) of the Segre variety \( S_{m,n}\subset PG(mn+m+n,2)\) is \(d_{m,n}=mn+m\). ii) Let \(\Gamma =(A\cup B,e)\) be any finite bipartite graph which is a subgraph of the complete bipartite graph \(K_{a,b}\) whose parts \(A,B\) have sizes \(a,b\) with \(a\leq b\). Let \(N(\Gamma )\) denote the total number of subgraphs of \(\Gamma \) which are isomorphic to \(\Gamma _{a',b'}\) for some \( a'\leq a\), \(b'\leq b\). Then \(N(\Gamma )\) is odd for all such graphs \(\Gamma \) of size \(| e| >ab-b\). Moreover there exists at least one such graph \(\Gamma \) of size \(| e| >ab-b\) for which \(N(\Gamma )\) is even.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    polynomial degree
    0 references
    Grassmanian variety
    0 references
    Segre variety
    0 references
    subgraph
    0 references
    0 references