Logic seminar: Sam Birns
Oct 8 @ 2:30 pm – 3:30 pm
Colloquium- Yuriy Mileyko
Oct 12 @ 3:30 pm – 4:30 pm

Speaker: Yuriy Mileyko (UHM)
Title: Another look at recovering local homology from samples of stratified sets.

Recovering homological features of spaces from samples has become one of
the central themes in topological data analysis, which has led to many
successful applications. Most of the results in this area focus on
global homological features, whose recovery predicates on imposing well
understood geometric conditions on the underlying space. Existing work
on recovering local homological information of a space from samples has
been much less abundant, since the required local geometric conditions on
the underlying space may vary from point to point and are not easily
integrated into a global condition, unless the space is a smooth
manifold. In this talk, we show that such global conditions for
recovering local homological information can be obtained for a fairly
large class of stratified sets.

Logic seminar: David Ross
Oct 15 @ 2:30 pm – 3:30 pm

Prof. Ross will speak about Nathanson’s “Generalized Egyptian Fractions.” Usual time and place (2:30, K314).

In a paper earlier this year Mel Nathanson generalized the notion of
“Egyptian Fraction” and extended some results of Sierpinski to sets of
these generalized Egyptian fractions. I’ll give short nonstandard proofs of
further generalizations of these results.

Colloquium: Ricardo Teixeira (U. Houston-Victoria) @ Keller 301
Oct 19 @ 3:30 pm – 4:30 pm

Speaker: Ricardo Teixeira (U. Houston-Victoria)
Title: Teaching Precalculus in Hawaii

Abstract: Most students enjoy learning about applications of math concepts. In
this talk, we will show how Precalculus concepts can motivate students
in the University of Hawai`i at Mānoa. Some interesting and recreational
use of certain concepts will be explored. At the end, we will cover
other ideas such as how to develop and maintain an effective culture of
assessment that may be used for future improvement and more.

Logic seminar: The number of maximally complex languages
Oct 29 @ 2:30 pm – 3:30 pm

Speaker: B. Kjos-Hanssen (joint work with Lei Liu)
Campeanu and Ho (2004) stated that it is “very difficult” to compute the number $m_n$ of maximally complex languages (in a finite automata sense) consisting of binary words of length $n$. We show that $m_n=O_{i,n}$, the number of functions from $[2^i]$ to $[2^{2^{n-i}}]$ whose range contains $[2^{2^{n-i}}-1]$, for the least $i$ for which $O_{i,n}>0$. Here, $[a]=${1,…,a}.

Colloquium John Marriott (Boeing) @ Keller 401
Nov 2 @ 3:30 pm – 4:30 pm

Speaker: John Marriott (Boeing)
Title: Data Science Curriculum for Industry


John Marriott earned his PhD from UH Math in 2013 and currently works
at Boeing as a data scientist. He combines mathematical modeling,
statistics, and programming to create data products on logistics,
labor estimates, and workplace safety. He will talk about his current
work, the transition from academia to industry, and suggestions for
curriculum to prepare students for work in this field.

Colloquium: Pamela Harris (Williams)
Nov 2 @ 3:30 pm – 4:30 pm
Jake Fennick: Probabilistic logic @ Keller 314
Nov 5 @ 2:30 pm – 3:30 pm

Title: Logic with Probability Quantifiers

Abstract: This talk is based on chapter XIV of Model-Theoretic Logics
( I will first give
a brief review of admissible sets and the infinitary logic which is
necessary for probability quantifiers. Then I will present the language
of probability quantifiers, as well as the proof theory, model theory,
and some examples which indicate the expressive power of the language.
Time permitting, my goal is to work towards the main completeness
theorem in section 2.3