Related papers: Closed graph theorems for bornological spaces
There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable minor-closed class, such as the class of all planar graphs. Here we use combinatorial and probabilistic methods to investigate a…
For any type of fundamental groupoid scheme, we construct an algebraic cohomology theory for varieties with coefficients in the base field. This is a minor variant of \'etale cohomology, involving neither de Rham complexes nor…
Theoretical results from discrete geometry suggest that normed spaces can abstractly embed finite metric spaces with surprisingly low theoretical bounds on distortion in low dimensions. In this paper, inspired by this theoretical insight,…
Answering a question of Diestel, we develop a topological notion of gammoids in infinite graphs which, unlike traditional infinite gammoids, always define a matroid. As our main tool, we prove for any infinite graph $G$ with vertex sets $A$…
In 2001, Davies, Gladwell, Leydold, and Stadler proved discrete nodal domain theorems for eigenfunctions of generalized Laplacians, i.e., symmetric matrices with non-positive off-diagonal entries. In this paper, we establish nodal domain…
In this paper, local monomialization theorems are proven for analytic morphisms of complex and real analytic spaces. This gives the generalization of the local monomialization theorem for morphisms of algebraic varieties over a field of…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
Boundary analysis is developed for a rich class of generally infinite weighted graphs with compact metric completions. These graph completions have totally disconnected boundaries. The classical notion of $\epsilon$-components and the…
In this note, we derive a uniqueness theorem for minimal graphs of general codimension under certain restrictions closed related to the convexity (not strict convexity) of the area functional with respect to singular values, improving the…
We generalize the structure theorem of Robertson and Seymour for graphs excluding a fixed graph $H$ as a minor to graphs excluding $H$ as a topological subgraph. We prove that for a fixed $H$, every graph excluding $H$ as a topological…
For a finitely-generated vertex operator algebra of central charge c, a locally convex topological completion is constructed. We construct on the completion a structure of an algebra over the operad of the c/2-th power of the determinant…
We introduce and investigate generalizations of interval and proper interval graphs to simplicial complexes, including strong interval, unit interval, and under closed variants. Through equivalent combinatorial and algebraic…
Internal preneighbourhood spaces inside any finitely complete category with finite coproducts and proper factorisation structure were first introduced in my earlier paper. This paper proposes a closure operation on internal preneighbourhood…
We consider infinite connected quasi-transitive locally finite graphs and show that every such graph with more than one end is a tree amalgamation of two other such graphs. This can be seen as a graph-theoretical version of Stallings'…
In this paper we study the Grassmannian of submodules of a given dimension inside a finitely generated projective module $P$ for a finite dimensional algebra $\Lambda$ over an algebraically closed field. The orbit of such a submodule $C$…
Let $\mathbf{K}$ be an algebraically closed field of arbitrary characteristic, complete with respect to a non-archimedean absolute value $|\,|$. We establish a Second Main Theorem type estimate for analytic map $f\colon…
These lecture notes are a personal introduction to signed graphs, concentrating on the aspects that have been most persistently interesting to me. They are just a few corners of signed graph theory; I am leaving out a great deal. The…
A drawing in the plane ($\mathbb{R}^2$) of a graph $G=(V,E)$ equipped with a function $\gamma: V \rightarrow \mathbb{N}$ is \emph{$x$-bounded} if (i) $x(u) <x(v)$ whenever $\gamma(u)<\gamma(v)$ and (ii) $\gamma(u)\leq\gamma(w)\leq…
We study completions of Archimedean vector lattices relative to any nonempty set of positively-homogeneous functions on finite-dimensional real vector spaces. Examples of such completions include square mean closed and geometric closed…
The (variational) graph auto-encoder and its variants have been popularly used for representation learning on graph-structured data. While the encoder is often a powerful graph convolutional network, the decoder reconstructs the graph…