Calendar

Mar
6
Fri
ISITA talk
Mar 6 @ 1:30 pm – Mar 6 @ 2:30 pm

The ISITA 2020 conference on coding and information theory
will be held at Ko Olina on October 24-27, 2020.
     http://www.isita.ieice.org/
The organizers are meeting in Hawaii this week, and have
agreed to give two talks at UH:

   Friday, March 6, 1:30pm–2:15pm in Keller Hall 413
   Speaker: Prof. Akiko Manada
   Shonan Institute of Technology

   Monday, March 9, 1:30pm–2:15pm in Keller Hall 413
   Speaker: Prof. Takayuki Nozaki
   Department of Informatics,
   Yamaguchi University

Each talk will be followed by refreshments and a problem
session. You are cordially invited to attend.

Mar
9
Mon
ISITA talk
Mar 9 @ 1:30 pm – Mar 9 @ 2:30 pm

The ISITA 2020 conference on coding and information theory
will be held at Ko Olina on October 24-27, 2020.
     http://www.isita.ieice.org/
The organizers are meeting in Hawaii this week, and have
agreed to give two talks at UH:

   Friday, March 6, 1:30pm–2:15pm in Keller Hall 413
   Speaker: Prof. Akiko Manada
   Shonan Institute of Technology

   Monday, March 9, 1:30pm–2:15pm in Keller Hall 413
   Speaker: Prof. Takayuki Nozaki
   Department of Informatics,
   Yamaguchi University

Each talk will be followed by refreshments and a problem
session. You are cordially invited to attend.

Mar
13
Fri
Logic seminar: Jack Yoon
Mar 13 @ 2:30 pm – 3:30 pm
Apr
7
Tue
Wayne Lewis (University of Hawaiʻi) @ Lecture held in Elysium
Apr 7 @ 6:00 am – 8:00 am

Title: Adelic Theory of Protori
by Wayne Lewis (University of Hawaiʻi) as part of Topological Groups

Lecture held in Elysium.
Abstract: TBA

Apr
14
Tue
Wayne Lewis (University of Hawaiʻi) @ Lecture held in Elysium
Apr 14 @ 6:00 am – 8:00 am

Title: Classification of Finite-Dimensional Periodic LCA Groups
by Wayne Lewis (University of Hawaiʻi) as part of Topological Groups

Lecture held in Elysium.

Abstract
Generalized resolutions of protori have non-Archimedean component a periodic LCA group with finite non-Archimedean dimension. The previous session introduced the notion of non-Archimedean dimension of LCA groups. Applying published results by Dikranjan, Herfort, Hofmann, Lewis, Loth, Mader, Morris, Prodanov, Ross, and Stoyanov, we introduce new minimalist notation and accompanying definitions to clarify the structure of these groups and their Pontryagin duals, enabling a parametrization of the spectrum of resolutions of finite-dimensional protori (the Grothendieck group is a moduli space).

Apr
21
Tue
Theodore Slaman (UC Berkeley)
Apr 21 @ 4:00 am – 5:00 am

Title: Recursion Theory and Diophantine Approximation
by Theodore Slaman (UC Berkeley) as part of Computability theory and applications

Abstract
We will give a survey of some connections between Recursion Theory, especially Algorithmic Randomness, and Diophantine Approximation, especially normality and exponents of irrationality. We will emphasize what we view as the contribution of a recursion theoretic perspective.

Adolf Mader (University of Hawaiʻi) @ Lecture held in Elysium
Apr 21 @ 6:00 am – 8:00 am

Title: Pontryagin Duals of Type Subgroups of Finite Rank Torsion-Free Abelian Groups
by Adolf Mader (University of Hawaiʻi) as part of Topological Groups

Lecture held in Elysium.

Abstract
Pontryagin duals of type subgroups of finite rank torsion-free abelian groups are presented. The interplay between the intrinsic study of compact abelian groups, respectively torsion-free abelian groups, is discussed (how can researchers better leverage the published results in each setting so there is a dual impact?). A result definitively qualifying, in the torsion-free category, the uniqueness of decompositions involving maximal rank completely decomposable summands is given; the formulation of the result in the setting of protori is shown to optimally generalize a well-known result regarding the splitting of maximal tori from finite-dimensional protori.

Apr
28
Tue
Julia Knight (Notre Dame)
Apr 28 @ 2:00 am – 3:00 am

Title: Limiting Density and Free Structures
by Julia Knight (Notre Dame) as part of Computability theory and applications

Abstract
Gromov had asked what a random group looks like – in a limiting density sense. I conjectured that the elementary frst order theory of the random group on n >= 2 generators, and with a single relator matches
that of the non-Abelian free groups. Coulon, Ho, and Logan have proved that the theories match on universal sentences. We may ask Gromovs question for other varieties. Franklin and I looked for varieties for which
calculating the limiting densities is easier. We have examples for which the elementary frst order theory of the random structure matches that of the free structure, and other examples for which the theories differ.
(joint work with Johanna Franklin)