Related papers: Height estimates for Killing graphs
We study global flat embeddings inside and outside of event horizons of black holes such as Schwarzschild and Reissner-Nordstr\"{o}m black holes, and of de Sitter space. On these overall patches of the curved manifolds we investigate four…
Weight thresholding is a simple technique that aims at reducing the number of edges in weighted networks that are otherwise too dense for the application of standard graph theoretical methods. We show that the group structure of real…
Complex systems, ranging from soft materials to wireless communication, are often organised as random geometric networks in which nodes and edges evenly fill up the volume of some space. Studying such networks is difficult because they…
Killing horizons which can be such for two or more linearly independent Killing vectors are studied. We provide a rigorous definition and then show that the set of Killing vectors sharing a Killing horizon is a Lie algebra…
A proper total weighting of a graph $G$ is a mapping $\phi$ which assigns to each vertex and each edge of $G$ a real number as its weight so that for any edge $uv$ of $G$, $\sum_{e \in E(v)}\phi(e)+\phi(v) \ne \sum_{e \in…
Tree-width is an invaluable tool for computational problems on graphs. But often one would like to compute on other kinds of objects (e.g. decorated graphs or even algebraic structures) where there is no known tree-width analogue. Here we…
Marginal polytopes are important geometric objects that arise in statistics as the polytopes underlying hierarchical log-linear models. These polytopes can be used to answer geometric questions about these models, such as determining the…
A set of vertices $S$ \emph{resolves} a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of a graph $G$ is the minimum cardinality of a resolving set. In this…
In this paper, we describe primary decomposition of the edge ideal of the join of some graphs in terms of that information of the edge ideal of every weighted oriented graph. Meanwhile, we also study depth and regularity of symbolic powers…
Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…
A geometric graph is a combinatorial graph, endowed with a geometry that is inherited from its embedding in a Euclidean space. Formulation of a meaningful measure of (dis-)similarity in both the combinatorial and geometric structures of two…
We study weighted edge coloring of graphs, where we are given an undirected edge-weighted general multi-graph $G := (V, E)$ with weights $w : E \rightarrow [0, 1]$. The goal is to find a proper weighted coloring of the edges with as few…
We prove that the intrinsic geometry of compact cross-sections of any vacuum extremal horizon must admit a Killing vector field. If the cross-sections are two-dimensional spheres, this implies that the most general solution is the extremal…
In this paper we consider the problem of reconstructing a hidden weighted hypergraph of constant rank using additive queries. We prove the following: Let $G$ be a weighted hidden hypergraph of constant rank with n vertices and $m$…
As the popularity of graph data increases, there is a growing need to count the occurrences of subgraph patterns of interest, for a variety of applications. Many graphs are massive in scale and also fully dynamic (with insertions and…
We provide a general method for studying manifestly $O(n+1)$ covariant formulation of $p$-form gauge theories by stereographically projecting these theories, defined in flat Euclidean space, onto the surface of a hypersphere. The gauge…
A matrix-weighted graph is an undirected graph with a $k\times k$ positive semidefinite matrix assigned to each edge. There are natural generalizations of the Laplacian and adjacency matrices for such graphs. These matrices can be used to…
Approximate Killing vector fields are expected to help define physically meaningful spins for non-symmetric black holes in general relativity. However, it is not obvious how such fields should be defined geometrically. This paper relates a…
Given the necessity of connecting the unconnected, covering blind spots has emerged as a critical task in the next-generation wireless communication network. A direct solution involves obtaining a coverage manifold that visually showcases…
Hypergraph width measures are a class of hypergraph invariants important in studying the complexity of constraint satisfaction problems (CSPs). We present a general exact exponential algorithm for a large variety of these measures. A…