Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Bounding the equivariant Betti numbers of symmetric semi-algebraic sets (1312.6582v6)

Published 23 Dec 2013 in math.AG, cs.CC, and math.AT

Abstract: Let $\mathrm{R}$ be a real closed field. The problem of obtaining tight bounds on the Betti numbers of semi-algebraic subsets of $\mathrm{R}k$ in terms of the number and degrees of the defining polynomials has been an important problem in real algebraic geometry with the first results due to Ole{\u\i}nik and Petrovski{\u\i}, Thom and Milnor. These bounds are all exponential in the number of variables $k$. Motivated by several applications in real algebraic geometry, as well as in theoretical computer science, where such bounds have found applications, we consider in this paper the problem of bounding the equivariant Betti numbers of symmetric algebraic and semi-algebraic subsets of $\mathrm{R}k$. We obtain several asymptotically tight upper bounds. In particular, we prove that if $S\subset \mathrm{R}k$ is a semi-algebraic subset defined by a finite set of $s$ symmetric polynomials of degree at most $d$, then the sum of the $\mathfrak{S}_k$-equivariant Betti numbers of $S$ with coefficients in $\mathbb{Q}$ is bounded by $(skd){O(d)}$. Unlike the classical bounds on the ordinary Betti numbers of real algebraic varieties and semi-algebraic sets, the above bound is polynomial in $k$ when the degrees of the defining polynomials are bounded by a constant. As an application we improve the best known bound on the ordinary Betti numbers of the projection of a compact algebraic set improving for any fixed degree the best previously known bound for this problem due to Gabrielov, Vorobjov and Zell.

Citations (14)

Summary

We haven't generated a summary for this paper yet.