Related papers: The classification of homogeneous finite-dimension…

Homogenization is a powerful way of taming a class of finite structures with several interesting applications in different areas, from Ramsey theory in combinatorics to constraint satisfaction problems (CSPs) in computer science, through…

We prove the invariance of homogeneous second-order Hamiltonian operators under the action of projective reciprocal transformations. We establish a correspondence between such operators in dimension $n$ and $3$-forms in dimension $n + 1$.…

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 give a classification of homogeneous Riemannian structures on (non locally symmetric) $3$-dimensional Lie groups equipped with left invariant Riemannian metrics. This work together with classifications due to previous works yields a…

In this paper, we investigate the connection between infinite permutation monoids and bimorphism monoids of first-order structures. Taking our lead from the study of automorphism groups of structures as infinite permutation groups and the…

A structure is called homogeneous if every isomorphism between finitely induced substructures of the structure extends to an automorphism of the structure. Recently, P. J. Cameron and J. Ne\v{s}et\v{r}il introduced a relaxed version of…

An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.

The class of the hypercomplex pseudo-Hermitian manifolds is considered. The flatness of the considered manifolds with the 3 parallel complex structures is proved. Conformal transformations of the metrics are introduced. The conformal…

We classify the metric spaces that can be approximated by finite homogeneous ones.

It is known that a countable $\omega$-categorical structure interprets all finite structures primitively positively if and only if its polymorphism clone maps to the clone of projections on a two-element set via a continuous clone…

Predicate logic is the premier choice for specifying classes of relational structures. Homomorphisms are key to describing correspondences between relational structures. Questions concerning the interdependencies between these two means of…

Using a categorial version of Fra\"iss\'e's theorem due to Droste and G\"obel, we derive a criterion for a comma-category to have universal homogeneous objects. As a first application we give new existence result for universal structures…

We classify homotopes of classical symmetric spaces (studied in Part I of this work). Our classification uses the fibered structure of homotopes: they are fibered as symmetric spaces, with flat fibers, over a non-degenerate base; the base…

We consider the derived category of permutation modules for a finite group, in positive characteristic. We stratify this tensor triangulated category using Brauer quotients. We describe the spectrum of its compact objects, by reducing the…

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…

We address the problem of characterizing $H$-coloring problems that are first-order definable on a fixed class of relational structures. In this context, we give several characterizations of a homomorphism dualities arising in a class of…

We study isoparametric submanifolds of rank at least two in a separable Hilbert space, which are known to be homogeneous by a result of Heintze and Liu, and associate to such a submanifold M and a point x in M a canonical homogeneous…

We classify compact 2-connected homogeneous spaces with the same rational cohomology as a product of spheres. This classification relies on spectral sequences, homotopy theory, and representation theory. We then apply this classification to…

The main result of this paper is a probabilistic construction of finite rigid structures. It yields a finitely axiomatizable class of finite rigid structures where no L^omega_{infty, omega} formula with counting quantifiers defines a linear…

An infinite permutation is a linear ordering of the set of non-negative integers. Generally, the properties of infinite permutations analogous to those of infinite words show some resemblances and some differences between permutations and…