相关论文: A Geometric Zero-One Law

A class of structures is said to have the homomorphism-preservation property just in case every first-order formula that is preserved by homomorphisms on this class is equivalent to an existential-positive formula. It is known by a result…

Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…

In previous work we defined and studied a notion of typicality, originated with B. Russell, for properties and objects in the context of general infinite first-order structures. In this paper we consider this notion in the context of finite…

Let $G$ be a Lie group, $\Gamma\subset G$ a discrete subgroup, $X=G/\Gamma$, and $f$ an affine map from $X$ to itself. We give conditions on a submanifold $Z$ of $X$ guaranteeing that the set of points $x\in X$ with $f$-trajectories…

Given a dense countable set in a metric space, the infinite random geometric graph is the random graph with the given vertex set and where any two points at distance less than 1 are connected, independently, with some fixed probability. It…

By a [$K$-]approximate subring of a ring we mean an additively symmetric subset $X$ such that $X \cdot X \cup (X + X)$ is covered by finitely many [resp.\ $K$] additive translates of $X$. We prove a structure theorem for finite approximate…

If $X$ is a (topological) space, the $n$th finite subset space of $X$, denoted by $X(n)$, consists of $n$-point subsets of $X$ (i.e., nonempty subsets of cardinality at most $n$) with the quotient topology induced by the unordering map…

A geodesic bicombing on a metric space selects for every pair of points a geodesic connecting them. We prove existence and uniqueness results for geodesic bicombings satisfying different convexity conditions. In combination with recent work…

Let $G$ be a graph on $n$ vertices. For $i\in \{0,1\}$ and a connected graph $G$, a spanning forest $F$ of $G$ is called an $i$-perfect forest if every tree in $F$ is an induced subgraph of $G$ and exactly $i$ vertices of $F$ have even…

If $G$ is a group acting geometrically on a CAT(0) cube complex $X$ and if $g \in G$ is an infinite-order element, we show that exactly one of the following situations occurs: (i) $g$ defines a rank-one isometry of $X$; (ii) the stable…

We introduce the concept of a class of graphs, or more generally, relational structures, being locally tree-decomposable. There are numerous examples of locally tree-decomposable classes, among them the class of planar graphs and all…

The main results on the theory of conformal and almost Grassmann structures are presented. The common properties of these structures and also the differences between them are outlined. In particular, the structure groups of these structures…

We study the first-order almost-sure theories for classes of finite structures that are specified by homomorphically forbidding a set $\mathcal{F}$ of finite structures. If $\mathcal{F}$ consists of undirected graphs, a full description of…

If G is a group, a pseudocharacter f: G-->R is a function which is "almost" a homomorphism. If G admits a nontrivial pseudocharacter f, we define the space of ends of G relative to f and show that if the space of ends is complicated enough,…

We prove asymptotic 0-1 Laws satisfied by diagrams of unimodal sequences of positive integers. These diagrams consist of columns of squares in the plane, and the upper boundary is called the shape. For various types, we show that, as the…

We will show that almost all nonassociative relation algebras are symmetric and integral (in the sense that the fraction of both labelled and unlabelled structures that are symmetric and integral tends to 1), and using a Fra\"iss\'e limit,…

In this paper, we develop a coarse analogue of treewidth. We prove that a graph $G$ admits a tree-decomposition in which each bag is contained in the union of a bounded number of balls of bounded radius, if and only if $G$ admits a…

If a (non-constant) polynomial has no zero, then a certain Riemannian metric is constructed on the two dimensional sphere. Several geometric arguments are then shown to contradict this fact.

A graph $G$ is said to be $\preceq$-ubiquitous, where $\preceq$ is the minor relation between graphs, if whenever $\Gamma$ is a graph with $nG \preceq \Gamma$ for all $n \in \mathbb{N}$, then one also has $\aleph_0 G \preceq \Gamma$, where…

We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth $D(G)$ of a graph $G$ is equal to the minimum quantifier depth of a sentence defining $G$…