Related papers: Boundary Framework, Rear Morphology, and Rectangul…
The type C_n full root polytope is the convex hull in R^n of the origin and the points e_i-e_j, e_i+e_j, 2e_k for 1 <= i < j <= n, k \in [n]. Given a graph G, with edges labeled positive or negative, associate to each edge e of G a vector…
Bent radio active galactic nuclei (RAGNs) -- wide-angle tails (WATs) and narrow-angle tails (NATs) -- trace dense environments in galaxy groups and clusters, yet no multiclass classifier simultaneously separates them from straight…
We study spherical quadrilaterals whose angles are odd multiples of pi/2, and the equivalent accessory parameter problem for the Heun equation. We obtain a classification of these quadrilaterals up to isometry. For given angles, there are…
Geometric deep learning (GDL) models have demonstrated a great potential for the analysis of non-Euclidian data. They are developed to incorporate the geometric and topological information of non-Euclidian data into the end-to-end deep…
A planar orthogonal drawing of a planar 4-graph G (i.e., a planar graph with vertex-degree at most four) is a crossing-free drawing that maps each vertex of G to a distinct point of the plane and each edge of $G$ to a sequence of horizontal…
We study the problem of edge partitioning, where the goal is to partition the edge set of a graph into several parts. The replication factor of a vertex $v$ is the number of parts that contain edges incident to $v$. The goal is to minimize…
Graph neural networks (GNNs) have become a core paradigm for learning on relational data. In materials science, equivariant GNNs (EGNNs) have emerged as a compelling backbone for crystalline-structure prediction, owing to their ability to…
The human ear is generally universal, collectible, distinct, and permanent. Ear-based biometric recognition is a niche and recent approach that is being explored. For any ear-based biometric algorithm to perform well, ear detection and…
An edge cut C of a graph G is tight if |C \M| = 1 for every perfect matching M of G. Barrier-cuts and 2-separation cuts, also referred to as ELP-cuts, are two important types of tight cuts in matching covered graphs. Edmonds, Lovasz and…
We define a grid graph $G$ as a Cartesian product of path-graphs $P_n$ or cycle-graphs $C_n$ as shown in Figure 1, and we ask, when can the edge set of a complete graph be expressed as a disjoint union of graphs isomorphic to $G$? That is,…
We analyse the power of graph neural networks (GNNs) in terms of Boolean circuit complexity and descriptive complexity. We prove that the graph queries that can be computed by a polynomial-size bounded-depth family of GNNs are exactly those…
Ortho-Radial drawings are a generalization of orthogonal drawings to grids that are formed by concentric circles and straight-line spokes emanating from the circles' center. Such drawings have applications in schematic graph layouts, e.g.,…
In Francis and Steel (2015), it was shown that there exists non-trivial networks on $4$ leaves upon which the distance metric affords a metric on a tree which is not the base tree of the network. In this paper we extend this result in two…
For undirected graphs $G=(V,E)$ and $G_0=(V_0,E_0)$, say that $G$ is a region intersection graph over $G_0$ if there is a family of connected subsets $\{ R_u \subseteq V_0 : u \in V \}$ of $G_0$ such that $\{u,v\} \in E \iff R_u \cap R_v…
A rectilinear drawing of a graph is a drawing of the graph in the plane in which the edges are drawn as straight-line segments. The rectilinear crossing number of a graph is the minimum number of pairs of edges that cross over all…
A basic and an improved ear clipping based algorithm for triangulating simple polygons and polygons with holes are presented. In the basic version, the ear with smallest interior angle is always selected to be cut in order to create fewer…
We consider GL$_m$-dimers of triangulations of regular convex $n$-gons, which give rise to a dimer model with boundary $Q$ and a dimer algebra $\Lambda_Q$. Let $e_b$ be the sum of the idempotents of all the boundary vertices, and…
Let $\Gamma$ be a finite connected graph. The (unlabelled) configuration space $UC^n \Gamma$ of $n$ points on $\Gamma$ is the space of $n$-element subsets of $\Gamma$. The $n$-strand braid group of $\Gamma$, denoted $B_n\Gamma$, is the…
The partition algebra is an associative algebra with a basis of set-partition diagrams and multiplication given by diagram concatenation. It contains as subalgebras a large class of diagram algebras including the Brauer, planar partition,…
This work revolves around the question of whether a given resonance variety is associated with a vector bundle. We show the existence of a family of natural morphisms on a stratification of the resonance variety to a suitable family of a…