Related papers: Betti numbers of complexes with highly Connected l…
In a paper by Lin an interesting family of semipermutations comes out to index the elements of a cohomology basis of a Hessenberg type variety. The corresponding Betti numbers are a generalization of Eulerian numbers. We show three…
Clique complexes of Erd\H{o}s-R\'{e}nyi random graphs with edge probability between $n^{-{1\over 3}}$ and $n^{-{1\over 2}}$ are shown to be aas not simply connected. This entails showing that a connected two dimensional simplicial complex…
In this article, we investigate high moments of zeta sums $\sum_{n\le x}n^{i t}$. We show unconditional lower bounds for them.
The second Betti number of a smooth, closed, connected and simply connected, four-dimensional spin manifold is greater or equal 11/8 times the abolute value of its signature.
Let $K$ be a finite simplicial complex. We prove that the normalized expected Betti numbers of a random subcomplex in its $d$-th barycentric subdivision $\text{Sd}^d (K)$ converge to universal limits as $d$ grows to $+ \infty$. In…
We prove upper bounds on the face numbers of simplicial complexes in terms on their girths, in analogy with the Moore bound from graph theory. Our definition of girth generalizes the usual definition for graphs.
Linear upper bounds are provided for the size of the torsion homology of negatively curved manifolds of finite volume in all dimensions $d\ne 3$. This extends a classical theorem by Gromov. In dimension $3$, as opposed to the Betti numbers,…
Let M be an irreducible compact hyperk\"ahler manifold of complex dimension six. Under an assumption on the Looijenga-Lunts-Verbitsky decomposition of the cohomology of M, we prove that the second Betti number of M is at most 23.
In this short note we show that every connected reductive simply-connected algebraic group of rank $>1$ over the complex numbers has infinitely many pairs of irreducible representations which are not related by an automorphism of the…
A bound for Betti numbers of sets definable in o-minimal structures is presented. An axiomatic complexity measure is defined, allowing various concrete complexity measures for definable functions to be covered. This includes common concrete…
We present a method for deciding when a regular abelian cover of a finite CW-complex has finite Betti numbers. To start with, we describe a natural parameter space for all regular covers of a finite CW-complex X, with group of deck…
We announce new results concerning the asymptotic behavior of the Betti numbers of higher rank locally symmetric spaces as their volumes tend to infinity. Our main theorem is a uniform version of the L\"uck Approximation Theorem…
Relative self-linking and linking "numbers" for pairs of knots in oriented 3-manifolds are defined in terms of intersection invariants of immersed surfaces in 4-manifolds. The resulting concordance invariants generalize the usual…
Let $L_f$ be a link of an isolated hypersurface singularity defined by a weighted homogenous polynomial $f.$ In this article, we give ten examples of $2$-connected seven dimensional Sasaki-Einstein manifolds $L_f$ for which $H_{3}(L_f,…
We use Boij-S\"oderberg theory to provide some order of magnitude bounds on algebraic Betti numbers.
The classical results, initiated by Castelnuovo and Fano and later refined by Eisenbud and Harris, provide several upper bounds on the number of quadrics defining a nondegenerate projective variety. Recently, it has been revealed that these…
For geometries with a closed three-form we briefly overview the notion of multi-moment maps. We then give concrete examples of multi-moment maps for homogeneous hypercomplex and nearly Kaehler manifolds. A special role in the theory is…
We show that if a group G is finitely presented and nilpotent-by-abelian-by-finite, then there is an upper bound on the first betti number of M as M runs through all subgroups of finite index in G.
In a seminal paper, Erdos and Renyi identified the threshold for connectivity of the random graph G(n,p). In particular, they showed that if p >> log(n)/n then G(n,p) is almost always connected, and if p << log(n)/n then G(n,p) is almost…
For a graph $G$ on $[n]$, the $k$-cut complex $\Delta_k(G)$ has facets $[n]\setminus T$, where $T$ ranges over the disconnected $k$-vertex induced subgraphs of $G$. Bayer, Denker, Jeli\'c Milutinovi\'c, Sundaram, and Xue proved that the…