Sparse systems of parameters for determinantal varieties

DOI10.1006/AAMA.1997.0559MaRDI QIDQ1384035zbMATH OpenOpenAlexFDO

Authors Donna Glassbrenner, K. E. Smith

Publication date 9 February 2000

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/662bfd98625ba4ed7a5217c7c76797514c57fb64

zbMATH Keywords

Chow formdeterminantal varietiesNoether complexityPlücker coordinatessparse parameters

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Determinantal varieties (14M12) Computational aspects of higher-dimensional varieties (14Q15)

Review text

Let \(X\subset {\mathbb P}(V)\) be an irreducible projective variety, where \(V\) is an \(N\) dimensional vector space over an infinite field \(K\). Then a general linear subspace \({\mathbb P}(W)\) of codimension \(\dim X+1\) will not intersect \(X\). If we start with a basis of \(V\) and write the linear equations for \(\mathbb{P}(W)\), then the equations with respect to the chosen coordinates are of the form \(\sum\lambda_{ij}X_j\) where \(\lambda_{ij}\in K\), and we can talk of the number of non-zero \(\lambda_{ij}\)'s in these equations. Of course, this is not well defined, but for example if we wrote the Plücker-coordinates, then it is. At any rate, the smallest such number we can get by choosing different \(W\) is called the complexity of \(X\). (Having a lot of zeros make \(W\) and thus \(X\) computationally simple.) This notion was introduced by \textit{D. Eisenbud} and \textit{B. Sturmfels} [J. Pure Appl. Algebra 94, No. 2, 143-157 (1994; Zbl 0807.13012)]. The authors study this concept when \(X\) is a determinantal variety -- the most ubiquitous varieties arising in computations. As one can see, this concept is closely related to the Chow form of \(X\) and the authors compute the Chow forms for certain determinantal varieties.

Recommendations

• Computing Chow forms and some applications
• A lower bound for the determinantal complexity of a hypersurface
• scientific article; zbMATH DE number 16651
• Sur la complexité du calcul des projections d'une courbe projective
• Publication:4735257
• Counting irreducible components of complex algebraic varieties
• On the complexity of counting components of algebraic varieties
• The Hurwitz form of a projective variety
• Flattenings and Koszul Young flattenings arising in complexity theory
• Polynomial-time computation of the dimension of algebraic varieties in zero-characteristic

Cites work

• Bounds on degrees of projective schemes
• Chow polytopes and general resultants
• Finding sparse systems of parameters
• Gröbner bases and Stanley decompositions of determinantal ideals
• How to compute the Chow form of an unmixed polynomial ideal in single exponential time
• scientific article; zbMATH DE number 4101329 (Why is no real title available?)
• scientific article; zbMATH DE number 52497 (Why is no real title available?)
• scientific article; zbMATH DE number 575960 (Why is no real title available?)
• scientific article; zbMATH DE number 704831 (Why is no real title available?)
• scientific article; zbMATH DE number 806917 (Why is no real title available?)
• scientific article; zbMATH DE number 807798 (Why is no real title available?)
• scientific article; zbMATH DE number 967398 (Why is no real title available?)
• Hyperdeterminants
• Maximal minors and their leading terms
• R-SEQUENCES AND INDETERMINATES

Cited in

(4)

• Finding sparse systems of parameters
• Permanental ideals
• A general formula for the algebraic degree in semidefinite programming
• The degree complexity of smooth surfaces of codimension

This page was built for publication: Sparse systems of parameters for determinantal varieties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1384035)