Related papers: Limit-closed Profiles
We continue the study of $(tw,\omega)$-bounded graph classes, that is, hereditary graph classes in which large treewidth is witnessed by the presence of a large clique, and the relation of this property to boundedness of the…
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occurs-check) and increased expressivity (cyclic terms can…
We identify a structural pattern in the construction of known infinite families of trees whose independence polynomials are not log-concave. Using this pattern and properties of polynomial ring ideals, we derive linear recurrences for these…
We study the tailoring of structured random graph ensembles to real networks, with the objective of generating precise and practical mathematical tools for quantifying and comparing network topologies macroscopically, beyond the level of…
We define E-theory for separable C*-algebras over second countable topological spaces and establish its basic properties. This includes an approximation theorem that relates the E-theory over a general space to the E-theories over finite…
We prove a nonuniqueness theorem for Bernoulli site percolation on properly embedded planar graphs, and we obtain a general connectivity principle beyond planarity. Let $G$ be an infinite connected graph properly embedded in $\RR^2$ with…
This article will be a continuation of our research into self-justifying systems. It will introduce several new theorems and their applications. (One of these results will transform our previous infinite-sized self-verifying formalisms into…
A tangle of order $k$ in a matroid or graph may be thought of as a "$k$-connected component". For a tangle of order $k$ in a matroid or graph that satisfies a certain robustness condition, we describe a tree decomposition of the matroid or…
It is well-known that inference in graphical models is hard in the worst case, but tractable for models with bounded treewidth. We ask whether treewidth is the only structural criterion of the underlying graph that enables tractable…
The paper deals with Henselian valued field with analytic structure. Actually, we are focused on separated analytic structures, but the results remain valid for strictly convergent analytic ones as well. A classical example of the latter is…
We show that products of sufficiently thick Cantor sets generate trees in the plane with constant distance between adjacent vertices. Moreover, we prove that the set of choices for this distance has non-empty interior. We allow our trees to…
Some aspects of a mathematical theory of rigidity and flexibility are developed for general infinite frameworks and two main results are obtained. In the first sufficient conditions, of a uniform local nature, are obtained for the existence…
We present a canonical way to decompose finite graphs into highly connected local parts. The decomposition depends only on an integer parameter whose choice sets the intended degree of locality. The global structure of the graph, as…
By algorithmic metatheorems for a model checking problem P over infinite-state systems we mean generic results that can be used to infer decidability (possibly complexity) of P not only over a specific class of infinite systems, but over a…
We prove an accessibility theorem for finite-index splittings of groups. Given a finitely presented group G there is a number n(G) such that, for every reduced locally finite G-tree T with finitely generated stabilizers, T/G has at most…
We introduce a general framework to show the indistinguishability of infinite clusters (ergodicity of the cluster subrelation) in group-invariant percolation processes with a weaker version of the finite energy property: the possibility of…
In this paper, for a given finitely generated algebra (an algebraic structure with arbitrary operations and no predicates) A we study finitely generated limit algebras of A, approaching them via model theory and algebraic geometry. Along…
Generalizing the classical matrix-tree theorem we provide a formula counting subgraphs of a given graph with a fixed 2-core. We use this generalization to obtain an analog of the matrix-tree theorem for the root system $D_n$ (the classical…
We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…
Generating trees are a useful technique in the enumeration of various combinatorial objects, particularly restricted permutations. Quite often the generating tree for the set of permutations avoiding a set of patterns requires infinitely…