On projections of semi-algebraic sets defined by few quadratic inequalities

DOI10.1007/S00454-007-9014-1MaRDI QIDQ2482191zbMATH OpenOpenAlexFDO

Authors Saugata Basu, Thierry Zell

Publication date 16 April 2008

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0602398

zbMATH Keywords

Betti numbersCohomological descentQuadratic inequalitiesSemi-algebraic setsSpectral sequences

Mathematics Subject Classification ID

Semialgebraic sets and related spaces (14P10) Symbolic computation and algebraic computation (68W30)

Abstract: Let $Ssubset{R}^{k+m}$ be a compact semi-algebraic set defined by a system of $ell$ polynomial inequalities of degree at most 2. $Let$pi$denotethestandardprojectionfrom$R^{k + m}$onto$R^m$.Weprovethatforany$q >0$,thesumofthefirst$q$Bettinumbersof$pi(S)$isboundedby$(k + m)^{O(qell)}.$Wealsopresentanalgorithmforcomputingthethefirst$q$Bettinumbersof$pi(S)$,whosecomplexityis$ (k+m)^{2^{O(qell)}}.$Forfixed$q$and$ell$,boththeboundsarepolynomialin$k+m$.

Recommendations

• On projections of semi-algebraic sets defined by few quadratic inequalities
• A sharper estimate on the Betti numbers of sets defined by quadratic inequalities
• Computing the top Betti numbers of semialgebraic sets defined by quadratic inequalities in polynomial time
• On the Betti numbers of semialgebraic sets defined by few quadratic inequalities
• scientific article; zbMATH DE number 1256759

Cites work

• Algorithms in real algebraic geometry
• BETTI NUMBERS OF SEMIALGEBRAIC AND SUB-PFAFFIAN SETS
• Bundle Gerbes
• Computing the first Betti number and the connected components of semi-algebraic sets
• Computing the first few Betti numbers of semi-algebraic sets in single exponential time
• Counterexamples to quantifier elimination for fewnomial and exponential expressions
• Different bounds on the different Betti numbers of semi-algebraic sets
• Efficient algorithm for computing the Euler-Poincaré characteristic of a semi-algebraic set defined by few quadratic inequalities
• Feasibility testing for systems of real quadratic equations
• scientific article; zbMATH DE number 49991 (Why is no real title available?)
• scientific article; zbMATH DE number 54028 (Why is no real title available?)
• scientific article; zbMATH DE number 3496319 (Why is no real title available?)
• scientific article; zbMATH DE number 1341779 (Why is no real title available?)
• scientific article; zbMATH DE number 1565334 (Why is no real title available?)
• scientific article; zbMATH DE number 2103273 (Why is no real title available?)
• On bounding the Betti numbers and computing the Euler characteristic of semi-algebraic sets
• On the Betti numbers of semialgebraic sets defined by few quadratic inequalities
• On the combinatorial and algebraic complexity of quantifier elimination
• On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
• Polynomial-time computing over quadratic maps i: sampling in real algebraic sets
• Théorie de Hodge. III
• Topological hypercovers and \(\mathbb{A}^1\)-realizations
• Topology of definable Hausdorff limits

Cited in

(4)

• Spectral sequences, exact couples and persistent homology of filtrations
• scientific article; zbMATH DE number 3855356 (Why is no real title available?)
• On projections of semi-algebraic sets defined by few quadratic inequalities
• On the number of homotopy types of fibres of a definable map

This page was built for publication: On projections of semi-algebraic sets defined by few quadratic inequalities

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