Related papers: A Concise Proof of the $L_0$ Dichotomy
Let $X$ be a locally compact Hausdorff space, let $A$ be a partially ordered algebra, and let $\pi\colon \mathrm{C}_{\mathrm c}(X)\to A$ be a positive algebra homomorphism. Under conditions on $A$ that are satisfied in a good number of…
The universal homogeneous triangle-free graph, constructed by Henson and denoted $\mathcal{H}_3$, is the triangle-free analogue of the Rado graph. While the Ramsey theory of the Rado graph has been completely established, beginning with…
We show that the continuum hypothesis implies there exists a Lindelof space X such that X x X is the union of two metrizable subspaces but X is not metrizable. This gives a consistent solution to a problem of Balogh, Gruenhage, and Tkachuk.…
The task of computing homomorphisms between two finite relational structures $\mathcal{A}$ and $\mathcal{B}$ is a well-studied question with numerous applications. Since the set $\operatorname{Hom}(\mathcal{A},\mathcal{B})$ of all…
In this note we study graphs $G_r$ with the property that every colouring of $E(G_r)$ with $r+1$ colours admits a copy of some graph $H$ using at most $r$ colours. For $1\le r\le e(H)$ such graphs occur naturally at intermediate steps in…
We give a survey of basic results on the cut norm and cut metric for graphons (and sometimes more general kernels), with emphasis on the equivalence problem. The main results are not new, but we add various technical complements, and a new…
This work derives an upper bound on the maximum cardinality of a family of graphs on a fixed number of vertices, in which the intersection of every two graphs in that family contains a subgraph that is isomorphic to a specified graph H.…
An $L(h_1, h_2, \ldots, h_l)$-labelling of a graph $G$ is a mapping $\phi: V(G) \rightarrow \{0, 1, 2, \ldots\}$ such that for $1\le i\le l$ and each pair of vertices $u, v$ of $G$ at distance $i$, we have $|\phi(u) - \phi(v)| \geq h_i$.…
We consider the complexity of counting homomorphisms from an $r$-uniform hypergraph $G$ to a symmetric $r$-ary relation $H$. We give a dichotomy theorem for $r>2$, showing for which $H$ this problem is in FP and for which $H$ it is…
The well-known Galvin-Prikry Theorem states that Borel subsets of the Baire space are Ramsey: Given any Borel subset $\mathcal{X}\subseteq [\omega]^{\omega}$, where $[\omega]^{\omega}$ is endowed with the metric topology, each infinite…
A \emph{signed graph} $(G, \sigma)$ is a graph $G$ together with an assignment $\sigma:E(G) \rightarrow \{+,-\}$. The notion of homomorphisms of signed graphs is a relatively new development which allows to strengthen the connection between…
The number of homomorphisms from a finite graph $F$ to the complete graph $K_n$ is the evaluation of the chromatic polynomial of $F$ at $n$. Suitably scaled, this is the Tutte polynomial evaluation $T(F;1-n,0)$ and an invariant of the cycle…
We give a cohomological criterion for certain decomposition of Borel graphs, which is an analog of Dunwoody's work on accessibility of groups. As an application, we prove that a Borel graph $(X,G)$ with uniformly bounded degrees of…
The Parameter Continuation Theorem is the theoretical foundation for polynomial homotopy continuation, which is one of the main tools in computational algebraic geometry. In this note, we give a short proof using Gr\"obner bases. Our…
We extend the notion of graph homomorphism to cellularly embedded graphs (maps) by designing operations on vertices and edges that respect the surface topology; we thus obtain the first definition of map homomorphism that preserves both the…
Leighton's graph covering theorem says that two finite graphs with a common cover have a common finite cover. We present a new proof of this using groupoids, and use this as a model to prove two generalisations of the theorem. The first…
Feder-Vardi conjecture, which proposed that every finite-domain Constraint Satisfaction Problem (CSP) is either in P or it is NP-complete, has been solved independently by Bulatov and Zhuk almost ten years ago. Bodirsky-Pinsker conjecture…
We prove an $L^2$ theorem on generically surjective morphism of holomorphic vector bundles via a degeneration argument, generalizing the author's previous work on the $L^2$ division theorem of Skoda. The proof is based on Berndtsson's…
In this paper, inspired by the elegant work of Good and Meddaugh \cite{GM} and the graph models for zero-dimensional systems developed by several authors, like Gambaudo and Martens \cite{GM06}, Shimomura \cite{Sh14}. We try to discover a…
The {\em distinguishing number} of a group $G$ acting faithfully on a set $V$ is the least number of colors needed to color the elements of $V$ so that no non-identity element of the group preserves the coloring. The {\em distinguishing…