Speaker: B. Kjos-Hanssen
Title: Refuting a generalization of Frankl’s conjecture for lattice-like posets
Janitha Awedige will discuss the paper
“Inference Rules for Probability Logic” by Marija Boricic.
Topological data analysis (TDA) is a new approach to analyzing complexdata which often helps reveal otherwise hidden patterns by highlightingvarious geometrical and topological features of the data. Persistenthomology is a key in the TDA toolbox. It measures topological featuresof data that persist across multiple scales and thus are robust withrespect to noise. Persistent homology has had many successfulapplications, but there is room for improvement. For large datasets,computation of persistent homology often takes a significant amount oftime. Several approaches have been proposed to try to remedy this issue,such as witness complexes, but those approaches present their owndifficulties.
Speaker: Chuang Xu (Technical University Munich)
Title:
Analyzing walks with combinatorics and automata theory
Abstract:
The enumeration theorem by Chomsky and Schützenberger revealed
a significant intersection between the theory of automata and
enumerative combinatorics. Since then, much progress has been made in
both fields. However, their intersection remains unchanged in the sense
that no further enumeration theorem emerged beyond that of
Chomsky-Schützenberger. We survey the literature in both fields and
picture what it would look like to expand the intersection between them.