[Facets-of-complexity] Invitation to Monday's Lecture & Colloquium - hybrid - Nov.29 !

["I.Brunke" <i.brunke@fu-berlin.de>]

Dear all,

next Monday's Lecture and Colloquium will take place both, online via Zoom and at FU Berlin on November 29.

Please find link to Zoom here:
https://tu-berlin.zoom.us/j/69716124232?pwd=dzFlcTFHMmFXRTE5QmZLaEV5N0FRUT09
No password is required.


Please note Corona restrictions !  - See rules in detail below !
You have to fit 2G rules for participation in person.
 If not, it is mandatory to bring a valid test.


You all are cordially invited!

Location:

Online via Zoom.
Please find link to Zoom here:
https://tu-berlin.zoom.us/j/69716124232?pwd=dzFlcTFHMmFXRTE5QmZLaEV5N0FRUT09
No password is required.

Room 005 - Ground Floor
Freie Universität Berlin
Takustr. 9
14195 Berlin

Monday's Lecture: Henry Adams (Institute of Science and Technology Austria)

Time: Monday, November 29 - 14:15 h

Title: Open questions on clique complexes of graphs

Abstract:

The clique complex of a graph is a simplicial complex with a simplex for each clique. Clique complexes are frequently being computed in applications of topology to data, but we do not understand their algorithmic theory or their mathematical theory. I will introduce clique complexes of graphs, explain why applied topologists care about them, and survey open problems about the topology of clique complexes of unit disk graphs, powers of lattice graphs, and powers of hypercube graphs.


Coffee Break

Monday's Colloquium: Benjamin Berendsohn (Freie Universität Berlin)

Time: Monday, November 29 - 16:00 h s.t.

Title: Search trees on graphs

Abstract:

Search trees on graphs (STGs) are a generalization of binary search trees (BSTs). Where the key space of a BST is a totally ordered set, the key space of a STG is a graph. STGs are a relatively recent notion, but have been studied previously under different names, including elimination trees, maximal tubings, and vertex rankings. We survey some results. On the computational side, we consider a model of computation for STGs analagous to the BST model, and study which known results for BSTs can be adapted. On the combinatorial side, we study the diameter of certain polytopes called graph associahedra, which can be defined via STGs.

___________

Corona access rules accordingly:

Please observe the current Corona safety constraints:

3G access rule - a medical or FFP2 mask must be worn!
See https://www.fu-berlin.de/en/sites/coronavirus/faq/studium/3g/

Please bring a proof of your vaccination status or test by a certified unit, as well as a photo-ID.

For tracking the contacts in case of an infection, we use a.nwesen.de.
See https://anwesende.imp.fu-berlin.de/

There is a QR-code at every place, which you can scan with your smartphone.

You all are cordially invited!

Virenfrei. www.avast.com