Related papers: Projective Fra\"{i}ss\'{e} limits and generalized …

We generalize the classical Tanaka result on the finiteness of symmetry algebra for non-degenerate pseudo-product structures to the case when the completely-integrable distributions defining the pseudo-product structure are no longer…

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…

Using a Zariski topology associated to a finite field extensions, we give new proofs and generalize the primitive and normal basis theorems.

We devise a fairly general sufficient condition ensuring that the endomorphism monoid of a countably infinite ultrahomogeneous structure (i.e. a Fra\"{\i}ss\'{e} limit) embeds all countable semigroups. This approach provides us not only…

We investigate the differential calculus defined by Ashtekar and Lewandowski on projective limits of manifolds by means of cylindrical smooth functions and compare it with the C^infty calculus proposed by Froehlicher and Kriegl in more…

We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…

We study vectors chosen at random from a compact convex polytope in $\mathbb{R}^n$ given by a finite number of linear constraints. We determine which projections of these random vectors are asymptotically normal as $n\to\infty$. Marginal…

Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…

We show that every connected graph can be approximated by a normal tree, up to some arbitrarily small error phrased in terms of neighbourhoods around its ends. The existence of such approximate normal trees has consequences of both…

We develop a new method to compute the homology groups of finite topological spaces (or equivalently of finite partially ordered sets) by means of spectral sequences giving a complete and simple description of the corresponding…

We study the local profiles of trees. We show that, in contrast with the situation for general graphs, the limit set of k-profiles of trees is convex. We initiate a study of the defining inequalities of this convex set. Many challenging…

We study homeomorphisms and the homeomorphism groups of compact metric spaces using the automorphism groups of projective Fra\"iss\'e limits. In our applications, we investigate the Polish group ${\rm Homeo}(P)$ of all homeomorphisms of the…

Several known constructions relate initial degenerations of projective toric varieties and Grassmannians to regular subdivisions of appropriate point configurations. We define a general framework which allows for partial generalizations of…

The inducibility of a graph represents its maximum density as an induced subgraph over all possible sequences of graphs of size growing to infinity. This invariant of graphs has been extensively studied since its introduction in $1975$ by…

We consider the natural generalization of the notion of the order of a phantom map from the topological setting to triangulated categories. When applied to the derived category of the category of countable flat modules over a countable…

The class of terminal planar networks was recently introduced from a biological perspective in relation to the visualization of phylogenetic networks, and its connection to upward planar networks has been established. We provide a…

Given a finitely generated algebra $A$, it is a fundamental question whether $A$ has a full rank discrete (Krull) valuation $\mathfrak{v}$ with finitely generated value semigroup. We give a necessary and sufficient condition for this, in…

We provide the first example of continuous families of Poincar\'e-Einstein metrics developing cusps on the trivial topology $\mathbb{R}^4$. We also exhibit families of metrics with unexpected degenerations in their conformal infinity only.…

Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…

This is a survey article on trees, with a modest number of proofs to give a flavor of the way these topologies can be efficiently handled. Trees are defined in set-theorist fashion as partially ordered sets in which the elements below each…