activity
20192025
most citedHumanity's Last Exam

23 citations · 29 across the 9 of their papers we have counts for

collaborators
Showing 2020Show all

6 papers · 1 filter

math.GN2020

Separable Indecomposable Continuum with Exactly One Composant

Daron Anderson

Indecomposable continua with one composant are in the sense of being non-metrisable. We adapt the method of Smith to construct an example which is $\textit{…

math.GN2020★ 1 cited

Indecomposable Continuum with a Strong Non-Cut Point

Daron Anderson

We construct an indecomposable continuum with exactly one strong non-cut point. The method is an adaptation of Bellamy . We start with an -chain of indecomposable metric…

math.GN2020

The Shore Point Existence Problem is Equivalent to the Non-Block Point Existence Problem

Daron Anderson

We prove the three propositions are equivalent: Every Hausdorff continuum has two or more shore points. Every Hausdorff continuum has two or more non-block points. $(c)…

math.GN2020

Continuum Without Non-Block Points

Daron Anderson

For any composant and corresponding near-coherence class we prove the following are equivalent : (1) properly contains a dense…

math.GN2020

Shore and Non-Block Points in Hausdorff Continua

Daron Anderson

We study the shore and non-block points of non-metric continua. We reduce the problem of showing a continuum to have non-block points to that of showing an indecomposable continuum…

cs.LG2020

Lazy Online Gradient Descent is Universal on Polytopes

Daron Anderson, Douglas Leith

We prove the familiar Lazy Online Gradient Descent algorithm is universal on polytope domains. That means it gets pseudo-regret against i.i.d opponents, while simultaneously…