scholarly journals A Dichotomy Theorem for First-Fit Chain Partitions

2020 ◽  
Vol 34 (1) ◽  
pp. 586-596
Author(s):  
Kevin G. Milans ◽  
Michael C. Wigal
Keyword(s):  
Dichotomy Theorem

The l1-Dichotomy Theorem with Respect to a Coideal

2017 ◽  
Vol 42 (1) ◽  
pp. 167
Author(s):  
Farmaki ◽  
Mitropoulos
Keyword(s):  
Dichotomy Theorem

THE BAIRE PROPERTY IN THE REMAINDERS OF SEMITOPOLOGICAL GROUPS

2013 ◽  
Vol 88 (2) ◽  
pp. 301-308 ◽  
Author(s):  
LI-HONG XIE ◽  
SHOU LIN
Keyword(s):  
Positive Answer ◽  
Baire Space ◽  
Baire Property ◽  
Topological Groups ◽  
Dichotomy Theorem ◽  
Semitopological Group

AbstractIt is proved that every remainder of a nonlocally compact semitopological group $G$ is a Baire space if and only if $G$ is not Čech-complete, which improves a dichotomy theorem of topological groups by Arhangel’skiǐ [‘The Baire property in remainders of topological groups and other results’, Comment. Math. Univ. Carolin. 50(2) (2009), 273–279], and also gives a positive answer to a question of Lin and Lin [‘About remainders in compactifications of paratopological groups’, ArXiv: 1106.3836v1 [Math. GN] 20 June 2011]. We also show that for a nonlocally compact rectifiable space $G$ every remainder of $G$ is either Baire, or meagre and Lindelöf.

Elliott-Morse measures and Kakutani's dichotomy theorem

1992 ◽  
Vol 211 (1) ◽  
pp. 247-263 ◽  
Author(s):  
Gunter Ritter ◽  
Edwin Hewitt
Keyword(s):  
Dichotomy Theorem

scholarly journals F-equicontinuity and an analogue of Auslander-Yorke dichotomy theorem

2020 ◽  
Vol 279 ◽  
pp. 107252
Author(s):  
Hyonhui Ju ◽  
Jinhyon Kim ◽  
Songhun Ri ◽  
Peter Raith
Keyword(s):  
Dichotomy Theorem

Chapter 16. Worst-Case Upper Bounds

2021 ◽  
Author(s):  
Evgeny Dantsin ◽  
Edward A. Hirsch
Keyword(s):  
Structural Complexity ◽  
Upper Bounds ◽  
Worst Case ◽  
Exponential Time ◽  
Running Time ◽  
Dichotomy Theorem ◽  
Exponential Time Hypothesis ◽  
Satisfiability Algorithms

The chapter is a survey of ideas and techniques behind satisfiability algorithms with the currently best asymptotic upper bounds on the worst-case running time. The survey also includes related structural-complexity topics such as Schaefer’s dichotomy theorem, reductions between various restricted cases of SAT, the exponential time hypothesis, etc.

Sign in / Sign up

Export Citation Format

Share Document