All Seminars & Colloquia
The theory of fields is complete for isomorphisms
The theory of fields is complete for isomorphisms
Friday, 1/24/2014, 9:00pm - 11:59pm
Abstract: We give a highly effective coding of countable graphs into countable fields. For each countable graph G, we build a countable field F(G), uniformly effectively from an arbitrary presentation of G. There is a uniform effective method of recovering the graph G from the field F(G). Moreover, each isomorphism g from G onto any G' may be turned into an isomorphism F(g) from F(G) onto F(G'), again by a uniform effective method so that F(g) is computable from g.
Towards topological applications of Laver tables
Victoria Lebed, Advanced Mathematical Institute, Osaka City University, Japan
Tuesday, 1/21/2014, 10:00pm - 11:59pm
Abstract: Laver tables are certain finite shelves (i.e., sets endowed with a binary operation which is distributive with respect to itself). They originate from set theory and have a profound combinatorial structure. In this talk I will discuss our dreams regarding potential braid and knot invariant constructions using Laver tables, and also present some real results in this direction, such as a detailed description of 2- and 3-cocycles for Laver tables. The rich structure of the latter promises interesting topological applications.
(Joint work with Patrick Dehornoy)
Towards topological applications of Laver tables
Speaker: Victoria Lebed (Advanced Mathematical Institute, Osaka City University,Japan)
Tuesday, 1/21/2014, 10:00pm - 11:59pm
(The talk will be introduced by Valentina Harizanov description of
Richard Laver (1942-2012) work in logic.)
Towards topological applications of Laver tables
Tuesday, 1/21/2014, 10:00pm - 11:59pm
Speaker: Victoria Lebed (Advanced Mathematical Institute, Osaka City University,Japan)
Title: Towards topological applications of Laver tables
Sunday, 1/19/2014, 1:00pm - Monday, 1/20/2014, 11:59pm
Organizers
Mieczyslaw K. Dabkowski (UT Dallas), Valentina Harizanov (GWU), Jozef H. Przytycki (GWU and UMCP), Yongwu Rong (GWU), Radmila Sazdanovic (NCSU), Alexander Shumakovitch (GWU), Hao Wu (GWU)
View Abstracts
Conference Homepage
Abstracts
A filtration on HOMFLY-PT homology via virtual crossings
by
Michael Abel
University of North Carolina, Chapel Hill
Coauthors: Lev Rozansky
Wednesday, 1/15/2014, 9:46pm - Saturday, 1/18/2014, 11:59pm
2014 Joint Math Meetings, Baltimore Convention Center: January 15–18, 2014
http://jointmathematicsmeetings.org/meetings/national/jmm2014/2160_intro
AMS-ASL Special Session on Logic and Probability
AMS Special Session on Computability in Geometry and Topology
Association for Symbolic Logic Winter Meeting: January 17–18, 2014
Tuesday, 1/14/2014, 6:00pm - 11:59pm
Speaker: Robin Koytcheff (University of Victoria)
A colored operad for string link infection
Tuesday, 1/14/2014, 6:00pm - 11:59pm
Speaker: Robin Koytcheff (University of Victoria)
Coauthors: John Burke
Title: A colored operad for string link infection
The open problem regarding the automorphisms of L*(Q_inf)
Rumen Dimitrov, Western Illinois University
Tuesday, 12/17/2013, 8:45pm - 11:59pm
Abstract: Guichard proved in 1984 that there are countably many automorphisms of the lattice L(Q_inf) of computably enumerable subspaces of Q_inf by proving that the automorphisms are generated by computable semilinear transformations. The question about the number of automorphisms of the factor-lattice L*(Q_inf) is still open. We will discuss Ash’s conjecture regarding this question and how some of our recent results corroborate this conjecture.