Abstract: If X is a set then (X choose a) is all a-subsets of X.
By Ramsey's theorem if you finitely color (N choose a) then there will be an infinite homog set H (that is, a set H such that the coloring on (H choose a) is constant-- just ONE color).
Let L be an ordering (for this talk Z or omega^2). What if you color (L choose a) and want, a homog set OF THE SAME ORDER TYPE AS L. We call that L-homog.
Alas- that almost never happens. You can color (Z choose 2) and have NO Z-homog set. However, for every finite coloring of (Z choose 2) there IS what we call a 4-Z-homog set- Only FOUR colors. More generally, for every finite coloring of (Z choose a) there is a 2^a-Z-homog set. And this is tight.
We will prove results about coloring (L choose a) for a variety of linear orders L and a\in N.
This work is joint with Joanna Boyland, Nathan Hurtig, Robert Rust.
Abstract: We will discuss how to define coarse properness of general topological groups on locally compact spaces and show how the existence of cocompact such actions provide a characterisation of bounded geometry of the group. We will also show how this may equivalently be defined for actions on commutative C*-algebras and discuss problems arising in the non-commutative case.
Abstract: We will present a number of problems and results in computable model theory, where we apply ideas, notions, and methods from computability theory to study algorithmic phenomena in countable algebraic structures. We will address complexity of structures, of their isomorphisms, and of additional relations on structures. Classically isomorphic structures can have very different computability-theoretic properties. When a complexity bound for some property of a structure is preserved under isomorphisms, we call the bound intrinsic. Often, we can describe complexity of an aspect of a structure syntactically – typically using computable infinitary formulas, or measure it semantically – typically using Turing degrees. This connection between definability and computability has been one of the main themes in computable model theory.
Abstract: The Laver tables are finite left self-distributive algebras on one generator which were first studied by Laver in the course of analyzing rank-to-rank elementary embeddings. Finite rooted ordered binary trees naturally define elements in these tables. I will show that, for each 0 < p < 1, measure 1 sets of (typically infinite) rooted ordered binary trees can also be evaluated in the Laver tables. This ad hoc result connecting two disparate subjects arose from the following consideration: If Thompson's group F were amenable, what mechanism is responsible for its amenability?
Abstract: After giving an overview of the basic properties of definable sets in continuous logic, we will give a largely visual proof that any finite upper semilattice is the partial order of definable sets in some superstable continuous first-order theory.
Abstract: I will describe some novel approaches to investigating the combinatorial topology of surfaces through model theoretic means. The main object of interest is the curve graph of a surface, which encodes the homotopy classes of essential embedded loops on the surface, and its automorphism group, which coincides with the extended mapping class group of the surface. I will give a model theoretic perspective on how a myriad of objects that are naturally associated to a surface are interpretable inside of the curve graph, and how this makes precise a certain metaconjecture due to Ivanov. I will also discuss some of the properties of the theory of the curve graph, including stability and quantifier elimination. This talk represents joint work with V. Disarlo and J. de la Nuez Gonzalez.
Abstract: In this talk, I will define what it means for a coloring of substructures of an ultraproduct structure to be ``internal’’, and a notion of finite big Ramsey degree for internal colorings. I will also present a certain Ramsey degree transfer theorem from countable sequences of finite structures to their ultraproducts, assuming AC and some additional mild assumptions. The big Ramsey degree of a finite structure in an ultraproduct can differ markedly from its internal big Ramsey degree, as demonstrated by the example of the class of all finite linear orders, which I will explain.
This is joint work with Dana Bartošová, Mirna Džamonja and Rehana Patel.
Abstract: A theory T is called binary if any two tuples have the same type if and only if all corresponding subtuples of length 2 have the same type. With this strong restriction on theories, it turns out that certain classification-theoretic dividing lines collapse: for example, we show that a binary NSOP_1 theory is simple, and a binary NSOP_3 theory is NTP_1. Motivated by these results, we develop the basics of neostability theory for the broader category of treeless theories. We show such theories come equipped with a natural notion of independence, defined in terms of generically stable partial types, which is meaningful in both simple and NIP theories. This is joint work with Itay Kaplan and Pierre Simon.
Abstract: In this talk, I will discuss various notions of indivisibility for (relational) structures. A structure is indivisible if, when you color the elements of the universe with finitely many colors, you can find a monochromatic copy of the structure. I will examine which structures have various levels of indivisibility and which do not, as well as general mechanisms for exhibiting indivisibility and non-indivisibility. Some of the work presented is joint with Miriam Parnes and Lynn Scow.
Abstract: In a series of lectures at Princeton University between 1935 and 1937, John von Neumann developed a continuous version of projective geometry: the central objects of this study, continuous geometries, are complete, complemented, modular lattices whose algebraic operations possess certain natural continuity properties. Beyond classical finite-dimensional projective geometries, the class of continuous geometries contains, for instance, every orthocomplemented complete modular lattice (e.g., the projection lattice of any finite von Neumann algebra).
In the course of his analysis, von Neumann established the following remarkable coordinatization theorem: every complemented modular lattice (with an order at least four) is isomorphic to the lattice of principal left ideals of some (up to isomorphism unique) regular ring. Furthermore, he proved that every irreducible continuous geometry possesses a unique dimension function (with values in the closed real unit interval), which then induces a compatible complete metric on the corresponding coordinatizing ring and thus furnishes the latter with a natural topology. The topological groups of units of such ”continuous rings” exhibit very peculiar dynamical behavior.
In the talk, I will give a brief overview of von Neumann’s continuous geometry and report on some recent progress in understanding the structure and dynamics of topological groups of units of continuous rings.
4176 Campus Drive - William E. Kirwan Hall
College Park, MD 20742-4015
P: 301.405.5047 | F: 301.314.0827