Search

We say that $E$ is a microset of the compact set $K\subset \mathbb{R}^d$ if there exist sequences $\lambda_n\geq 1$ and $u_n\in \mathbb{R}^d$ such that $(\lambda_n K + u_n ) \cap [0,1]^d$ converges to $E$ in the Hausdorff metric, and moreover, $E \cap (0, 1)^d \neq \emptyset$. The main result of the paper is that for a non-empty set $A\subset [0,d]$ there is a compact set $K\subset \mathbb{R}^d$ such that the set of Hausdorff dimensions attained by the microsets of $K$ equals $A$ if and only if $A$ is analytic and contains its infimum and supremum. This answers a question of Fraser, Howroyd, K\"aenm\"aki, and Yu. We show that for every compact set $K\subset \mathbb{R}^d$ and non-empty analytic set $A\subset [0,\dim_H K]$ there is a set $\mathcal{C}$ of compact subsets of $K$ which is compact in the Hausdorff metric and $\{\dim_H C: C\in \mathcal{C} \}=A$. The proof relies on the technique of stochastic co-dimension applied for a suitable coupling of fractal percolations with generation dependent retention probabilities. We also examine the analogous problems for packing and box dimensions., Comment: 21 pages, the proofs of Theorems 4.7 and 4.8 were improved, also some minor modifications

The lower dimension $\dim_L$ is the dual concept of the Assouad dimension. As it fails to be monotonic, Fraser and Yu introduced the modified lower dimension $\dim_{ML}$ by making the lower dimension monotonic with the simple formula $\dim_{ML} X=\sup\{\dim_L E: E\subset X\}$. As our first result we prove that the modified lower dimension is finitely stable in any metric space, answering a question of Fraser and Yu. We prove a new, simple characterization for the modified lower dimension. For a metric space $X$ let $\mathcal{K}(X)$ denote the metric space of the non-empty compact subsets of $X$ endowed with the Hausdorff metric. As an application of our characterization, we show that the map $\dim_{ML} \colon \mathcal{K}(X)\to [0,\infty]$ is Borel measurable. More precisely, it is of Baire class $2$, but in general not of Baire class $1$. This answers another question of Fraser and Yu. Finally, we prove that the modified lower dimension is not Borel measurable defined on the closed sets of $\ell^1$ endowed with the Effros Borel structure., Comment: 10 pages. A new paragraph added to the introduction

We consider a real-valued function $f$ defined on the set of infinite branches $X$ of a countably branching pruned tree $T$. The function $f$ is said to be a \textit{limsup function} if there is a function $u \colon T \to \mathbb{R}$ such that $f(x) = \limsup_{t \to \infty} u(x_{0},\dots,x_{t})$ for each $x \in X$. We study a game characterization of limsup functions, as well as a novel game characterization of functions of Baire class 1.

S. Banach pointed out that the graph of the generic (in the sense of Baire category) element of $\text{Homeo}([0,1])$ has length $2$. J. Mycielski asked if the measure theoretic dual holds, i.e., if the graph of all but Haar null many (in the sense of Christensen) elements of $\text{Homeo}([0,1])$ have length $2$. We answer this question in the affirmative. We call $f \in \text{Homeo}([0,1]^d)$ singular if it takes a suitable set of full measure to a nullset, and strongly singular if it is almost everywhere differentiable with singular derivative matrix. Since the graph of $f \in \text{Homeo}([0,1])$ has length $2$ iff $f$ is singular iff $f$ is strongly singular, the following results are the higher dimensional analogues of Banach's observation and our solution to Mycielski's problem. We show that for $d \ge 2$ the graph of the generic element of $\text{Homeo}([0,1]^d)$ has infinite $d$-dimensional Hausdorff measure, contrasting the above result of Banach. The measure theoretic dual remains open, but we show that the set of elements of $\text{Homeo}([0,1]^d)$ with infinite $d$-dimensional Hausdorff measure is not Haar null. We show that for $d \ge 2$ the generic element of $\text{Homeo}([0,1]^d)$ is singular but not strongly singular. We also show that for $d \ge 2$ almost every element of $\text{Homeo}([0,1]^d)$ is singular, but the set of strongly singular elements form a so called Haar ambivalent set (neither Haar null, nor co-Haar null). Finally, in order to clarify the situation, we investigate the various possible definitions of singularity for maps of several variables, and explore the connections between them., Comment: 31 pages. Final version with minor modifications

We answer a question of Banakh, Jab\l{}o\'nska and Jab\l{}o\'nski by showing that for $d\ge 2$ there exists a compact set $K \subseteq \mathbb{R}^d$ such that the projection of $K$ onto each hyperplane is of non-empty interior, but $K+K$ is nowhere dense. The proof relies on a random construction. A natural approach in the proofs is to construct such a $K$ in the unit cube with full projections, that is, such that the projections of $K$ agree with that of the unit cube. We investigate the generalization of these problems for projections onto various dimensional subspaces as well as for $\ell$-fold sumsets. We obtain numerous positive and negative results, but also leave open many interesting cases. We also show that in most cases if we have a specific example of such a compact set then actually the generic (in the sense of Baire category) compact set in a suitably chosen space is also an example. Finally, utilizing a computer-aided construction, we show that the compact set in the plane with full projections and nowhere dense sumset can be self-similar., Comment: 26 pages, 3 figures. Small modifications, final version

We study the behavior of the activity of the parallel chip-firing upon increasing the number of chips on an Erd\H{o}s--R\'enyi random graph. We show that in various situations the resulting activity diagrams converge to a devil's staircase as we increase the number of vertices. Our method is to generalize the parallel chip-firing to graphons, and to prove a continuity result for the activity. We also show that the activity of a chip configuration on a graphon does not necessarily exist, but it does exist for every chip configuration on a large class of graphons.

We describe a probabilistic model involving iterated Brownian motion for constructing a random chainable continuum. We show that this random continuum is indecomposable.

We give a complete description of the size of the conjugacy classes of the automorphism group of the random graph with respect to Christensen's Haar null ideal. It is shown that every non-Haar null class contains a translated copy of a nonempty portion of every compact set and that there are continuum many non-Haar null conjugacy classes. Our methods also yield a new proof of an old result of Truss., Comment: Most of this work previously appeared in the first version of the paper arXiv:1705.07593 which was split into 3 articles

In order to understand the structure of the "typical" element of an automorphism group, one has to study how large the conjugacy classes of the group are. For the case when typical is meant in the sense of Baire category, Truss proved that there is a co-meagre conjugacy class in Aut(Q, <), the automorphism group of the rational numbers. Following Dougherty and Mycielski we investigate the measure theoretic dual of this problem, using Christensen's notion of Haar null sets. We give a complete description of the size of the conjugacy classes of Aut(Q, <) with respect to this notion. In particular, we show that there exist continuum many non-Haar null conjugacy classes, illustrating that the random behaviour is quite different from the typical one in the sense of Baire category., Comment: Most of this work previously appeared in the first version of the paper arXiv:1705.07593 which was split into 3 articles, including arXiv:1808.06121

In order to understand the structure of the `typical' element of an automorphism group, one has to study how large the conjugacy classes of the group are. When typical is meant in the sense of Baire category, a complete description of the size of the conjugacy classes has been given by Kechris and Rosendal. Following Dougherty and Mycielski we investigate the measure theoretic dual of this problem, using Christensen's notion of Haar null sets. When typical means random, that is, almost every with respect to this notion of Haar null sets, the behavior of the automorphisms is entirely different from the Baire category case. In this paper, we generalize the theorems of Dougherty and Mycielski about $S_\infty$ to arbitrary automorphism groups of countable structures isolating a new model theoretic property, the Cofinal Strong Amalgamation Property. As an application we show that a large class of automorphism groups can be decomposed into the union of a meager and a Haar null set.

In order to understand the structure of the "typical" element of a homeomorphism group, one has to study how large the conjugacy classes of the group are. When typical means generic in the sense of Baire category, this is well understood, see e.g. the works of Glasner and Weiss, and Kechris and Rosendal. Following Dougherty and Mycielski we investigate the measure theoretic dual of this problem, using Christensen's notion of Haar null sets. When typical means random, that is, almost every with respect to this notion of Haar null sets, the behaviour of the homeomorphisms is entirely different from the generic case. For $\text{Homeo}^+([0,1])$ we describe the non-Haar null conjugacy classes and also show that their union is co-Haar null, for $\text{Homeo}^+(\mathbb{S}^1)$ we describe the non-Haar null conjugacy classes, and for $\mathcal{U}(\ell^2)$ we show that, apart from the classes of the multishifts, all conjugacy classes are Haar null. As an application we affirmatively answer the question whether these groups can be written as the union of a meagre and a Haar null set.

Duparc introduced a two-player game for a function $f$ between zero-dimensional Polish spaces in which Player II has a winning strategy iff $f$ is of Baire class 1. We generalize this result by defining a game for an arbitrary function $f : X \to Y$ between arbitrary Polish spaces such that Player II has a winning strategy in this game iff $f$ is of Baire class 1. Using the strategy of Player II, we reprove a result concerning first return recoverable functions.

In this paper, we study the complexity of the chip-firing reachability problem. We show that for Eulerian digraphs, the reachability problem can be decided in strongly polynomial time, even if the digraph has multiple edges. We also show a special case when the reachability problem can be decided in polynomial time for general digraphs: if the target distribution is recurrent restricted to each strongly connected component. As a further positive result, we show that the chip-firing reachability problem is in co-NP for general digraphs. We also show that the chip-firing halting problem is in co-NP for Eulerian digraphs.

Kechris and Louveau showed that each real-valued bounded Baire class 1 function defined on a compact metric space can be written as an alternating sum of a decreasing countable transfinite sequence of upper semi-continuous functions. Moreover, the length of the shortest such sequence is essentially the same as the value of certain natural ranks they defined on the Baire class 1 functions. They also introduced the notion of pseudouniform convergence to generate some classes of bounded Baire class 1 functions from others. The main aim of this paper is to generalize their results to Baire class $\xi$ functions. For our proofs to go through, it was essential to first obtain similar results for Baire class 1 functions defined on not necessary compact Polish spaces. Using these new classifications of bounded Baire class $\xi$ functions, one can define natural ranks on these classes. We show that these ranks essentially coincide with those defined by Elekes et. al.

Baker and Norine introduced a graph-theoretic analogue of the Riemann-Roch theory. A central notion in this theory is the rank of a divisor. In this paper we prove that computing the rank of a divisor on a graph is NP-hard. The determination of the rank of a divisor can be translated to a question about a chip-firing game on the same underlying graph. We prove the NP-hardness of this question by relating chip-firing on directed and undirected graphs.

In 1990 Kechris and Louveau developed the theory of three very natural ranks on the Baire class $1$ functions. A rank is a function assigning countable ordinals to certain objects, typically measuring their complexity. We extend this theory to the case of Baire class $\xi$ functions, and generalize most of the results from the Baire class 1 case. We also show that their assumption of the compactness of the underlying space can be eliminated. As an application, we solve a problem concerning the so called solvability cardinals of systems of difference equations, arising from the theory of geometric decompositions. We also show that certain other very natural generalizations of the ranks of Kechris and Louveau surprisingly turn out to be bounded in $\omega_1$. Finally, we prove a general result showing that all ranks satisfying some natural properties coincide for bounded functions.

T. Keleti asked, whether the ratio of the perimeter and the area of a finite union of unit squares is always at most 4. In this paper we present an example where the ratio is greater than 4. We also answer the analogous question for regular triangles negatively and list a number of open problems.