We use Heegaard Floer homology to define an invariant of homology cobordism. This invariant is isomorphic to a summand of the reduced Heegaard Floer homology of a rational homology sphere equipped with a spin structure and is analogous to Stoffregen’s connected Seiberg–Witten Floer homology. We use this invariant to study the structure of the homology cobordism group and, along the way, compute the involutive correction terms $$\bar{d}$$ and $$\text{}\underline{d}$$ for certain families of three-manifolds.
more »
« less
This content will become publicly available on December 1, 2025
Curvature operators and rational cobordism
We determine linear inequalities on the eigenvalues of curvature operators that imply vanishing of the twisted A-hat genus on a closed Riemannian spin manifold, where the twisting bundle is any prescribed parallel bundle of tensors. These inequalities yield surgery-stable curvature conditions tailored to annihilate further rational cobordism invariants, such as the Witten genus, elliptic genus, signature, and even the rational cobordism class itself.
more »
« less
- PAR ID:
- 10561782
- Publisher / Repository:
- Elsevier
- Date Published:
- Journal Name:
- Advances in Mathematics
- Volume:
- 458
- Issue:
- PB
- ISSN:
- 0001-8708
- Page Range / eLocation ID:
- 109995
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract A group is said to have rational growth with respect to a generating set if the growth series is a rational function. It was shown by Parry that certain torus bundle groups of even trace exhibits rational growth. We generalize this result to a class of torus bundle groups with odd trace.more » « less
-
Abstract We consider manifold-knot pairs$$(Y,K)$$, whereYis a homology 3-sphere that bounds a homology 4-ball. We show that the minimum genus of a PL surface$$\Sigma $$in a homology ballX, such that$$\partial (X, \Sigma ) = (Y, K)$$can be arbitrarily large. Equivalently, the minimum genus of a surface cobordism in a homology cobordism from$$(Y, K)$$to any knot in$$S^3$$can be arbitrarily large. The proof relies on Heegaard Floer homology.more » « less
-
Abstract This paper extends the Bakry-Émery criterion relating the Ricci curvature and logarithmic Sobolev inequalities to the noncommutative setting. We obtain easily computable complete modified logarithmic Sobolev inequalities of graph Laplacians and Lindblad operators of the corresponding graph Hörmander systems. We develop the anti-transference principle stating that the matrix-valued modified logarithmic Sobolev inequalities of sub-Laplacian operators on a compact Lie group are equivalent to such inequalities of a family of the transferred Lindblad operators with a uniform lower bound.more » « less
-
A graph profile records all possible densities of a fixed finite set of graphs. Profiles can be extremely complicated; for instance the full profile of any triple of connected graphs is not known, and little is known about hypergraph profiles. We introduce the tropicalization of graph and hypergraph profiles. Tropicalization is a well-studied operation in algebraic geometry, which replaces a variety (the set of real or complex solutions to a finite set of algebraic equations) with its “combinatorial shadow”. We prove that the tropicalization of a graph profile is a closed convex cone, which still captures interesting combinatorial information. We explicitly compute these tropicalizations for arbitrary sets of complete and star hypergraphs. We show they are rational polyhedral cones even though the corresponding profiles are not even known to be semialgebraic in some of these cases. We then use tropicalization to prove strong restrictions on the power of the sums of squares method, equivalently Cauchy-Schwarz calculus, to test (which is weaker than certification) the validity of graph density inequalities. In particular, we show that sums of squares cannot test simple binomial graph density inequalities, or even their approximations. Small concrete examples of such inequalities are presented, and include the famous Blakley-Roy inequalities for paths of odd length. As a consequence, these simple inequalities cannot be written as a rational sum of squares of graph densities.more » « less
An official website of the United States government
