arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.01908math.DSmath.CO
收藏

Cantor组合与几乎有限性

Cantor combinatorics and almost finiteness

Gabor Elek

摘要:

在这项调查中,我们给出了一个简洁的介绍,连续版本的博雷尔组合。我们的方法将有一定的算法理论的性质,我们将特别强调的概念,几乎有限的介绍Matui作为一个连续的模拟Borel超有限性。我们还展示了如何理论可以用来研究谱收敛图拉普拉斯算子。

英文摘要:

In this survey we give a concise introduction to a continuous version of Borel combinatorics. Our approach will have a certain algorithm-theoretic nature and we will give special emphasis to the notion of almost finiteness introduced by Matui as a continuous analogue of Borel hyperfiniteness. We also show how the theory can be used to study spectral convergence for graph Laplacians.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑