中文
相关论文

相关论文: A Geometric Zero-One Law

200 篇论文

A general model for geometric structures on differentiable manifolds is obtained by deforming infinitesimal symmetries. Specifically, this model consists of a Lie algebroid, equipped with an affine connection compatible with the Lie…

微分几何 · 数学 2012-03-07 Anthony D. Blaom

Let $X=(V\!X,E\!X)$ be an infinite, locally finite, connected graph without loops or multiple edges. We consider the edges to be oriented, and $E\!X$ is equipped with an involution which inverts the orientation. Each oriented edge is…

组合数学 · 数学 2019-03-07 Christian Lindorfer , Wolfgang Woess

For any fixed integer $R \geq 2$ we characterise the typical structure of undirected graphs with vertices $1, ..., n$ and maximum degree $R$, as $n$ tends to infinity. The information is used to prove that such graphs satisfy a labelled…

组合数学 · 数学 2012-12-18 Vera Koponen

In this paper the limit probabilities of first-order properties are studied. The random graph $G(n,p)$ {\it obeys Zero-One $k$-Law} if for each first-order property with quantifier depth not greater than $k$ its probability tends to 0 or…

概率论 · 数学 2016-02-02 Aleksandr Matushkin

For every proper geodesic space $X$ we introduce its quasi-geometric boundary $\partial_{QG}X$ with the following properties: 1. Every geodesic ray $g$ in $X$ converges to a point of the boundary $\partial_{QG}X$ and for every point $p$ in…

度量几何 · 数学 2022-09-13 Jerzy Dydak , Hussain Rashed

For an $n\times n$ random image with independent pixels, black with probability $p(n)$ and white with probability $1-p(n)$, the probability of satisfying any given first-order sentence tends to 0 or 1, provided both $p(n)n^{\frac{2}{k}}$…

概率论 · 数学 2016-08-16 David Coupier , Agnès Desolneux , Bernard Ycart

Let V be a variety of not necessarily associative algebras, and A an inverse limit of nilpotent algebras A_i\in V, such that some finitely generated subalgebra S \subseteq A is dense in A under the inverse limit of the discrete topologies…

环与代数 · 数学 2021-10-15 George M. Bergman

Let $\mathcal G$ denote the space of finitely generated marked groups. We give equivalent characterizations of closed subspaces $\mathcal S\subseteq \mathcal G$ satisfying the following zero-one law: for any sentence $\sigma$ in the…

群论 · 数学 2022-09-27 D. Osin

One measure of the complexity of a first-order theory, and similarly a type, is the complexity of the formulas required to axiomatize it. We say a theory is bounded if there is an axiomatization involving only $\forall_n$-formulas for some…

逻辑 · 数学 2026-04-29 Hongyu Zhu

The unit distance graph $G_{\mathbb{R}^d}^1$ is the infinite graph whose nodes are points in $\mathbb{R}^d$, with an edge between two points if the Euclidean distance between these points is 1. The 2-dimensional version $G_{\mathbb{R}^2}^1$…

组合数学 · 数学 2022-02-14 Remie Janssen , Leonie van Steijn

We prove that every sofic approximation of a property (T) group is approximately isomorphic to one having geometric property (T), and more generally, a box space of graphs which has boundary geometric property (T) is approximately…

群论 · 数学 2025-11-21 Vadim Alekseev , Stefan Drigalla

A generalisation of Riemannian geometry is considered, based exclusively on the minimal assumptions that the line element $ds$ is a regular function of position and direction and that the distance of every point from itself is equal to…

综合物理 · 物理学 2018-04-03 Paolo Maraner

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…

代数几何 · 数学 2008-08-20 E. Daniyarova , A. Myasnikov , V. Remeslennikov

It has been shown in the late 1960s that each formula of first-order logic without constants and function symbols obeys a zero-one law: As the number of elements of finite models increases, every formula holds either in almost all or in…

计算机科学中的逻辑 · 计算机科学 2021-05-26 Rineke Verbrugge

A connected subgraph of a graph is isometric if it preserves distances. In this short note, we provide counterexamples to several variants of the following general question: When a graph $G$ is edge covered by connected isometric subgraphs…

组合数学 · 数学 2025-11-06 Paul Bastide , Julien Duron , Jędrzej Hodor , Weichan Liu , Xiangxiang Nie

Let G_n be the random graph on [n]= {1, ...,n} with the possible edge {i,j} having probability being p_{|i-j|}= 1/|i-j|^alpha, alpha in (0,1) irrational. We prove that the zero one law (for first order logic) holds. The paper is continued…

逻辑 · 数学 2009-09-25 Saharon Shelah

One considers geometry with the intransitive equaivalence relation. Such a geometry is a physical geometry, i.e. it is described completely by the world function, which is a half of the squared distance function. The physical geometry…

综合数学 · 数学 2009-03-30 Yuri A. Rylov

We prove that if X is a complete geodesic metric space with uniformly generated first homology group and $f: X\to R$ is metrically proper on the connected components and bornologous, then X is quasi-isometric to a tree. Using this and…

几何拓扑 · 数学 2011-03-31 Álvaro Martínez-Pérez

In 2001, J.-M. Le Bars disproved the zero-one law (that says that every sentence from a certain logic is either true asymptotically almost surely (a.a.s.), or false a.a.s.) for existential monadic second order sentences (EMSO) about…

组合数学 · 数学 2018-12-03 Svetlana Popova , Maksim Zhukovskii

The paper is the last in the cycle devoted to the solution of Alexandrov's problem for non-positively curved spaces. Here we study non-positively curved spaces in the sense of Busemann. We prove that if $X$ is geodesically complete…

度量几何 · 数学 2008-05-13 P. D. Andreev