相关论文: Infinitely many reducts of homogeneous structures

In this paper we classify some special reducts of the countable atomless Boolean algebra which we call functional reducts. We prove that there are exactly $13$ such structures up to first order interdefinability.

Let (L;C) be the (up to isomorphism unique) countable homogeneous structure carrying a binary branching C-relation. We study the reducts of (L;C), i.e., the structures with domain L that are first-order definable in (L;C). We show that up…

The paper describes the algebraic structure of the graded algebra of differentially homogeneous polynomials of fixed finite order. We show that it is a finitely generated algebra, and we exhibit a minimal set of generators. Along the way,…

Let $\mathbb{F}_2^\omega$ denote the countably infinite dimensional vector space over the two element field and $\operatorname{GL}(\omega, 2)$ its automorphism group. Moreover, let $\operatorname{Sym}(\mathbb{F}_2^\omega)$ denote the…

Below, by space we mean a separable metrizable zero-dimensional space. It is studied when the space can be embedded in a Cantor set while maintaining the algebraic structure. Main results of the work: every space is an open retract of a…

One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the…

In this paper we count the number of isomorphism classes of geometrically indecomposable quasi-parabolic structures of a given type on a given vector bundle on the projective line over a finite field. We give a conjectural cohomological…

Given a real closed field $R$, we identify exactly four proper reducts of $R$ which expand the underlying (unordered) $R$-vector space structure. Towards this theorem we introduce a new notion, of strongly bounded reducts of linearly…

Consider the smooth sections of the tangent bundle of a reductive homogeneous space. This is a vector space over the field of real numbers. The canonical connection acts as a linear binary operator on this vector space, making it an…

A partial order is called semilinear iff the upper bounds of each element are linearly ordered and any two elements have a common upper bound. There exists, up to isomorphism, a unique countable existentially closed semilinear order, which…

We initiate the study of reducts of relational structures up to primitive positive interdefinability: After providing the tools for such a study, we apply these tools in order to obtain a classification of the reducts of the logic of…

The state space of a homogeneous body is derived under two different assumptions: infinitesimal reducibility and irreducibility. The first assumption leads to a real vector space, used in classical mechanics, while the second one leads to a…

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

We show that the embeddability relations for countable quandles and for countable fields of any given characteristic other than 2 are maximally complex in a strong sense: they are invariantly universal. This notion from the theory of Borel…

A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…

The random ordered graph is the up to isomorphism unique countable homogeneous linearly ordered graph that embeds all finite linearly ordered graphs. We determine the reducts of the random ordered graph up to first-order interdefinability.

We describe derivations of the Clifford algebra of a nondegenerate quadratic form on a countable dimensional vector space over an algebraically closed field of characteristic not equal to $2$. We also construct an algebraic automorphism of…

We classify the homogeneous finite-dimensional permutation structures, i.e., homogeneous structures in a language of finitely many linear orders, giving a nearly complete answer to a question of Cameron, and confirming the classification…

We generalize the lexicographic product of first-order structures by presenting a framework for constructions which, in a sense, mimic iterating the lexicographic product infinitely and not necessarily countably many times. We then define…

We show that every infinite crowded space can be mapped onto a homogeneous space of countable weight, and that there is a homogeneous space of weight continuum that cannot be mapped onto a homogeneous space of uncountable weight strictly…