Related papers: Product Structure and Treewidth of Hyperbolic Unif…
The following theorem is proved: For all $k$-connected graphs $G$ and $H$ each with at least $n$ vertices, the treewidth of the cartesian product of $G$ and $H$ is at least $k(n -2k+2)-1$. For $n\gg k$ this lower bound is asymptotically…
We show that a relatively hyperbolic graph with uniformly hyperbolic peripheral subgraphs is hyperbolic. As an application, we show that the disc graph and the electrified disc graph of a handlebody H of genus g>1 are hyperbolic, and we…
We consider the methods by which higher-level and non-simply laced gauge symmetries can be realized in free-field heterotic string theory. We show that all such realizations have a common underlying feature, namely a dimensional truncation…
Suppose $G$ is a $k$-uniform hypergraph on $n$ vertices such that every $(k-1)$-subset $S$ of $V(G)$ belongs to at least $\delta n$ edges, where $\delta> 1/2$. Let $\Psi(G)$ denote the number of tight Hamilton cycles in $G$, that is, cyclic…
For an $n$-vertex graph $G$, let $h(G)$ denote the smallest size of a subset of $V(G)$ such that it intersects every maximum independent set of $G$. A conjecture posed by Bollob\'{a}s, Erd\H{o}s and Tuza in early 90s remains widely open,…
In this paper we present various lower bound results on collective tree spanners and on spanners of bounded treewidth. A graph $G$ is said to admit a system of $\mu$ collective additive tree $c$-spanners if there is a system $\cal{T}$$(G)$…
For every fixed graph $H$, it is known that homomorphism counts from $H$ and colorful $H$-subgraph counts can be determined in $O(n^{t+1})$ time on $n$-vertex input graphs $G$, where $t$ is the treewidth of $H$. On the other hand, a running…
Hyperbolic lattices underlie a new form of quantum matter with potential applications to quantum computing and simulation and which, to date, have been engineered artificially. A corresponding hyperbolic band theory has emerged, extending…
Recent research has shown that alignment between the structure of graph data and the geometry of an embedding space is crucial for learning high-quality representations of the data. The uniform geometry of Euclidean and hyperbolic spaces…
We present a non-perturbative model of Gauge-Higgs Unification. We consider a five-dimensional pure SU(2) gauge theory with orbifold boundary conditions along the fifth dimension, such that the symmetry is reduced to U(1) at the fixed…
We introduce $k$-robust clique complexes, a family of simplicial complexes that generalizes the traditional clique complex. Here, a subset of vertices forms a simplex provided it does not contain an independent set of size $k$. We…
An $r$-uniform hypergraph is a tight $r$-tree if its edges can be ordered so that every edge $e$ contains a vertex $v$ that does not belong to any preceding edge and the set $e-v$ lies in some preceding edge. A conjecture of Kalai [Kalai],…
Unsupervised graph-level anomaly detection (UGAD) has garnered increasing attention in recent years due to its significance. Most existing methods that rely on traditional GNNs mainly consider pairwise relationships between first-order…
We investigate gauge coupling unification in higher dimensional GUT models with split supersymmetry. We focus on 5d and 6d orbifold GUTs, which permit a simple solution to several problems of 4D GUTs as well as control over GUT scale…
In this paper, we focus on a generalised version of Gabriel graphs known as Locally Gabriel graphs ($LGGs$) and Unit distance graphs ($UDGs$) on convexly independent point sets. $UDGs$ are sub graphs of $LGGs$. We give a simpler proof for…
Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…
Hypertree decompositions, as well as the more powerful generalized hypertree decompositions (GHDs), and the yet more general fractional hypertree decompositions (FHD) are hypergraph decomposition methods successfully used for answering…
In $\mathrm{PU}(2,1)$, the group of holomorphic isometries of the complex hyperbolic plane, we study the space of involutions $R_1, R_2, R_3, R_4, R_5$ satisfying $R_5R_4R_3R_2R_1=1$, where $R_1$ is a reflection in a complex geodesic and…
Graph neural networks (GNNs) have been broadly studied on dynamic graphs for their representation learning, majority of which focus on graphs with homogeneous structures in the spatial domain. However, many real-world graphs - i.e.,…
Let D = {D_{1},...,D_{l}} be an arrangement of smooth hypersurfaces with normal crossings on the complex projective space P^n and let \Omega^{1}_{P^n}(log D) be the logarithmic bundle attached to it. Following [1], we show that…