Related papers: Finiteness properties for self-similar continua
We look at spaces of infinite-by-infinite matrices, and consider closed subsets that are stable under simultaneous row and column operations. We prove that up to symmetry, any of these closed subsets is defined by finitely many equations.
It was proved in 2007 by C.Bandt and H.Rao that if a system $S = \{S_1 , ..., S_m \}$ of contraction similarities in $R^2$ with a connected attractor $K$ has the finite intersection property, then it satisfies OSC. We construct a…
We consider the intersections of fractal k-cubes of order n and intersections of their respective opposite l-faces. The main result of the paper is the theorem on representation of such intersection as the attractor of a graph-directed…
Each self-similar dendrite K with a finite self-similar boundary defines a finite acyclic edge-labeled bipartite graph G, called the sprout of K. The paper shows that the sprout G determines the combinatorial properties of the dendrite K…
We show that the relational theory of intersection types known as BCD has the finite model property; that is, BCD is complete for its finite models. Our proof uses rewriting techniques which have as an immediate by-product the polynomial…
An infinite structure has the finite length property (over a given field) if, for each of its finite powers, chains of equivariant subspaces in the corresponding free vector space are bounded in length. Prior work showed that the countable…
We prove that for any self-affine dendrite K generated by a polygonal system, there are constants C>0 and $\lambda\in(0, 1)$ such that for any x, y in K, the Jordan arc $\gamma$ in K with endpoints x, y satisfies the inequality…
A combinatorial criterion for the edge ring of a finite connected graph to satisfy Serre's condition R_1 is studied.
The local Lipschitz property is shown for the graph avoiding multiple point intersection with lines directed in a given cone. The assumption is much stronger than those of Marstrand's well-known theorem, but the conclusion is much stronger…
The "finite intersection property" for bifunctions is introduced and its relationship with generalized monotonicity properties is studied. Some results concerning existence of solution for (quasi-)equilibrium problems are established and…
A recurrent graph $G$ has the infinite collision property if two independent random walks on $G$, started at the same point, collide infinitely often a.s. We give a simple criterion in terms of Green functions for a graph to have this…
We consider the Bernoulli bond percolation process (with parameter $p$) on infinite graphs and we give a general criterion for bounded degree graphs to exhibit a non-trivial percolation threshold based either on a single isoperimetric…
Broadly speaking, a finiteness property of groups is any generalisation of the property of having finite order. A large part of infinite group theory is concerned with finiteness properties and the relationships between them. Profinite…
We build an example of a system $\mathcal{S}$ of similarities in $\mathbb{R}^2$ whose attractor is a plane dendrite $K\supset [0,1]$ which satisfies one point intersection property, while the post-critical set of the system $\mathcal{S}$ is…
We show that a finite collection of stable subgroups of a finitely generated group has finite height, finite width and bounded packing. We then use knowledge about intersections of conjugates to characterize finite families of…
In this paper, inspired by the elegant work of Good and Meddaugh \cite{GM} and the graph models for zero-dimensional systems developed by several authors, like Gambaudo and Martens \cite{GM06}, Shimomura \cite{Sh14}. We try to discover a…
We describe some metric properties of incomparability graphs. We consider the problem of the existence of infinite paths, either induced or isometric, in the incomparability graph of a poset. Among other things, we show that if the…
We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.
End-spaces of infinite graphs naturally generalise the Freudenthal boundary and sit at the interface between graph theory, geometric group theory and topology. Our main result is that every end-space can topologically be represented by a…
We introduce a general notion of covering property, of which many classical definitions are particular instances. Notions of closure under various sorts of convergence, or, more generally, under taking kinds of accumulation points, are…