Related papers: A Geometric Zero-One Law

Given an infinite connected graph, a way to randomly perturb its metric is to assign random i.i.d. lengths to the edges of the graph. Assume that the graph is infinite and of bounded degree. Assume also strict positivity and finite…

A subset of vertices of a graph is minimal if, within all subsets of the same size, its vertex boundary is minimal. We give a complete, geometric characterization of minimal sets for the planar integer lattice X. Our characterization…

We develop a notion of rank one properly convex domains (or Hilbert geometries) in the real projective space. This is in the spirit of rank one non-positively curved Riemannian manifolds and CAT(0) spaces. We define rank one isometries for…

Let X be a projective, equidimensional, singular scheme over an algebraically closed field. Then the existence of a geometric smoothing (i.e. a family of deformations of X over a smooth base curve whose generic fibre is smooth) implies the…

After introducing the different boundary geometries of rank one symmetric spaces, we state and prove Fried's theorem in the general setting of all those geometries: a closed manifold with a similarity structure is either complete or the…

We introduce a class of algebras over a field $\mathbb{F}$ related to directed graphs in which all edges are labeled by nonzero elements of the field $\mathbb{F}$. If all labels are different from $1$, these algebras are axial algebras. We…

Let $G$ be a graph with a vertex set $V$. The graph $G$ is path-proximinal if there are a semimetric $d \colon V \times V \to [0, \infty[$ and disjoint proximinal subsets of the semimetric space $(V, d)$ such that $V = A \cup B$, and…

We extend several techniques and theorems from geometric group theory so that they apply to geometric actions on arbitrary proper metric ARs (absolute retracts). A second way that we generalize earlier results is by eliminating freeness…

In this note, we continue to highlight some applications of Theorem 1 of [3]. Here is a sample: Let $X$ be an open set in ${\bf C}^n$, $\Omega$ an open convex set in ${\bf C}$ and $f, g : X\to {\bf C}$ two holomorphic functions such that…

A complete first order theory of a relational signature is called monomorphic iff all its models are monomorphic (i.e. have all the $n$-element substructures isomorphic, for each positive integer $n$). We show that a complete theory…

A structure is called homogeneous if every isomorphism between finite substructures of the structure extends to an automorphism of the structure. Recently, P. J. Cameron and J. Ne\v{s}et\v{r}il introduced a relaxed version of homogeneity:…

We identify a condition on X that guarantees that any finite power of X is homeomorphic to a subspace of a linearly ordered space

Let $G$ be a complex connected reductive algebraic group that acts on a smooth complex algebraic variety $X$, and let $E$ be a $G$-equivariant algebraic vector bundle over $X$. A section of $E$ is regular if it is transversal to the zero…

Let X be a group with identity e, let A be an infinite set of generators for X, and let (X,d_A) be the metric space with the word metric d_A induced by A. If the diameter of the space is infinite, then for every positive integer h there are…

In this paper, we introduce a graph structure, called non-zero component graph on finite dimensional vector spaces. We show that the graph is connected and find its domination number and independence number. We also study the…

Let X be a topological space. The closure of \Delta = {(x, x) : x \in X} in X \times X is a symmetric relation on X. We characterise those equivalence relations on an infinite set that arise as the closure of the diagonal with respect to a…

Given a projective algebraic set X, its dual graph G(X) is the graph whose vertices are the irreducible components of X and whose edges connect components that intersect in codimension one. Hartshorne's connectedness theorem says that if…

We say that a first order formula A distinguishes a graph G from another graph G' if A is true on G and false on G'. Provided G and G' are non-isomorphic, let D(G,G') denote the minimal quantifier rank of a such formula. We prove that, if G…

Any procedure applied to data, and any quantity derived from data, is required to respect the nature and symmetries of the data. This axiom applies to refinement procedures and multiresolution transforms as well as to more basic operations…

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…