Related papers: An Improved Homomorphism Preservation Theorem From…
Let $v(F)$ denote the number of vertices in a fixed connected pattern graph $F$. We show an infinite family of patterns $F$ such that the existence of a subgraph isomorphic to $F$ is expressible by a first-order sentence of quantifier depth…
In this paper, we introduce a family of topological spaces that captures the existence of preservation theorems. The structure of those spaces allows us to study the relativisation of preservation theorems under suitable definitions of…
Automatic structures are first-order structures whose universe and relations can be represented as regular languages. It follows from the standard closure properties of regular languages that the first-order theory of an automatic structure…
We prove that an $\omega$-categorical core structure primitively positively interprets all finite structures with parameters if and only if some stabilizer of its polymorphism clone has a homomorphism to the clone of projections, and that…
We prove that if $G$ and $H$ are primitive strongly regular graphs with the same parameters and $\varphi$ is a homomorphism from $G$ to $H$, then $\varphi$ is either an isomorphism or a coloring (homomorphism to a complete subgraph).…
A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to…
Sound behavioral equations on open terms may become unsound after conservative extensions of the underlying operational semantics. Providing criteria under which such equations are preserved is extremely useful; in particular, it can avoid…
This note recalls the representation of regular theories T in terms of set-valued functors on models given by Makkai(1990), and explicitly states the representation theorem for the classifying topos Set[T] in terms of filtered colimit…
Constraint Satisfaction Problem (CSP) is a fundamental algorithmic problem that appears in many areas of Computer Science. It can be equivalently stated as computing a homomorphism $\mbox{$\bR \rightarrow \bGamma$}$ between two relational…
We study the problem of existence and uniqueness of homotopy colimits in stable representation theory, where one typically does not have model category structures to guarantee that these homotopy colimits exist or have good properties. We…
The Svenonius theorem describes the (first-order) definability in a structure in terms of permutations preserving the relations of elementary extensions of the structure. In the present paper we prove a version of this theorem using…
The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…
This paper concerns rigidity of the mapping class groups. We show that any homomorphism $\phi:{\rm Mod}_g\to {\rm Mod}_h$ between mapping class groups of closed orientable surfaces with distinct genera $g>h$ is trivial if $g\geq 3$ and has…
Given a graph whose nodes may be coloured red, the parity of the number of red nodes can easily be maintained with first-order update rules in the dynamic complexity framework DynFO of Patnaik and Immerman. Can this be generalised to other…
We introduce a technique for proving quantitative representation stability theorems for sequences of representations of certain finite linear groups over a field of characteristic zero. In particular, we prove a vanishing result for higher…
Harmonic morphisms, maps which preserve Laplace's equation, are intimately connected to the topic of minimal submanifolds. In this article we first characterise harmonic morphisms between Riemannian manifolds as the weakly horizontally…
For a fixed graph $H$, the reconfiguration problem for $H$-colourings (i.e. homomorphisms to $H$) asks: given a graph $G$ and two $H$-colourings $\varphi$ and $\psi$ of $G$, does there exist a sequence $f_0,\dots,f_m$ of $H$-colourings such…
We study the problem of counting the number of homomorphisms from an input graph $G$ to a fixed (quantum) graph $\bar{H}$ in any finite field of prime order $\mathbb{Z}_p$. The subproblem with graph $H$ was introduced by Faben and Jerrum…
The interplay of minimum degree conditions and structural properties of large graphs with forbidden subgraphs is a central topic in extremal graph theory. For a given graph $F$ we define the homomorphism threshold as the infimum over all…
A homomorphism from a graph $G$ to a graph $H$ is an edge-preserving mapping from $V(G)$ to $V(H)$. In the graph homomorphism problem, denoted by $Hom(H)$, the graph $H$ is fixed and we need to determine if there exists a homomorphism from…