arXiv research

Vertex distortion detects if a knot is unknot.

The study finds the bounds of vertex orbits in maps derived from specific lattices.

Lower bound on minimum vertex degree for non-negative Lin-Lu-Yau curvature on graphs.

We prove diameter bounds for graphs having positive Ricci-curvature bound in Bakry-Emery sense. One result using only curvature and maximal vertex degree is sharp in case of hypercubes. The other result depends on an additional dimension bound, but is independent of the vertex degree. In particular, the second result i…

Approximates cycles in planar and bounded-genus graphs.

Hypergraphs are used in machine learning to model higher-order relationships in data. While spectral methods for graphs are well-established, spectral theory for hypergraphs remains an active area of research. In this paper, we use random walks to develop a spectral theory for hypergraphs with edge-dependent vertex wei…

In this paper, we introduce a bisected vertex leveling of a plane graph. Using this planar embedding, we present elementary proofs of the well-known upper bounds in terms of the minimal crossing number on braid index $b(L)$ and arc index $α(L)$ for any knot or non-split link $L$, which are $b(L) \leq \frac{1}{2} c(L) +…

In arrangements of pseudocircles (Jordan curves) the weight of a vertex (intersection point) is the number of pseudocircles that contain the vertex in its interior. We give improved upper bounds on the number of vertices of weight <=k in certain arrangements of pseudocircles in the plane. In particular, forbidding cert…

The study proves spherical polygon analogs of curve theorems, finding bounds on intersections and inflections.

Critical nets in $\mathbb{R}^k$ (sometimes called geodesic nets) are embedded graph with the property that their embedding is a critical point of the total (edge) length functional and under the constraint that certain 1-valent vertices (leaves) have a fixed position. In contrast to what happens on generic manifolds, w…

New bounds on maximal linkless graphs with improved edge-to-vertex ratios.

We prove Cheeger inequalities for p-Laplacians on finite and infinite weighted graphs. Unlike in previous works, we do not impose boundedness of the vertex degree, nor do we restrict ourselves to the normalized Laplacian and, more generally, we do not impose any boundedness assumption on the geometry. This is achieved …

Algorithm constructs triangulations for Heegaard splittings and related 3-manifolds.

The study analyzes convergence of random-walk embeddings in graph theory.

A single-vertex origami is a piece of paper with straight-line rays called creases emanating from a fold vertex placed in its interior or on its boundary. The Single-Vertex Origami Flattening problem asks whether it is always possible to reconfigure the creased paper from any configuration compatible with the metric, t…

We find vertex bounds for triangulated manifolds and apply them to 4-manifold complexity.

The study explores maps of 2- and 3-uniform tilings on the torus.

Given a vertex of interest in a network $G_1$, the vertex nomination problem seeks to find the corresponding vertex of interest (if it exists) in a second network $G_2$. A vertex nomination scheme produces a list of the vertices in $G_2$, ranked according to how likely they are judged to be the corresponding vertex of …

This paper sets thresholds for recovering vertex correspondences in partially correlated graphs.

634 vertex-transitive and over 10^103 non-vertex-transitive 27-vertex triangulations of octonionic projective plane.

The study restricts groups in graph of groups structures.

We prove that the torsion of any closed space curve which bounds a simply connected locally convex surface vanishes at least 4 times. This answers a question of Rosenberg related to a problem of Yau on characterizing the boundary of positively curved disks in Euclidean space. Furthermore, our result generalizes the 4 v…

In this survey on combinatorial properties of triangulated manifolds we discuss various lower bounds on the number of vertices of simplicial and combinatorial manifolds. Moreover, we give a list of all known examples of vertex-minimal triangulations.

This paper shows semi-equivelar toroidal maps are vertex-transitive covers.

Defines formal vertex laws related to Lie conformal algebras.

Quasi-vertex-transitive maps are the homogeneous maps on the plane with finitely many vertex orbits under the action of their automorphism groups. We show that there exist quasi-vertex-transitive maps of types $[p^3, 3]$ for $p \equiv 1$ (mod $6$), but there doesn't exist vertex-transitive map of such types. In particu…

The study examines vertices in curves with singular points in the Euclidean plane.

Vertex distortion measures how far lattice knots deviate from straight lines.

Let $P$ be a (non necessarily convex) embedded polyhedron in $\R^3$, with its vertices on an ellipsoid. Suppose that the interior of $P$ can be decomposed into convex polytopes without adding any vertex. Then $P$ is infinitesimally rigid. More generally, let $P$ be a polyhedron bounding a domain which is the union of p…

For random graphs distributed according to stochastic blockmodels, a special case of latent position graphs, adjacency spectral embedding followed by appropriate vertex classification is asymptotically Bayes optimal; but this approach requires knowledge of and critically depends on the model dimension. In this paper, w…

We prove that there exists a geodesic trajectory on the dodecahedron from a vertex to itself that does not pass through any other vertex.

Normal surface theory is a central tool in algorithmic three-dimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important algorithms. However, it is not well understood how the number of such surfaces grows in relation to the size of the underlying triangulation.…

We prove the first nontrivial worst-case lower bounds for two closely related problems. First, $Ω(n^{3/2})$ degree-1 reductions, series-parallel reductions, and $Δ$Y transformations are required in the worst case to reduce an $n$-vertex plane graph to a single vertex or edge. The lower bound is achieved by any planar g…

New proof for global rigidity of vertex scaling on polyhedral surfaces.

Proves a generalized Whitehead cut vertex lemma for tree groups.

Solves Skopenkov's problem on graph embedding criteria.

A semi-regular tiling of the hyperbolic plane is a tessellation by regular geodesic polygons with the property that each vertex has the same vertex-type, which is a cyclic tuple of integers that determine the number of sides of the polygons surrounding the vertex. We determine combinatorial criteria for the existence, …

Let $K$ be a polygonal knot in general position with vertex set $V$. A \emph{generic quadrisecant} of $K$ is a line that is disjoint from the set $V$ and intersects $K$ in exactly four distinct points. We give an upper bound for the number of generic quadrisecants of a polygonal knot $K$ in general position. This upper…

In this paper, we develop a new aligned vertex convolutional network model to learn multi-scale local-level vertex features for graph classification. Our idea is to transform the graphs of arbitrary sizes into fixed-sized aligned vertex grid structures, and define a new vertex convolution operation by adopting a set of…

Efficient method for vertex embedding and community detection.

New invariants distinguish spatial graphs not previously possible.

If the face-cycles at all the vertices in a map on a surface are of same type then the map is called semi-equivelar. There are eleven types of Archimedean tilings on the plane. All the Archimedean tilings are semi-equivelar maps. If a map $X$ on the torus is a quotient of an Archimedean tiling on the plane then the map…

Given a graph in which a few vertices are deemed interesting a priori, the vertex nomination task is to order the remaining vertices into a nomination list such that there is a concentration of interesting vertices at the top of the list. Previous work has yielded several approaches to this problem, with theoretical re…

The paper explores how to find relevant vertices in one graph using another graph's attributes and structure.

The paper concerns discrete versions of the three well-known results of projective differential geometry: the four vertex theorem, the six affine vertex theorem and the Ghys theorem on four zeroes of the Schwarzian derivative. We study geometry of closed polygonal lines in $\bbRP^d$ and prove that polygons satisfying a…

Proofs for Moon's theorem and its generalization.

In this paper, we use normal surface theory to study Dehn filling on a knot-manifold. First, it is shown that there is a finite computable set of slopes on the boundary of a knot-manifold that bound normal and almost normal surfaces in a one-vertex triangulation of that knot-manifold. This is combined with existence th…

A labeled oriented graph (LOG) is an oriented graph with a labeling function from the edge set into the vertex set. The complexity of a LOG is the minimal cardinality of an initial set $S$ of vertices such that every vertex can be reached successively from $S$ only using edges with labels in $S$ or already visited vert…