אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב

We will start with presenting the basic notions of (co)homomology of simplical complexes (which requires only basic linear algebra over the field of order 2) and then we will indicate its relevance for several topics in computer science and combinatorics:

1) Property testing.:
2) Quantum error correcting codes :
3) High dimensional expanders.:
4) Random simplical complexes.