Related papers: A Geometric Zero-One Law
Ne\v{s}et\v{r}il and Ossona de Mendez recently proposed a new definition of graph convergence called structural convergence. The structural convergence framework is based on the probability of satisfaction of logical formulas from a fixed…
Any algebra herein is intended over a field of characteristic 0. Let $E$ denote the infinite dimensional Grassman algebra. Given a power associative finite dimensional {$\mathbb{Z}_2$-graded-central-simple} $A$ and a supertrace algebra $B$,…
This work is motivated by the problem of finding the limit of the applicability of the first incompleteness theorem ($\sf G1$). A natural question is: can we find a minimal theory for which $\sf G1$ holds? We examine the Turing degree…
For a geometrically rational surface X over an arbitrary field of characteristic different from 2 and 3 that contains all roots of 1, we show that either X is birational to a product of a projective line and a conic, or the group of…
The {\em metric dimension} of a graph $\Gamma$ is the least number of vertices in a set with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex. We consider the Grassmann graph…
Let $G$ be a finite abelian group and let $K$ be an algebraically closed field of characteristic 0. We consider associative unital algebras $A$ over $K$ graded by $G$, that is $A=\oplus_{g\in G} A_g$, where the vector subspaces $A_g$…
In this article, we investigate the status of the homomorphism preservation property amongst restricted classes of finite relational structures and algebraic structures. We show that there are many homomorphism-closed classes of finite…
The main theorem states that any complete connected Riemannian manifold of bounded geometry can be isometrically realized as a leaf with trivial holonomy in a compact Riemannian foliated space.
In this paper, we study zero-one laws for the Erd\H{o}s--R\'{e}nyi random graph model $G(n,p)$ in the case when $p = n^{-\alpha}$ for $\alpha>0$. For a given class $\mathcal{K}$ of logical sentences about graphs and a given function…
Let $A$ and $B$ be two connected graded algebras finitely generated in degree one. If $A$ is isomorphic to $B$ as ungraded algebras, then they are also isomorphic to each other as graded algebras.
A zero-one language L is a regular language whose asymptotic probability converges to either zero or one. In this case, we say that L obeys the zero-one law. We prove that a regular language obeys the zero-one law if and only if its…
We formulate a theory of shape valid for objects of arbitrary dimension whose contours are path connected. We apply this theory to the design and modeling of viable trajectories of complex dynamical systems. Infinite families of…
The logical depth of a graph $G$ is the minimum quantifier depth of a first order sentence defining $G$ up to isomorphism in the language of the adjacency and the equality relations. We consider the case that $G$ is a dissection of a convex…
When does a graph admit a tree-decomposition in which every bag has small diameter? For finite graphs, this is a property of interest in algorithmic graph theory, where it is called having bounded ``tree-length''. We will show that this is…
We define an easily verifiable notion of an atomic formula having uniformly bounded arrays in a structure $M$. We prove that if $T$ is a complete $L$-theory, then $T$ is mutually algebraic if and only if there is some model $M$ of $T$ for…
Without assuming the field structure on the additive group of real numbers $\mathbb{R}$ with the usual order $<,$ we explore the fact that every proper subgroup of $\mathbb{R}$ is either closed or dense. This property of subgroups of the…
We say that a metric graph is uniformly bounded if the degrees of all vertices are uniformly bounded and the lengths of edges are pinched between two positive constants; a metric space is approximable by a uniform graph if there is one…
First-order Goedel logics are a family of infinite-valued logics where the sets of truth values V are closed subsets of [0, 1] containing both 0 and 1. Different such sets V in general determine different Goedel logics G_V (sets of those…
Formality is a topological property, defined in terms of Sullivan's model for a space. In the simply-connected setting, a space is formal if its rational homotopy type is determined by the rational cohomology ring. In the general setting,…
Let U be a smooth quasi-projective variety over a field k that is finite, the algebraic closure of a finite field or algebraically closed of characteristic 0. Let X be a suitable projective compactification of U, and D an effective divisor…