[图书][B] Maß-und Integrationstheorie
J Elstrodt - 1996 - Springer
Jürgen Elstrodt 8. Auflage Page 1 Maß- und Integrationstheorie Jürgen Elstrodt 8. Auflage Page
2 Maß- und Integrationstheorie Page 3 Jürgen Elstrodt Maß- und Integrationstheorie Achte …
2 Maß- und Integrationstheorie Page 3 Jürgen Elstrodt Maß- und Integrationstheorie Achte …
Local problems on trees from the perspectives of distributed algorithms, finitary factors, and descriptive combinatorics
We study connections between distributed local algorithms, finitary factors of iid processes,
and descriptive combinatorics in the context of regular trees. We extend the Borel …
and descriptive combinatorics in the context of regular trees. We extend the Borel …
Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics
J Grebík, V Rozhoň - Advances in Mathematics, 2023 - Elsevier
We present an intimate connection among the following fields:(a) distributed local
algorithms: coming from the area of computer science,(b) finitary factors of iid processes …
algorithms: coming from the area of computer science,(b) finitary factors of iid processes …
[PDF][PDF] Descriptive graph combinatorics
AS Kechris, AS Marks - preprint, 2016 - math.berkeley.edu
In this article we survey the emerging field of descriptive graph combinatorics. This area has
developed in the last two decades or so at the interface of descriptive set theory and graph …
developed in the last two decades or so at the interface of descriptive set theory and graph …
The landscape of distributed complexities on trees and beyond
We study the local complexity landscape of locally checkable labeling (LCL) problems on
constant-degree graphs with a focus on complexities below log* n. Our contribution is …
constant-degree graphs with a focus on complexities below log* n. Our contribution is …
Perfect matchings in hyperfinite graphings
We characterize hyperfinite bipartite graphings that admit measurable perfect matchings. In
particular, we prove that every regular hyperfinite bipartite graphing admits a measurable …
particular, we prove that every regular hyperfinite bipartite graphing admits a measurable …
Classification of local problems on paths from the perspective of descriptive combinatorics
J Grebík, V Rozhoň - … Abstracts EuroComb 2021: European Conference on …, 2021 - Springer
We classify which local problems with inputs on oriented paths have so-called Borel solution
and show that this class of problems remains the same if we instead require a measurable …
and show that this class of problems remains the same if we instead require a measurable …
Circle squaring with pieces of small boundary and low Borel complexity
Tarski's Circle Squaring Problem from 1925 asks whether it is possible to partition a disk in
the plane into finitely many pieces and reassemble them via isometries to yield a partition of …
the plane into finitely many pieces and reassemble them via isometries to yield a partition of …
Borel factors and embeddings of systems in subshifts
N Chandgotia, S Unger - arXiv preprint arXiv:2203.09359, 2022 - arxiv.org
In this paper we study the combinatorics of free Borel actions of the group $\mathbb Z^ d $
on Polish spaces. Building upon recent work by Chandgotia and Meyerovitch, we introduce …
on Polish spaces. Building upon recent work by Chandgotia and Meyerovitch, we introduce …
Factor-of-iid schreier decorations of lattices in Euclidean spaces
A Schreier decoration is a combinatorial coding of an action of the free group F d on the
vertex set of a 2d-regular graph. We investigate whether a Schreier decoration exists on …
vertex set of a 2d-regular graph. We investigate whether a Schreier decoration exists on …