How highly connected can an orbifold be?

被引：1

作者：

Lange, Christian ^{[1
]}

Radeschi, Marco ^{[2
]}

机构：

[1] Ludwig Maximilians Univ Munchen, Math Inst, Theresienstr 39, D-80333 Munich, Germany

[2] Univ Notre Dame, Dept Math, 255 Hurley, Notre Dame, IN 46556 USA

来源：

REVISTA MATEMATICA IBEROAMERICANA | 2023年 / 39卷 / 06期

关键词：

Orbifolds; highly connected; RIEMANNIAN FOLIATIONS;

D O I：

10.4171/RMI/1375

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

On the one hand, we provide the first examples of arbitrarily highly connected (compact) bad orbifolds. On the other hand, we show that n-connected n-orbifolds are manifolds. The latter improves the best previously known bound of Lytchak by roughly a factor of 2. For compact orbifolds and in most dimensions, we prove slightly better bounds. We obtain sharp results up to dimension 5.

引用

页码：2171 / 2186

页数：16

共 50 条

[31] How connected is the intuitionistic continuum?
van Dalen, D
JOURNAL OF SYMBOLIC LOGIC, 1997, 62 (04) : 1147 - 1150
[32] How to get (and stay) connected
Romig, AD
ADVANCED MATERIALS & PROCESSES, 1998, 154 (04): : 3 - 3
[33] GenBank and PubMed: How connected are they?
Miller H.
Norton C.N.
Sarkar I.N.
BMC Research Notes, 2 (1)
[34] CANCER AND MIND - HOW ARE THEY CONNECTED
HOLDEN, C
SCIENCE, 1978, 200 (4348) : 1363 - &
[35] "Headache and epilepsy" - How are they connected?
Papetti, Laura
Nicita, Francesco
Parisi, Pasquale
Spalice, Alberto
Villa, Maria Pia
Trenite, D. G. A. Kasteleijn-Nolst
EPILEPSY & BEHAVIOR, 2013, 26 (03) : 386 - 393
[36] How many crashes can connected vehicle and automated vehicle technologies prevent: A meta-analysis
Wang, Ling
Zhong, Hao
Ma, Wanjing
Abdel-Aty, Mohamed
Park, Juneyoung
ACCIDENT ANALYSIS AND PREVENTION, 2020, 136
[37] Getting connected: How nurses can support mother/infant attachment in the neonatal intensive care unit
Kervell, Hayley
Grant, Julian
AUSTRALIAN JOURNAL OF ADVANCED NURSING, 2010, 27 (03) : 75 - 82
[38] Human-connected wild lands: How network analysis can inform invasive species management
Schwoerer, Tobias
Schmidt, Jennifer I.
Davis, Tammy J.
Martin, Aaron E.
BIOLOGICAL CONSERVATION, 2024, 299
[39] Partitioning a Graph into Highly Connected Subgraphs
Borozan, Valentin
Ferrara, Michael
Fujita, Shinya
Furuya, Michitaka
Manoussakis, Yannis
Narayanan, N.
Stolee, Derrick
JOURNAL OF GRAPH THEORY, 2016, 82 (03) : 322 - 333
[40] Random lifts of graphs are highly connected
Witkowski, Marcin
ELECTRONIC JOURNAL OF COMBINATORICS, 2013, 20 (02):

← 1 2 3 4 5 →