Past Analytic Topology in Mathematics and Computer Science

E.g., 2019-08-18
E.g., 2019-08-18
E.g., 2019-08-18
6 March 2019
16:00
Abstract

It is known that every continuum X is a weakly confluent image of a continuum Y which is hereditarily indecomposable and of covering dimension one.  We use the ultracoproduct construction to gain information about the number of composants of Y.  For example, in ZFC, we can ensure that this number is arbitrarily large.  And if we assume the GCH, we can arrange for Y to have as many composants at it has points.

  • Analytic Topology in Mathematics and Computer Science
20 February 2019
16:00
Chris Good
Abstract

Abstract:   Let $f$ be a continuous surjection from the compact metric space $X$ to itself. 

 

We say that the dynamical system $(X,f)$ has shadowing if for every $\epsilon>0$ there is a $\delta>0$ such that every $\delta$-pseudo orbit is $\epsilon$-shadowed.  Here a sequence $(x_n)$ is a $\delta$-pseudo orbit provided the distance from $f(x_n)$ to $x_{n+1}$ is less than $\delta$ and $(x_n)$ is $\epsilon$-shadowed if there is a point $z$ such that the distance from $x_n$ to $f^n(z)$ is less than $\epsilon$.  

 

If $f$ is a homeomorphism, $(X,f)$ is said to be expansive if there is some $c>0$, such that if the distance from $f^n(x)$ and $f^n(y)$ is less than $c$ for all $n\in \mathbb Z$, then $x=y$.

 

In his proof that a homeomorphism that is expansive and has shadowing is stable, Walters shows that in an expansive system with shadowing, a pseudo orbit is shadowed by exactly one point.  It turns out that the converse is also true: if the system has unique shadowing (in the above sense), then it is expansive.

 

In this talk, which is joint work with Joel Mitchell and Joe Thomas, we explore this notion of unique shadowing.

  • Analytic Topology in Mathematics and Computer Science
16 January 2019
16:00
Natasha Dobrinen
Abstract

Abstract:  It is a central question in the theory of infinite relational structures as to which structures carry analogues of Ramsey’s Theorem.  This question, of interest for several decades, has gained recent momentum as it was brought into focus by Kechris, Pestov, and Todorcevic, when they proved a deep correspondence between Ramsey theory and topological dynamics.  

 

In this talk, we provide background on the Ramsey theory of the Rado graph, solved by Sauer.  A longstanding open question was whether Henson graphs, the k-clique-free analogues of the Rado graph, have similar features.  We present the speaker’s recent work solving the Ramsey theory of the Henson graphs.  The techniques developed open new lines of investigation for other relational structures with forbidden configurations.  As a byproduct of these methods, we may obtain Ramsey properties for Borel colorings on copies of the Rado graph, with respect to a certain topology.

  • Analytic Topology in Mathematics and Computer Science
16 January 2019
16:00
Natasha Dobrinen
Abstract

Abstract:  It is a central question in the theory of infinite relational structures as to which structures carry analogues of Ramsey’s Theorem.  This question, of interest for several decades, has gained recent momentum as it was brought into focus by Kechris, Pestov, and Todorcevic, when they proved a deep correspondence between Ramsey theory and topological dynamics.  

 

In this talk, we provide background on the Ramsey theory of the Rado graph, solved by Sauer.  A longstanding open question was whether Henson graphs, the k-clique-free analogues of the Rado graph, have similar features.  We present the speaker’s recent work solving the Ramsey theory of the Henson graphs.  The techniques developed open new lines of investigation for other relational structures with forbidden configurations.  As a byproduct of these methods, we may obtain Ramsey properties for Borel colorings on copies of the Rado graph, with respect to a certain topology.

  • Analytic Topology in Mathematics and Computer Science
13 June 2018
16:00
Ittay Weiss
Abstract

Every topological space is metrisable once the symmetry axiom is abandoned and the codomain of the metric is allowed to take values in a suitable structure tailored to fit the topology (and every completely regular space is similarly metrisable while retaining symmetry). This result was popularised in 1988 by Kopperman, who used value semigroups as the codomain for the metric, and restated in 1997 by Flagg, using value quantales. In categorical terms, each of these constructions extends to an equivalence of categories between the category Top and a category of all L-valued metric spaces (where L ranges over either value semigroups or value quantales) and the classical \epsilon-\delta notion of continuous mappings. Thus, there are (at least) two metric formalisms for topology, raising the questions: 1) is any of the two actually useful for doing topology? and 2) are the two formalisms equally powerful for the purposes of topology? After reviewing Flagg's machinery I will attempt to answer the former affirmatively and the latter negatively. In more detail, the two approaches are equipotent when it comes to point-to-point topological consideration, but only Flagg's formalism captures 'higher order' topological aspects correctly, however at a price; there is no notion of product of value quantales. En route to establishing Flagg's formalism as convenient, it will be shown that both fine and coarse variants of homology and homotopy arise as left and right Kan extensions of genuinely metrically constructed functors, and a topologically relevant notion of tensor product of value quantales, a surrogate for the non-existent products, will be described. 


 

  • Analytic Topology in Mathematics and Computer Science
6 June 2018
16:00
Jorge Bruno
Abstract

Nash-Williams showed that the collection of locally finite trees under the topological minor relation results in a BQO. Naturally, two interesting questions arise:

1.      What is the number \lambda of topological types of locally finite trees?

2.       What are the possible sizes of an equivalence class of locally finite trees?

 For (1), clearly, \omega_0 \leq \lambda \leq c and Matthiesen refined it to \omega_1 \leq \lambda \leq c. Thus, this question becomes non-trivial in the absence of the Continuum Hypothesis. In this paper we address both questions by showing - entirely within ZFC - that for a large collection of locally finite trees that includes those with countably many rays:

- \lambda = \omega_1, and

- the size of an equivalence class can only be either 1 or c.

  • Analytic Topology in Mathematics and Computer Science

Pages