Related papers: 0-Gaps on 3D Digital Curves

An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…

In the field of Connectomics, a primary problem is that of 3D neuron segmentation. Although deep learning-based methods have achieved remarkable accuracy, errors still exist, especially in regions with image defects. One common type of…

A {\it dynamic $k$-coloring} of a graph $G$ is a proper $k$-coloring of the vertices of $G$ such that every vertex of degree at least 2 in $G$ will be adjacent to vertices with at least 2 different colors. The smallest number $k$ for which…

A point on a plane curve is said to be Galois (for the curve) if the projection from the point as a map from the curve to a line induces a Galois extension of function fields. It is known that the number of Galois points is finite except…

Gapless criteria that can efficiently determine whether a crystal is gapless or not are particularly useful for identifying topological semimetals. In this work, we propose a sufficient gapless criterion for three-dimensional…

A $d$-dimensional box is the cartesian product $R_i\times\cdots\times R_d$ where each $R_i$ is a closed interval on the real line. The boxicity of a graph, denoted as $box(G)$, is the minimum integer $d\geq 0$ such that $G$ is the…

A shadow of a geometric object $A$ in a given direction $v$ is the orthogonal projection of $A$ on the hyperplane orthogonal to $v$. We show that any topological embedding of a circle into Euclidean $d$-space can have at most two shadows…

We consider a triangular gap of side two in a $60^\circ$ angle on the triangular lattice whose sides are zig-zag lines. We study the interaction of the gap with the corner as the rest of the angle is completely filled with lozenges. We show…

Let $\mathcal{F}$ be a plane singular curve defined over a finite field $\mathbb{F}_q$. The linear system of plane curves of a given degree passing through the singularities of $\cF$ provides potentially good bounds for the number of points…

A sum graph is a finite simple graph whose vertex set is labeled with distinct positive integers such that two vertices are adjacent if and only if the sum of their labels is itself another label. The spum of a graph $G$ is the minimum…

Graph matching aims to establish correspondences between vertices of graphs such that both the node and edge attributes agree. Various learning-based methods were recently proposed for finding correspondences between image key points based…

The geometric intersection number of a curve on a surface is the minimal number of self-intersections of any homotopic curve, i.e. of any curve obtained by continuous deformation. Given a curve $c$ represented by a closed walk of length at…

In discrete geometry, the contact number of a given finite number of non-overlapping spheres was introduced as a generalization of Newton's kissing number. This notion has not only led to interesting mathematics, but has also found…

Three-loop vacuum integrals are an important building block for the calculation of a wide range of three-loop corrections. Until now, only results for integrals with one and two independent mass scales are known, but in the electroweak…

We define the crossing number for an embedding of a graph G into R^3, and prove a lower bound on it which almost implies the classical crossing lemma. We also give sharp bounds on the space crossing numbers of pseudo-random graphs.

Oriented closed curves on an orientable surface with boundary are described up to continuous deformation by reduced cyclic words in the generators of the fundamental group and their inverses. By self-intersection number one means the…

Vertex connectivity and edge connectivity are fundamental concepts in graph theory that have been widely studied from both structural and algorithmic perspectives. The focus of this paper is on computing these two parameters for graphs…

We introduce a natural notion of mean (or average) distance in the context of compact metric graphs, and study its relation to geometric properties of the graph. We show that it exhibits a striking number of parallels to the reciprocal of…

In this paper, we compute the 1-gap sequences of 1-Weierstrass points on non-hyperelliptic smooth projective curves of genus 10. Furthermore, the geometry of such points is classified as flexes, sextactic and tentactic points. Also, an…

For a smooth projective curve, the cycles of subordinate or, more generally, secant divisors to a given linear series are among some of the most studied objects in classical enumerative geometry. We consider the intersection of two such…