2019
DOI: 10.1142/s1793525320500090
|View full text |Cite
|
Sign up to set email alerts
|

Variations on the theme of the uniform boundary condition

Abstract: The uniform boundary condition in a normed chain complex asks for a uniform linear bound on fillings of null-homologous cycles. For the ℓ 1 -norm on the singular chain complex, Matsumoto and Morita established a characterisation of the uniform boundary condition in terms of bounded cohomology. In particular, spaces with amenable fundamental group satisfy the uniform boundary condition in every degree. We will give an alternative proof of statements of this type, using geometric Følner arguments on the chain le… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
16
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
5

Relationship

3
2

Authors

Journals

citations
Cited by 10 publications
(16 citation statements)
references
References 16 publications
(26 reference statements)
0
16
0
Order By: Relevance
“…Because π 1 (∂ d ) is amenable, there exists a constant K ∈ R >0 with the following property [32,51]…”
Section: Stable Filling Normsmentioning
confidence: 99%
“…Because π 1 (∂ d ) is amenable, there exists a constant K ∈ R >0 with the following property [32,51]…”
Section: Stable Filling Normsmentioning
confidence: 99%
“…Proof By the correspondence between local and twisted coefficients on the chain level (Proposition ), this is a direct consequence of the parametrised UBC for tori formulated in terms of twisted coefficients [, Theorem 1.3].…”
Section: Simplicial Volumes Of Graph Manifoldsmentioning
confidence: 99%
“…Proof We proceed as in the case with a single boundary component [, Proposition 10.3]: In order to keep the notation simple, we view M1 and M2 as subspaces of M and identify T1 and T2 via f. By the Seifert and van Kampen theorem for fundamental groupoids, the inclusions of M1 and M2 into M induce an isomorphism Gπ(M).…”
Section: Simplicial Volumes Of Graph Manifoldsmentioning
confidence: 99%
See 2 more Smart Citations