Related papers: The classification of homomorphism homogeneous ori…
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…
A large driver of the complexity of graph learning is the interplay between structure and features. When analyzing the expressivity of graph neural networks, however, existing approaches ignore features in favor of structure, making it…
Two graphs are homomorphism indistinguishable over a graph class $\mathcal{F}$, denoted by $G \equiv_{\mathcal{F}} H$, if $\operatorname{hom}(F,G) = \operatorname{hom}(F,H)$ for all $F \in \mathcal{F}$ where $\operatorname{hom}(F,G)$…
We introduce the concept of a homogeneity supermanifold, which is, roughly speaking, a supermanifold equipped with a privileged atlas whose coordinates carry prescribed (real) homogeneity degrees. This structure defines a sheaf of graded…
We develop category-theoretic framework for universal homogeneous objects, with some applications in the theory of Banach spaces, linear orderings, and in topology of compact spaces.
Persistent homology is a mathematical tool used for studying the shape of data by extracting its topological features. It has gained popularity in network science due to its applicability in various network mining problems, including…
In this paper, all graphs are assumed to be finite. For $s\geq 1$ and a graph $\G$, if for every pair of isomorphic connected induced subgraphs on at most $s$ vertices there exists an automorphism of $\G$ mapping the first to the second,…
The paper is the survey of the modern results and applications of the theory of homotopes. The notion of a well-tempered element in an associative algebra is introduced and it is proven that the category of representations of the homotope…
This is a research monograph on constructions of and group actions on countable homogeneous graphs, concentrating particularly on the simple random graph and its edge-coloured variants. We study various aspects of the graphs, but the…
This article highlights historical achievements in the partition theory of countable homogeneous relational structures, and presents recent work, current trends, and open problems. Exciting recent developments include new methods involving…
Counting homomorphisms from a graph $H$ into another graph $G$ is a fundamental problem of (parameterized) counting complexity theory. In this work, we study the case where \emph{both} graphs $H$ and $G$ stem from given classes of graphs:…
A few steps are made towards representation theory of embeddability among uncountable graphs. A monotone class of graphs is defined by forbidding countable subgraphs, related to the graph's end-structure. Using a combinatorial theorem of…
This thesis investigates the central role of homomorphism problems (structure-preserving maps) in two complementary domains: database querying over finite, graph-shaped data, and constraint solving over (potentially infinite) structures.…
We call a bipartite graph {\it homogeneous} if every finite partial automorphism which respects left and right can be extended to a total automorphism. A $(\kappa,{\lambda} )$ bipartite graph is a bipartite graph with left side of size…
We introduce the notion of echeloned spaces - an order-theoretic abstraction of metric spaces. The first step is to characterize metrizable echeloned spaces. It turns out that morphisms between metrizable echeloned spaces are uniformly…
In Chapter 1 we fully characterise pairs of finite graphs which form a gap in the full homomorphism order. This leads to a simple proof of the existence of generalised duality pairs. We also discuss how such results can be carried to…
Given a Lie group acting on a manifold $M$ preserving a closed $n+1$-form $\omega$, the notion of homotopy moment map for this action was introduced in Callies-Fregier-Rogers-Zambon [6], in terms of $L_{\infty}$-algebra morphisms. In this…
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 develop the theory of homogeneous Polish ultrametric structures. Our starting point is a Fraisse class of finite structures and the crucial tool is the universal homogeneous epimorphism. The new Fraisse limit is an inverse limit,…
We examine ordered graphs, defined as graphs with linearly ordered vertices, from the perspective of homomorphisms (and colorings) and their complexities. We demonstrate the corresponding computational and parameterized complexities, along…