Classifies and identifies Legendrian Θ-graphs and their embeddings.
problem Classifying and identifying Legendrian Θ-graphs and their embeddings.
method Introducing vertex stabilization and twist moves, classifying topologically trivial graphs, and identifying nondestabilizeable embeddings.
result An infinite family of nondestabilizeable Legendrian realizations in the topological class of Θ-graphs.
We construct bundles of modules of vertex operator algebras, and prove the rigidity and vanishing theorem for the Dirac operator on loop space twisted by such bundles. This result generalizes many previous results.
We show how to construct an N=1 superconformal vertex algebra (SCVA) from any Riemannian manifold. When the Riemannian manifold has special holonomy groups, we discuss the extended supersymmetry. When the manifold is complex or Kähler, we also generalize the construction to obtain N=2 SCVA's. We study the BRST cohomolo…
New 4-manifold invariants derived from vertex algebras.
problem Computing 4-manifold invariants, including new and old ones.
method Using chiral correlation functions in half-twisted 2d N=(0,2) theories from compactified fivebranes. result Prediction of structural properties of multi-monopole invariants and non-abelian generalizations.
Via a computer search, Altshuler and Steinberg found that there are 1296 +1 combinatorial 3-manifolds on nine vertices, of which only one is non-sphere. This exceptional 3-manifold K93 triangulates the twisted S2-bundle over S1. It was first constructed by Walkup. In this paper, we present a computer-…
We give a complete enumeration of all combinatorial 3-manifolds with 10 vertices: There are precisely 247882 triangulated 3-spheres with 10 vertices as well as 518 vertex-minimal triangulations of the sphere product S2×S1 and 615 triangulations of the twisted sphere product $S^2_\times_S^1$. All the 3-spheres…
This paper characterizes a specific type of twisted Artin groups embedded in knot groups.
problem Embedding twisted right-angled Artin groups in knot groups.
method Defined and characterized twisted right-angled Artin groups through mixed graphs and Klein bottle relations.
result Completely determined which twisted right-angled Artin groups can be embedded in knot groups.
Novel mathematical approach using resurgent analysis reveals new structures in complex Chern-Simons theory.
problem Curious bijection in vertex algebras and SCFTs.
method Resurgent analysis, numerical algorithms, singularity elimination.
result New structures and patterns in complex Chern-Simons theory on hyperbolic 3-manifolds.
A generalized Baumslag-Solitar group is the fundamental group of a graph of groups all of whose vertex and edge groups are infinite cyclic. Levitt proves that any generalized Baumslag-Solitar group has property R-infinity, that is, any automorphism has an infinite number of twisted conjugacy classes. We show that any g…
For d≥2, Walkup's class K(d) consists of the d-dimensional simplicial complexes all whose vertex-links are stacked (d−1)-spheres. Kalai showed that for d≥4, all connected members of K(d) are obtained from stacked d-spheres by finitely many elementary handle additions. According to …
We study topological open string amplitudes on orientifolds without fixed planes. We determine the contributions of the untwisted and twisted sectors as well as the BPS structure of the amplitudes. We illustrate our general results in various examples involving D-branes in toric orientifolds. We perform the computation…
A Seifert surgery is an integral surgery on a knot in S^3 producing a Seifert fiber space which may contain an exceptional fiber of index 0. The Seifert Surgery Network is a 1-dimensional complex whose vertices correspond to Seifert surgeries; its edges correspond to single twistings along "seiferters" or "annular pair…
The chiral de Rham complex of Malikov, Schechtman, and Vaintrob, is a sheaf of differential graded vertex algebras that exists on any smooth manifold Z, and contains the ordinary de Rham complex at weight zero. Given a closed 3-form H on Z, we construct the twisted chiral de Rham differential DH, which coincid…
The study examines the properties of mapping class groups under specific Dehn twist subgroups.
problem Characterizing the structure of mapping class groups under Dehn twist subgroups.
method Analyzes the mapping class group MCG(Σg,p)/DT for various g and p, using properties of hyperbolic graphs and actions. result The mapping class group MCG(Σg,p)/DT is hyperbolic in low complexity cases. Vertex distortion detects if a knot is unknot.
problem Determining if a knot is the unknot.
method Using Denne-Sullivan's bound on Gromov distortion, the vertex distortion of nontrivial lattice knots is bounded. Then, it is shown that trivial vertex distortion implies the unknot.
result The conjecture that trivial vertex distortion implies the unknot is proven.
The paper extends vertex nomination schemes to general graph models and explores consistency.
problem Finding corresponding vertices in a network when given a vertex of interest.
method Extended statistical model of graphs, definitions of Bayes optimality and consistency, derivation of Bayes optimal scheme, proof of no universally consistent schemes.
result No universally consistent vertex nomination schemes exist.
The study finds the bounds of vertex orbits in maps derived from specific lattices.
problem Determining the bounds of vertex orbits in maps derived from k-vertex-homogeneous lattices. method Analyzing maps as quotients of k-vertex-homogeneous lattices. result Sharp bounds of the number of vertex orbits are identified.
The study finds pairs of curves at distance 5 in surface curve graphs.
problem Finding pairs of curves at distance 5 in the curve graph of closed surfaces.
method Applying Dehn twists to fixed curves and characterizing conditions for distance 5.
result Characterization of pairs of curves at distance 5 in surface curve graphs.
New maps on the plane with specific symmetry properties identified.
problem Characterizing maps with quasi-vertex-transitive properties.
method Analyzing the automorphism groups and vertex orbits of maps on the plane.
result Existence of quasi-vertex-transitive maps of certain types, but not vertex-transitive.
634 vertex-transitive and over 10^103 non-vertex-transitive 27-vertex triangulations of octonionic projective plane.
problem Constructing and classifying triangulations of the octonionic projective plane.
method Combinatorial construction and analysis of symmetry groups.
result Found 634 vertex-transitive and over 10^103 non-vertex-transitive 27-vertex triangulations.
This paper shows semi-equivelar toroidal maps are vertex-transitive covers.
problem Understanding the relationship between semi-equivelar and vertex-transitive toroidal maps.
method Proving semi-equivelar toroidal maps are quotients of vertex-transitive toroidal maps.
result Each semi-equivelar toroidal map has a finite vertex-transitive cover.
Geodesic loop on dodecahedron avoids all vertices.
problem Existence of geodesic loop on dodecahedron.
method Proving existence of geodesic trajectory without passing through other vertices.
result Existence of a geodesic trajectory from a vertex to itself without passing through any other vertex.
For integers d≥2 and ε=0 or 1, let S1,d−1(ε) denote the sphere product S1×Sd−1 if ε=0 and the twisted Sd−1 bundle over S1 if ε=1. The main results of this paper are: (a) if d≡ε (mod 2) then S1,d−1(ε) has a unique minimal triangulation using 2d+3 …
Defines formal vertex laws related to Lie conformal algebras.
problem No specific problem stated; focuses on definitions and proofs.
method Definitions and proofs of vertex/conformal versions of classical Lie theory results.
result Proves vertex/conformal versions of important Lie theory results.
New relations for vertex polynomial in graphs of any degree.
problem Understanding vertex polynomial in graphs of varying degrees.
method Proved local relations for digons, triangles, quadrilaterals, and pentagons.
result Established new relations for vertex polynomial in graphs of arbitrary degree.
The study examines vertices in curves with singular points in the Euclidean plane.
problem Investigating vertices in curves with singular points in the Euclidean plane.
method Defining vertices using evolutes of frontals and analyzing conditions for the four vertex theorem.
result Conditions for the four vertex theorem to hold for closed frontals.
Vertex distortion measures how far lattice knots deviate from straight lines.
problem Measuring how much lattice knots deviate from straight paths.
method Analogous to smooth knots, study vertex distortion in lattice knots.
result Vertex distortion is 1 only for the unknot and can be arbitrarily high.
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…
Paper proves ML-based vertex nomination is consistent and scalable.
problem Ordering non-interesting vertices to highlight interesting ones in graphs.
method Maximum likelihood estimation and vertex nomination scheme.
result ML-based scheme asymptotically matches Bayes optimal scheme performance.
In Levin-Wen (LW) models, a wide class of exactly solvable discrete models, for two dimensional topological phases, it is relatively easy to describe only single fluxon excitations, but not the charge and dyonic as well as many-fluxon excitations. To incorporate charged and dyonic excitations in (doubled) topological p…
New model learns graph features for classification.
problem Graph classification with structural information loss.
method Transform graphs into vertex grids, apply vertex convolution.
result Model preserves structural information on local vertices.
Research determines criteria for semi-regular tilings in hyperbolic space.
problem Finding combinatorial criteria for semi-regular tilings in hyperbolic geometry.
method Combinatorial analysis of vertex-types and geodesic polygons.
result Determined criteria for existence and uniqueness of semi-regular tilings.
New proof for global rigidity of vertex scaling on polyhedral surfaces.
problem Global rigidity of vertex scaling on polyhedral surfaces.
method Elementary variational proof based on continuity of eigenvalues and extension of convex functions.
result Global rigidity of vertex scaling proved without involving 3D hyperbolic geometry.
Improved accuracy in community detection with vertex labels.
problem Efficient inference in stochastic block models with vertex labels.
method Linearized belief propagation algorithm with vertex labels.
result Belief propagation achieves highest accuracy when a function of network parameters has a unique fixed point.
Proves a generalized Whitehead cut vertex lemma for tree groups.
problem Extending Whitehead's cut vertex lemma to tree group conjugacy classes.
method Proves a version of Whitehead's lemma for tree groups.
result Establishes a cut vertex in star graphs for tree group conjugacy classes.
Graph matching recovers lost vertex correspondence in shuffled graphs.
problem Errorful vertex correspondences impact graph inference performance.
method Information theory and graph matching algorithms.
result Graph matching can recover true vertex correspondence and reduce information loss.
Solves Skopenkov's problem on graph embedding criteria.
problem Criteria for toroidal embedding of one-vertex ribbon graphs.
method Analyzes one-vertex ribbon graphs with additional disc structure.
result Provides solutions to Skopenkov's problem.
Efficient method for vertex embedding and community detection.
problem Vertex embedding and community detection.
method Normalized one-hot graph encoder and rank-based cluster size measure.
result Excellent numerical performance of graph encoder ensemble algorithm.
New invariants distinguish spatial graphs not previously possible.
problem Distinguishing spatial graphs using Dehn colorings.
method Developed vertex-weight invariants based on Dehn colorings.
result Found spatial graphs distinguishable by vertex-weight invariants.
The paper explores how to find relevant vertices in one graph using another graph's attributes and structure.
problem Finding relevant vertices in one graph using another graph's attributes and structure.
method Theoretical and practical exploration of vertex nomination schemes that leverage both content (edge and vertex attributes) and context (network topology).
result Necessary and sufficient conditions for schemes that use both content and context to outperform those using only one.
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…
Investigates the vertex curve of smooth surfaces in 3D space, connecting geometry and image analysis.
problem Understanding the geometry of smooth surfaces in 3D space.
method Analyzes the vertex curve, related to differential geometry and symmetry sets of isophote curves.
result Establishes connections between the vertex curve and other geometric curves like parabolic and flecnodal curves.
Let M be a Riemannian manifold. For p∈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 …
Proofs for Moon's theorem and its generalization.
problem Proving Moon's theorem and its generalization.
method Proofs based on key lemmas.
result Generalization of the four-vertex theorem.
Study triangulations with a unique irregular vertex of valence 6k.
problem Characterize triangulations with a specific valence for vertices.
method Use a flat singular Riemannian metric adapted to triangulations.
result Uniqueness theorem for triangulations with irregular vertex valence not a multiple of 6.
Study finds root vertex in large networks with high probability.
problem Finding the root vertex in large growing networks.
method Constructs confidence sets for the root vertex in various random network models.
result Confidence sets of size independent of the number of vertices contain the root vertex with high probability.
Consider a group G and a family A of subgroups of G. We say that vertex finiteness holds for splittings of G over A if, up to isomorphism, there are only finitely many possibilities for vertex stabilizers of minimal G-trees with edge stabilizers in A. We show vertex finiteness when G…
Marked vertex diagrams provide a combinatorial way to represent knotted surfaces in R4; 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…