相关论文: A Geometric Zero-One Law

We say a structure $M$ in a first-order language is indivisible if for every coloring of its universe in two colors, there is a monochromatic substructure $M'$ of $M$ such that $M'$ is isomorphic to $M$. Additionally, we say that $M$ is…

The Fibonacci cube $\Gamma_n$ is is the graph whose vertices are independent subsets of the path graph of length $n$, where two such vertices are considered adjacent if they differ by the addition or removal of a single element. Klav\v{z}ar…

The question of whether or not any zero torsion linear map on a non abelian real Lie algebra g is necessarily an extension of some CR-structure is considered and answered in the negative. Two examples are provided, one in the negative and…

A topological group $X$ is called connected if the only subsets which are both open and closed are the whole space $X$ and the null set $\emptyset$. A subset of a topological group is connected if the subspace is connected. We say that a…

Let $G$ be a connected undirected graph on $n$ vertices with no loops but possibly multiedges. Given an arithmetical structure $(\textbf{r}, \textbf{d})$ on $G$, we describe a construction which associates to it a graph $G'$ on $n-1$…

A relational structure ${\mathbb X}$ is said to be reversible iff every bijective endomorphism $f:X\rightarrow X$ is an automorphism. We define a sequence of non-zero cardinals $\langle \kappa_i :i\in I\rangle$ to be reversible iff each…

Call a graph $G$ zero-forcing for a finite abelian group $\mathcal{G}$ if for every $\ell : V(G) \to \mathcal{G}$ there is a connected $A \subseteq V(G)$ with $\sum_{a \in A} \ell(a) = 0$. The problem we pose here is to characterise the…

We investigate the relationship between axiomatic set theory and the first-order theory of homeomorphism groups of manifolds in the language of group theory, concentrating on first-order rigidity and type versus conjugacy. We prove that…

We prove that there is a first-order sentence in the language of rings that is true for all finitely generated fields of characteristic 0 and false for all fields of characteristic >0. We also prove that for each n in N, there is a…

We prove several results of the following type: given finite dimensional normed space V there exists another space X with log (dim X) = O(log (dim V)) and such that every subspace (or quotient) of X, whose dimension is not "too small,"…

We construct a family of $(2,n)$-almost Grassmannian structures of regularity $C^1$, each admitting a one-parameter group of strongly essential automorphisms, and each not flat on any neighborhood of the higher-order fixed point. This shows…

We give a sufficient condition on totally disconnected topological graphs such that their associated topological graph algebras are purely infinite.

Linear structural equation models are multivariate statistical models encoded by mixed graphs. In particular, the set of covariance matrices for distributions belonging to a linear structural equation model for a fixed mixed graph $G=(V,…

Let A be a connected graded algebra and let E denote its Ext-algebra. There is a natural A-infinity algebra structure on E, and we prove that this structure is mainly determined by the relations of A. In particular, the coefficients of the…

Given a graph $G$, an arithmetical structure on $G$ is a pair of positive integer vectors $({\bf d},{\bf r})$ such that $\mathrm{gcd}({\bf r}_v\, | \,v\in V(G))=1$ and \[ (\mathrm{diag}({\bf d})-A){\bf r}=0, \] where $A$ is the adjacency…

A simple Almost-Riemannian Structure on a Lie group G is defined by a linear vector field (that is an infinitesimal automorphism) and dim(G) -- 1 left-invariant ones. It is first proven that two different ARSs are isometric if and only if…

A relational structure is a core, if all its endomorphisms are embeddings. This notion is important for computational complexity classification of constraint satisfaction problems. It is a fundamental fact that every finite structure has a…

We study links between first-order formulas and arbitrary properties for families of theories, classes of structures and their isomorphism types. Possibilities for ranks and degrees for formulas and theories with respect to given properties…

For many standard models of random structure, first-order logic sentences exhibit a convergence phenomenon on random inputs. The most well-known example is for random graphs with constant edge probability, where the probabilities of…

Working with uncountable structures of fixed cardinality, we investigate the complexity of certain equivalence relations and show that if V = L, then many of them are \Sigma^1_1-complete, in particular the isomorphism relation of dense…