Related papers: Cantor combinatorics and almost finiteness
In this paper, we analyze the complexity of topological conjugacy of pointed Cantor minimal systems from the point of view of descriptive set theory. We prove that the topological conjugacy relation on pointed Cantor minimal systems is…
We provide a gentle introduction, aimed at non-experts, to Borel combinatorics that studies definable graphs on topological spaces. This is an emerging field on the borderline between combinatorics and descriptive set theory with deep…
We discuss counting problems linked to finite versions of Cantor's diagonal of infinite tableaux. We extend previous results of [2] by refining an equivalence relation that reduces significantly the exhaustive generation. New enumerative…
The goal of the paper is to lay the foundation for the qualitative analogue of the classical, quantitative sparse graph limit theory. In the first part of the paper we introduce the qualitative analogues of the Benjamini-Schramm and…
We study the relationship between hyperfiniteness and problems in Borel graph combinatorics by adapting game-theoretic techniques introduced by Marks to the hyperfinite setting. We compute the possible Borel chromatic numbers and edge…
This article is an introduction to combinatorics under the axiom of determinacy with a focus on partition properties and infinity Borel codes.
Quasi-logarithmic combinatorial structures are a class of decomposable combinatorial structures which extend the logarithmic class considered by Arratia, Barbour and Tavar\'{e} (2003). In order to obtain asymptotic approximations to their…
We show a norm convergence result for the Laplacian on a class of post-critically finite fractals with arbitrary Borel regular probability measure which can be approximated by a sequence of finite-dimensional graph Laplacians with…
We give a version of the Borel-Cantelli lemma. As an application, we prove an almost sure local central limit theorem. As another application, we prove a dynamical Borel-Cantelli lemma for systems with sufficiently fast decay of…
We give a combinatorial description of shape theory using finite topological $T_0$-spaces (finite partially ordered sets). This description may lead to a sort of computational shape theory. Then we introduce the notion of core for inverse…
We describe some combinatorial problems in finite projective planes and indicate how R\'edei's theory of lacunary polynomials can be applied to them.
We establish a correspondence between the semi-infinite and infinite Volterra lattices having a finite logarithmic Hamiltonian and certain classes of even probability measures. In doing so, we apply the inverse spectral theory of Jacobi…
The complement of a Cantor set in the complex plane is itself regarded as a Riemann surface of infinite type. The problem is the quasiconformal equivalence of such Riemann surfaces. Particularly, we are interested in Riemann surfaces given…
Infinitary Combinatorics shows interesting contrasts, with many similarities but also several important differences with its finite analog. The purpose of this paper is to present some concrete examples, both of similarities and of radical…
This survey synthesizes the principal descriptive set-theoretic perspectives on deterministic Cantor sets on the real line and charts directions for future study. After recounting their historical genesis and compiling an up-to-date…
We give the first example of a connected 4-regular graph whose Laplace operator's spectrum is a Cantor set, as well as several other computations of spectra following a common ``finite approximation'' method. These spectra are simple…
We introduce a new method, involving infinite games and Borel determinacy, which we use to answer several well-known questions in Borel combinatorics.
I review a recent progress towards solution of the Almost Mathieu equation (A.G. Abanov, J.C. Talstra, P.B. Wiegmann, Nucl. Phys. B 525, 571, 1998), known also as Harper's equation or Azbel-Hofstadter problem. The spectrum of this equation…
In this work we discuss some appearances of semi-infinite combinatorics in representation theory. We propose a semi-infinite moment graph theory and we motivate it by considering the (not yet rigorously defined) geometric side of the story.…
We study a summability method called almost convergence for bounded measurable functions defined on a locally compact abelian group. We define almost convergence using topologically invariant means and exhibit two different kinds of…