Different Bounds on the Different Betti Numbers of Semi-Algebraic Sets

   Abstract. A classic result in real algebraic geometry due to Oleinik—Petrovskii, Thom and Milnor, bounds the topological complexity (the sum of the Betti numbers) of basic semi-algebraic sets. This bound is tight as one can construct examples having that many connected components. However, till now no significantly better bounds were known on the individual higher Betti numbers. We prove better bounds on the individual Betti numbers of basic semi-algebraic sets, as well as arrangements of algebraic hypersurfaces. As a corollary we obtain a polynomial bound on the highest Betti numbers of basic semi-algebraic sets defined by quadratic inequalities.     

Different Bounds on the Different Betti Numbers of Semi-Algebraic Sets

Abstract. A classic result in real algebraic geometry due to Oleinik—Petrovskii, Thom and Milnor, bounds the topological complexity (the sum of the Betti numbers) of basic semi-algebraic sets. This bound is tight as one can construct examples having that many connected components. However, till now no significantly better bounds were known on the individual higher Betti numbers. We prove better bounds on the individual Betti numbers of basic semi-algebraic sets, as well as arrangements of algebraic hypersurfaces. As a corollary we obtain a polynomial bound on the highest Betti numbers of basic semi-algebraic sets defined by quadratic inequalities.     

Betti Numbers of Semialgebraic and Sub-Pfaffian Sets

Let X be a subset in [–1,1]^n₀R^n₀ defined by the formula X={x₀|Q₁x₁Q₂x₂...Qx ((x₀,x₁,...x)X)}, where Q_i{ }, Q_i Q_i+1, x_i [–1, 1]^n_i, and X may be eitheran open or a closed set in [–1,1]^n₀+...+n, being the differencebetween a finite CW-complex and its subcomplex. An upper boundon each Betti number of X is expressed via a sum of Betti numbersof some sets defined by quantifier-free formulae involving X. In important particular cases of semialgebraic and semi-Pfaffiansets defined by quantifier-free formulae with polynomials andPfaffian functions respectively, upper bounds on Betti numbersof X are well known. The results allow to extend the boundsto sets defined with quantifiers, in particular to sub-Pfaffiansets.     

Computing the Top Betti Numbers of Semialgebraic Sets Defined by Quadratic Inequalities in Polynomial Time

For any ℓ>0, we present an algorithm which takes as input a semi-algebraic set, S, defined by P ₁≤0,…,P _s ≤0, where each P _i ∈R[X ₁,…,X _k ] has degree≤2, and computes the top ℓ Betti numbers of S, b _k−1(S),…,b _k−ℓ (S), in polynomial time. The complexity of the algorithm, stated more precisely, is . For fixed ℓ, the complexity of the algorithm can be expressed as , which is polynomial in the input parameters s and k. To our knowledge this is the first polynomial time algorithm for computing nontrivial topological invariants of semialgebraic sets in R ^k defined by polynomial inequalities, where the number of inequalities is not fixed and the polynomials are allowed to have degree greater than one. For fixed s, we obtain, by letting ℓ=k, an algorithm for computing all the Betti numbers of S whose complexity is . An erratum to this article can be found at     

Betti Numbers of Semialgebraic Sets Defined by Quantifier-Free Formulae

Let X be a semialgebraic set in Rⁿ defined by a Boolean combination of atomic formulae of the kind h * 0 where * \in { >, \ge, = }, deg(h) < d, and the number of distinct polynomials h is k. We prove that the sum of Betti numbers of X is less than O(k²d)ⁿ.     

On the Betti Numbers of Chessboard Complexes

In this paper we study the Betti numbers of a type of simplicial complex known as a chessboard complex. We obtain a formula for their Betti numbers as a sum of terms involving partitions. This formula allows us to determine which is the first nonvanishing Betti number (aside from the 0-th Betti number). We can therefore settle certain cases of a conjecture of Björner, Lovász, Vreica, and ivaljevi in [2]. Our formula also shows that all eigenvalues of the Laplacians of the simplicial complexes are integers, and it gives a formula (involving partitions) for the multiplicities of the eigenvalues.     

A Sharper Estimate on the Betti Numbers of Sets Defined by Quadratic Inequalities

In this paper we consider the problem of bounding the Betti numbers, b _i (S), of a semi-algebraic set S⊂ℝ ^k defined by polynomial inequalities P ₁≥0,…,P _s ≥0, where P _i ∈ℝ[X ₁,…,X _k ], s<k, and deg (P _i )≤2, for 1≤i≤s. We prove that for 0≤i≤k−1,

CAD and Topology of Semi-Algebraic Sets

Although Cylindrical Algebraic Decomposition (CAD) is widely used to study the topology of semi-algebraic sets (especially algebraic curves), there are very few studies of the topological properties of the output of the CAD algorithms. In this paper three possible bad topological properties of the output of CAD algorithms are described. It is shown that these properties may not occur after a generic change of coordinates and that they may be avoided, in dimension not greater than three, with a modification of the CAD algorithm. As this modification of the CAD algorithm requires to solve some polynomial systems, it is also shown that the computation with real algebraic numbers may be advantageously replaced, in all the variants of the CAD algorithm, by solving systems of polynomial equations and inequalities.     

On Projections of Semi-Algebraic Sets Defined by Few Quadratic Inequalities

Let S⊂ℝ ^k+m be a compact semi-algebraic set defined by P ₁≥0,…,P _ℓ ≥0, where P _i ∈ℝ[X ₁,…,X _k ,Y ₁,…,Y _m ], and deg (P _i )≤2, 1≤i≤ℓ. Let π denote the standard projection from ℝ ^k+m onto ℝ ^m . We prove that for any q>0, the sum of the first q Betti numbers of π(S) is bounded by (k+m) ^{O(q ℓ)}. We also present an algorithm for computing the first q Betti numbers of π(S), whose complexity is . For fixed q and ℓ, both the bounds are polynomial in k+m. The author was supported in part by an NSF Career Award 0133597 and a Sloan Foundation Fellowship.     

曲率与Betti数

本文中，我们首先根据经典的Ricci曲率与Betti数的S．Bochner定理得到了ε－极小Riemann浸入子流形的数量曲率与Betti数的结果。然后，我们考虑了紧致连通Riemann流形中曲率与Betti数之间的关系，推广 了经典的S．Bochner定理。     

Betti Numbers of Hypergraphs

In this article, we study some algebraic properties of hypergraphs, in particular their Betti numbers. We define some different types of complete hypergraphs, which to the best of our knowledge are not previously considered in the literature. Also, in a natural way, we define a product on hypergraphs, which in a sense is dual to the join operation on simplicial complexes. For such product, we give a general formula for the Betti numbers, which specializes neatly in case of linear resolutions.     

Bounding Betti numbers of bipartite graph ideals

We prove a conjectured lower bound of Nagel and Reiner on Betti numbers of edge ideals of bipartite graphs.     

Euler数和高阶Euler数的推广

The purpose of this paper is to define the generalized Euler numbers and the generalized Euler numbers of higher order, their recursion formula and some properties were established, accordingly Euler numbers and Euler numbers of higher order were extended.     

Shifting Operations and Graded Betti Numbers

The behaviour of graded Betti numbers under exterior and symmetric algebraic shifting is studied. It is shown that the extremal Betti numbers are stable under these operations. Moreover, the possible sequences of super extremal Betti numbers for a graded ideal with given Hilbert function are characterized. Finally it is shown that over a field of characteristic 0, the graded Betti numbers of a squarefree monomial ideal are bounded by those of the corresponding squarefree lexsegment ideal.     

Curvature, Diameter and Bounded Betti Numbers

In this paper, we introduce the notion of bounded Betti numbers, and show that the bounded Betti numbers of a closed Riemannian n-manifold (M, g) with Ric (M) ≥ -(n - 1) and Diam (M) ≤ D are bounded by a number depending on D and n. We also show that there are only finitely many isometric isomorphism types of bounded cohomology groups (H*(M), || · ||∞) among closed Riemannian manifold (M, g) with K(M) ≥-1 and Diam (M) ≤ D.