Related papers: Cantor combinatorics and almost finiteness
We define and study expansion problems on countable structures in the setting of descriptive combinatorics. We consider both expansions on countable Borel equivalence relations and on countable groups, in the Borel, measure and category…
We develop an idempotent version of probabilistic potential theory. The goal is to describe the set of max-plus harmonic functions, which give the stationary solutions of deterministic optimal control problems with additive reward. The…
Arithmetic combinatorics is often concerned with the problem of bounding the behaviour of arbitrary finite sets in a group or ring with respect to arithmetic operations such as addition or multiplication. Similarly, combinatorial geometry…
We provide the foundation of the spectral analysis of the Laplacian on the orbital Schreier graphs of the Basilica group, the iterated monodromy group of the quadratic polynomial $z^2-1$. This group is an important example in the class of…
We find an explicit combinatorial gradient vector field on the well known complex S (Salvetti complex) which models the complement to an arrangement of complexified hyperplanes. The argument uses a total ordering on the facets of the…
A Bayesian functorial characterization of the classical relative entropy (KL divergence) of finite probabilities was recently obtained by Baez and Fritz. This was then generalized to standard Borel spaces by Gagn\'e and Panangaden. Here, we…
In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…
A "Bochner-type" integral for vector lattice-valued functions with respect to (possibly infinite) vector lattice-valued measures is presented with respect to abstract convergences, satisfying suitable axioms, and some fundamental properties…
We prove the conjecture (known as the ``Ten Martini Problem'' after Kac and Simon) that the spectrum of the almost Mathieu operator is a Cantor set for all non-zero values of the coupling and all irrational frequencies.
We investigate the almost sure asymptotic properties of vector martingale transforms. Assuming some appropriate regularity conditions both on the increasing process and on the moments of the martingale, we prove that normalized moments of…
We give a common matroidal generalisation of `A Cantor-Bernstein theorem for paths in graphs' by Diestel and Thomassen and `A Cantor-Bernstein-type theorem for spanning trees in infinite graphs' by ourselves.
We give lower bounds on the largest singular value of arbitrary matrices, some of which are asymptotically tight for almost all matrices. To study when these bounds are exact, we introduce several combinatorial concepts. In particular, we…
We introduce a continuous analog of the Fourier ratio for compactly supported Borel measures. For a measure \(\mu\) on \(\mathbb{R}^d\) and \(f\in L^2(\mu)\), the Fourier ratio compares \(L^1\) and \(L^2\) norms of a regularized Fourier…
In this paper we prove, in a purely combinatorial way, a structural quasi-polynomiality property for the Bousquet-M\'elou-Schaeffer numbers. Conjecturally, this property should follow from the Chekhov-Eynard-Orantin topological recursion…
In this paper we discuss several variations and generalizations of the Cantor set and study some of their properties. Also for each of those generalizations a Cantor-like function can be constructed from the set. We will discuss briefly the…
We explore various combinatorial problems mostly borrowed from physics, that share the property of being continuously or discretely integrable, a feature that guarantees the existence of conservation laws that often make the problems…
Spectral methods that are based on eigenvectors and eigenvalues of discrete graph Laplacians, such as Diffusion Maps and Laplacian Eigenmaps are often used for manifold learning and non-linear dimensionality reduction. It was previously…
We present a modular semantic account of Bayesian inference algorithms for probabilistic programming languages, as used in data science and machine learning. Sophisticated inference algorithms are often explained in terms of composition of…
We describe the approximation of a continuous dynamical system on a p. l. manifold or Cantor set by a tractable system. A system is tractable when it has a finite number of chain components and, with respect to a given full background…
First we survey generating function methods for obtaining useful probability estimates about random matrices in the finite classical groups. Then we describe a probabilistic picture of conjugacy classes which is coherent and beautiful.…