arXiv research

The paper introduces a quantum state system to count perfect matchings in graphs.

Marked vertex diagrams provide a combinatorial way to represent knotted surfaces in $\mathbb{R}^4$; including virtual crossings allows for a theory of virtual knotted surfaces and virtual cobordisms. Biquandle counting invariants are defined only for marked vertex diagrams representing knotted orientable surfaces; we e…

Exploratory analysis over network data is often limited by the ability to efficiently calculate graph statistics, which can provide a model-free understanding of the macroscopic properties of a network. We introduce a framework for estimating the graphlet count---the number of occurrences of a small subgraph motif (e.g…

Software finds ideal polyhedra with rational dihedral angles and volume maxima.

Study uses knot theory to model RNA foldings, emphasizing both entanglement and intrachain interactions.

Algorithm matches vertices of correlated Erdős-Rényi graphs efficiently.

A new test statistic counts tree co-occurrences to detect edge correlation between networks.

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

Geodesics count exponentially between triangulations of surfaces with enough topology.

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…

The study counts triangulations of a projective plane with specific vertex valencies.

Consider the collection of edge bicolorings of a graph that is cellularly embedded on an orientable surface. In this work, we count the number of equivalence classes of such colorings under two relations: reversing colors around a face and reversing colors around a vertex. In the case of the plane, this is well studied…

Solves weighted bi-colored plane tree enumeration and applies to geometric problems.

New method identifies causal structure in count data using cumulants and path analysis.

A tropical curve in $\mathbb R^{3}$ contributes to Gromov-Witten invariants in all genus. Nevertheless, we present a simple formula for how a given tropical curve contributes to Gromov-Witten invariants when we encode these invariants in a generating function with exponents of $λ$ recording Euler characteristic. Our ma…

We study the hyperbolic random geometric graph introduced in Krioukov et al. For a sequence $R_n \to \infty$, we define these graphs to have the vertex set as Poisson points distributed uniformly in balls $B(0,R_n) \subset B_d^α$, the $d$-dimensional Poincaré ball (unit d-ball with the Poincaré metric $d_α$ correspondi…

Method samples triangulations of manifolds using biased random walks.

Vertex distortion detects if a knot is unknot.

Maximal knotless graphs have at least 74% of their vertices' edges.

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

This article introduces planar ribbons, Vergili ribbon complexes and ribbon nerves in Alexandroff-Hopf-Whitehead CW (Closure finite Weak) topological spaces. A {\em planar ribbon} (briefly, {ribbon}) in a CW space is the closure of a pair of nesting, non-concentric filled cycles that includes the boundary but does not …

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 …

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

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.

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.

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

Proves a generalized Whitehead cut vertex lemma for tree groups.

Paper studies metric ribbon graphs and provides a recursion for their volumes.

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, …

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.

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.

Investigates the vertex curve of smooth surfaces in 3D space, connecting geometry and image analysis.

Let $M$ be a Riemannian manifold. For $p\in M$, the tensor algebra of the negative part of the (complex) affinization of the tangent space of $M$ at $p$ has a natural structure of a meromorphic open-string vertex algebra. These meromorphic open-string vertex algebras form a vector bundle over $M$ with a connection. We …

Study finds root vertex in large networks with high probability.

Consider a group G and a family $\mathcal{A}$ of subgroups of G. We say that vertex finiteness holds for splittings of G over $\mathcal{A}$ if, up to isomorphism, there are only finitely many possibilities for vertex stabilizers of minimal G-trees with edge stabilizers in $\mathcal{A}$. We show vertex finiteness when G…

Researchers link vertex algebras to non-Kähler solutions of the Hull-Strominger system.

Given a finite graph of relatively hyperbolic groups with its fundamental group relatively hyperbolic and edge groups quasi-isometrically embedded and relatively quasiconvex in vertex groups, we prove that vertex groups are relatively quasiconvex if and only if all the vertex groups have finite relative height in the f…