Related papers: Maximal twisted Betti numbers of complex hyperplan…
We investigate the problem of finding the local analogue of the ergotropy, that is the maximum work that can be extracted from a system if we can only apply local unitary transformation acting on a given subsystem. In particular, we provide…
We obtain strong upper bounds for the Betti numbers of compact complex-hyperbolic manifolds. We use the unitary holonomy to improve the results given by the most direct application of the techniques of [DS17]. We also provide effective…
We show that there exists a saturated graded ideal in a standard graded polynomial ring which has the largest total Betti numbers among all saturated graded ideals for a fixed Hilbert polynomial.
We study the extremal Betti numbers of the class of $t$--spread strongly stable ideals. More precisely, we determine the maximal number of admissible extremal Betti numbers for such ideals, and thereby we generalize the known results for…
In this paper we prove that maximal H-monotone operators $T:H^n\rightrightarrows V_1$ whose domain is all the Heisenberg group $H^n$ are locally bounded. This implies that they are upper semicontinuous. As a consequence, maximal…
We determine which simplicial complexes have the maximum or minimum sum of Betti numbers and sum of bigraded Betti numbers with a given number of vertices in each dimension.
The Upper Bound Theorem for convex polytopes implies that the $p$-th Betti number of the \v{C}ech complex of any set of $N$ points in $\mathbb R^d$ and any radius satisfies $\beta_{p} = O(N^{m})$, with $m = \min \{ p+1, \lceil d/2 \rceil…
Let X be a k-dimensional simplicial complex such that the (k-j-2)-dimensional homology of the links of all j-dimensional simplices in X vanishes. An upper bound is given on the (k-1)-th Betti number of X. Examples based on sum complexes…
We study the problem of maximizing Betti numbers of simplicial complexes. We prove an upper bound of 1.32^n for the sum of Betti numbers of any n-vertex flag complex and 1.25^n for the independence complex of a triangle-free graph. These…
We describe an algorithm for finding sharp upper bounds for the total Betti numbers of a saturated ideal given certain constraints on its Hilbert function. This algorithm is implemented in the Macaulay2 package, MaxBettiNumbers, along with…
Answering questions of Y. Rabinovich, we prove "stability" versions of upper bounds on maximal independent set counts in graphs under various restrictions. Roughly these say that being close to the maximum implies existence of a large…
We prove estimates for the Betti numbers of constructible sheaves in characteristic p>0 depending only on their rank, stratification and wild ramification. In particular, given a smooth proper variety of dimension n over an algebraically…
Given a convex set and an interior point close to the boundary, we prove the existence of a supporting hyperplane whose distance to the point is controlled, in a dimensionally quantified way, by the thickness of the convex set in the…
Bishnoi conjectured that if a minimal t-fold blocking set in a projective plane of prime power order has maximal size then it is either a projective plane minus one point, the complement of a Baer subplane or a unital. In this note we prove…
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…
We classify one-element extensions of a hyperplane arrangement by the induced adjoint arrangement. Based on the classification, several kinds of combinatorial invariants including Whitney polynomials, characteristic polynomials, Whitney…
We prove that the projective complex algebraic varieties admitting a large complex local system satisfy a strong version of the Green-Griffiths-Lang conjecture.
M. Saito recently proved that the jumping numbers of a hyperplane arrangement depend only on the combinatorics of the arrangement. However, a formula in terms of the combinatorial data was still missing. In this note, we give a formula and…
We consider the multiparameter random simplicial complex on a vertex set $\{ 1,\dots,n \}$, which is parameterized by multiple connectivity probabilities. Our key results concern the topology of this complex of dimensions higher than the…
Refinements of the worst case complexity over instances of fixed input size consider the input order or the input structure, but rarely both at the same time. Barbay et al. [2016] described ``synergistic'' solutions on multisets, which take…