Related papers: Periodic Euclidean Graphs on Integer Points
This paper introduces a geometric representation of hypergraphs by representing hyperedges as simplices. Building on this framework, we employ homotopy groups to analyze the topological structure of hypergraphs embedded in high-dimensional…
We introduce a new class of countably infinite random geometric graphs, whose vertices are points in a metric space, and vertices are adjacent independently with probability p if the metric distance between the vertices is below a given…
The Erd\H{o}s, Gr\"unwald, and Weiszfeld theorem is a characterization of those infinite graphs which are Eulerian. That is, infinite graphs that admit infinite Eulerian paths. In this article we prove an effective version of the Erd\H{o}s,…
We prove that a graph has an infinitesimally rigid placement in a non-Euclidean normed plane if and only if it contains a $(2,2)$-tight spanning subgraph. The method uses an inductive construction based on generalised Henneberg moves and…
Crystallographic tilings of the Euclidean space $\mathbb{E}^n$ are defined as simple tilings whose group of isometric automorphisms is crystallographic. To classify crystallographic tilings by their automorphism groups it is necessary to…
For any positive definite rational quadratic form $q$ of $n$ variables let $G(\mathbb{Q}^n, q)$ denote the graph with vertices $\mathbb{Q}^n$ and $x, y \in \mathbb{Q}^n$ connected iff $q(x - y) = 1$. This notion generalises standard…
The rigidity of the Positive Mass Theorem states that the only complete asymptotically flat manifold of nonnegative scalar curvature and zero mass is Euclidean space. We study the stability of this statement for spaces that can be realized…
A k-uniform hypergraph is algebraic if its vertex set is n-dimensional Euclidean space, for some n, and its hyperedge set is defined from the zero set of some polynomial. The chromatic numbers of all algebraic hypergraphs are determined,…
An undirected graph is Eulerian if it is connected and all its vertices are of even degree. Similarly, a directed graph is Eulerian, if for each vertex its in-degree is equal to its out-degree. It is well known that Eulerian graphs can be…
A book embedding of a complete graph is a spatial embedding whose planar projection has the vertices located along a circle, consecutive vertices are connected by arcs of the circle, and the projections of the remaining "interior" edges in…
A multigraph is a nonsimple graph which is permitted to have multiple edges, that is, edges that have the same end nodes. We introduce the concept of spanning simplicial complexes $\Delta_s(\mathcal{G})$ of multigraphs $\mathcal{G}$, which…
Euclidean outer billiard on a regular polygon (that is not a triangle, square or a hexagon) has aperiodic points, i.e., points where all iterates of the outer billiard map are defined and yield pairwise distinct images. This result answers…
The nearest point map of a real algebraic variety with respect to Euclidean distance is an algebraic function. For instance, for varieties of low rank matrices, the Eckart-Young Theorem states that this map is given by the singular value…
Metric graphs are special types of metric spaces used to model and represent simple, ubiquitous, geometric relations in data such as biological networks, social networks, and road networks. We are interested in giving a qualitative…
We study unit ball graphs (and, more generally, so-called noisy uniform ball graphs) in $d$-dimensional hyperbolic space, which we denote by $\mathbb{H}^d$. Using a new separator theorem, we show that unit ball graphs in $\mathbb{H}^d$…
Exploiting symmetries and invariance in data is a powerful, yet not fully exploited, way to achieve better generalisation with more efficiency. In this paper, we introduce two graph network architectures that are equivariant to several…
M. Kruskal showed that each continuous-time nearly-periodic dynamical system admits a formal $U(1)$ symmetry, generated by the so-called roto-rate. When the nearly-periodic system is also Hamiltonian, Noether's theorem implies the existence…
Graph rigidity theory studies the capability of a graph embedded in the Euclidean space to constrain its global geometric shape via local constraints among nodes and edges, and has been widely exploited in network localization and formation…
A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three decades ago, an elegant polynomial-time algorithm was found for \textsc{Maximum Clique} on unit disk graphs [Clark, Colbourn, Johnson; Discrete…
A triangulated piecewise-linear minimal surface in Euclidean 3-space defined using a variational characterization is critical for area amongst all continuous piecewise-linear variations with compact support that preserve the simplicial…