“The European Qur’ān” (EuQu: https://euqu.eu/) is an ongoing project
funded by a Synergy Grant of the European Research Council (ERC),
dedicated to the important place of the Muslim holy book in
European cultural and religious history. From the 12th...
“The European Qur’ān” (EuQu: https://euqu.eu/) is an ongoing project
funded by a Synergy Grant of the European Research Council (ERC),
dedicated to the important place of the Muslim holy book in
European cultural and religious history. From the 12th...
“The European Qur’ān” (EuQu: https://euqu.eu/) is an ongoing project
funded by a Synergy Grant of the European Research Council (ERC),
dedicated to the important place of the Muslim holy book in
European cultural and religious history. From the 12th...
“The European Qur’ān” (EuQu: https://euqu.eu/) is an ongoing project
funded by a Synergy Grant of the European Research Council (ERC),
dedicated to the important place of the Muslim holy book in
European cultural and religious history. From the 12th...
This is the second in a series of talks on "two realizations."
We discuss equivariantization and de-equivariantization for a
group GG, which relate categories with GG-actions and
categories with RepG-actions, and how this relates to the notion
of...
We show that the direct product of an infinite, finitely
generated Kazhdan Property (T) group and a finitely presented, not
residually finite amenable group admits no sofic approximation by
expander graphs. Joint work with Andreas Thom.
Expander graphs are graphs which simultaneously are both sparse
and highly connected. The theory of expander graphs received a
lot of attention in the past half a century, from both computer
science and mathematics. In recent years, a new theory of...
A 1948 theorem of de Bruijn and Erdős says that
if nn points in a projective plane do not lie all on a
line, then they determine at least n lines. More generally, Dowling
and Wilson conjectured in 1974 that for any finite set of vectors
spanning a...
Non-constructive existence proofs, which establish the existence
of objects without furnishing an efficient algorithm to produce
examples, abound in mathematics. How hard is it, computationally,
to find objects whose existence is guaranteed non...
