Betti numbers of random hypersurface arrangements
نویسندگان
چکیده
We study the expected behavior of Betti numbers arrangements zeros random (distributed according to Kostlan distribution) polynomials in R P n $\mathbb {R}\mathrm{P}^n$ . Using a spectral sequence, we prove an asymptotically exact estimate on number connected components complement s $s$ such hypersurfaces also investigate same problem case where are defined by quadratic polynomials. In this case, establish connection between with certain model randomly geometric graph. While our general result implies that average zeroth union hypersurface is bounded from above function grows linearly arrangement, using graphs, show upper bound quadrics sublinear arrangement. This consequence graph which could be independent interest.
منابع مشابه
L–betti Numbers of Hypersurface Complements
In [DJL07] it was shown that if A is an affine hyperplane arrangement in Cn, then at most one of the L2–Betti numbers b i (C n \ A, id) is non–zero. In this note we prove an analogous statement for complements of complex affine hypersurfaces in general position at infinity. Furthermore, we recast and extend to this higher-dimensional setting results of [FLM09, LM06] about L2–Betti numbers of pl...
متن کاملBetti numbers of random manifolds
We study mathematical expectations of Betti numbers of configuration spaces of planar linkages, viewing the lengths of the bars of the linkage as random variables. Our main result gives an explicit asymptotic formulae for these mathematical expectations for two distinct probability measures describing the statistics of the length vectors when the number of links tends to infinity. In the proof ...
متن کاملComputing the Betti Numbers of Arrangements in Practice
We describe an algorithm for computing the zero-th and the first Betti numbers of the union of n simply connected compact semi-algebraic sets in R, where each such set is defined by a constant number of polynomials of constant degrees. The complexity of the algorithm is O(n). We also describe an implementation of this algorithm in the particular case of arrangements of ellipsoids in R and descr...
متن کاملPersistent Betti numbers of random Čech complexes
We study the persistent homology of random Čech complexes. Generalizing a method of Penrose for studying random geometric graphs, we first describe an appropriate theoretical framework in which we can state and address our main questions. Then we define the kth persistent Betti number of a random Čech complex and determine its asymptotic order in the subcritical regime. This extends a result of...
متن کاملRandom Complexes and l 2 - Betti Numbers
Uniform spanning trees on finite graphs and their analogues on infinite graphs are a well-studied area. On a Cayley graph of a group, we show that they are related to the first l-Betti number of the group. Our main aim, however, is to present the basic elements of a higher-dimensional analogue on finite and infinite CW-complexes, which relate to the higher l-Betti numbers. One consequence is a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the London Mathematical Society
سال: 2022
ISSN: ['1469-7750', '0024-6107']
DOI: https://doi.org/10.1112/jlms.12658