We study the expected behavior of the Betti numbers of arrangements of the zeros of random (distributed according to the Kostlan distribution) polynomials in $mathbb{R}mathrm{P}^n$. Using a random spectral sequence, we prove an asymptotically exact e
stimate on the expected number of connected components in the complement of $s$ such hypersurfaces in $mathbb{R}mathrm{P}^n$. We also investigate the same problem in the case where the hypersurfaces are defined by random quadratic polynomials. In this case, we establish a connection between the Betti numbers of such arrangements with the expected behavior of a certain model of a randomly defined geometric graph. While our general result implies that the average zeroth Betti number of the union of random hypersurface arrangements is bounded from above by a function that grows linearly in the number of polynomials in the arrangement, using the connection with random graphs, we show an upper bound on the expected zeroth Betti number of random quadrics arrangements that is sublinear in the number of polynomials in the arrangement. This bound is a consequence of a general result on the expected number of connected components in our random graph model which could be of independent interest.
Recently Brosnan and Chow have proven a conjecture of Shareshian and Wachs describing a representation of the symmetric group on the cohomology of regular semisimple Hessenberg varieties for $GL_n(mathbb{C})$. A key component of their argument is tha
t the Betti numbers of regular Hessenberg varieties for $GL_n(mathbb{C})$ are palindromic. In this paper, we extend this result to all reductive algebraic groups, proving that the Betti numbers of regular Hessenberg varieties are palindromic.
In this PhD thesis we propose an algorithmic approach to the study of the Hilbert scheme. Developing algorithmic methods, we also obtain general results about Hilbert schemes. In Chapter 1 we discuss the equations defining the Hilbert scheme as subsc
heme of a suitable Grassmannian and in Chapter 5 we determine a new set of equations of degree lower than the degree of equations known so far. In Chapter 2 we study the most important objects used to project algorithmic techniques, namely Borel-fixed ideals. We determine an algorithm computing all the saturated Borel-fixed ideals with Hilbert polynomial assigned and we investigate their combinatorial properties. In Chapter 3 we show a new type of flat deformations of Borel-fixed ideals which lead us to give a new proof of the connectedness of the Hilbert scheme. In Chapter 4 we construct families of ideals that generalize the notion of family of ideals sharing the same initial ideal with respect to a fixed term ordering. Some of these families correspond to open subsets of the Hilbert scheme and can be used to a local study of the Hilbert scheme. In Chapter 6 we deal with the problem of the connectedness of the Hilbert scheme of locally Cohen-Macaulay curves in the projective 3-space. We show that one of the Hilbert scheme considered a good candidate to be non-connected, is instead connected. Moreover there are three appendices that present and explain how to use the implementations of the algorithms proposed.
We extend a result of Guan by showing that the second Betti number of a 4-dimensional primitively symplectic orbifold is at most 23 and there are at most 91 singular points. The maximal possibility 23 can only occur in the smooth case. In addition to
the known smooth examples with second Betti numbers 7 and 23, we provide examples of such orbifolds with second Betti numbers 3, 5, 6, 8, 9, 10, 11, 14 and 16. In an appendix, we extend Salamons relation among Betti/Hodge numbers of symplectic manifolds to symplectic orbifolds.
We present an algorithm for explicitly computing the number of generators of the stable cohomology algebra of any rationally smooth partial toroidal compactification of ${mathcal A}_g$, satisfying certain additivity and finiteness properties, in term
s of the combinatorics of the corresponding toric fans. In particular the algorithm determines the stable cohomology of the matroidal partial compactification, in terms of simple regular matroids that are irreducible with respect to the 1-sum operation, and their automorphism groups. The algorithm also applies to compute the stable Betti numbers in close to top degree for the perfect cone toroidal compactification. This suggests the existence of an algebra structure on the stable cohomology of the perfect cone compactification in close to top degree.