Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

8.3%16.7%25.0%33.3% · Jan 199319922001200920172026
48 results for one-vertex ribbon graphs

Every link diagram can be represented as a signed ribbon graph. However, different link diagrams can be represented by the same ribbon graphs. We determine how checkerboard colourable diagrams of links in real projective space, and virtual link diagrams, that are represented by the same ribbon graphs are related to eac…

2015-02-06abs ↗pdf ↗

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

problem Calculating volumes of combinatorial moduli spaces of directed metric ribbon graphs.
method Decomposes directed ribbon graphs into simpler graphs with one vertex, proving a canonical recursion scheme for volumes.
result Explicit recursion for volumes of four-valent metric ribbon graphs provided.

In this paper we consider minors of ribbon graphs (or, equivalently, cellularly embedded graphs). The theory of minors of ribbon graphs differs from that of graphs in that contracting loops is necessary and doing this can create additional vertices and components. Thus the ribbon graph minor relation is incompatible wi…

2013-11-09abs ↗pdf ↗

We introduce an additional structure on ribbon graphs, arrow structure. We extend the Bollobás-Riordan polynomial to ribbon graph with this structure. The extended polynomial satisfies the contraction-deletion relations and naturally behaves with respect to the partial duality of ribbon graphs. We construct an arrow ri…

2011-07-16abs ↗pdf ↗

Oriented ribbon graphs (dessins d'enfant) are graphs embedded in oriented surfaces. A quasi-tree of a ribbon graph is a spanning subgraph with one face, which is described by an ordered chord diagram. We show that for any link diagram LL, there is an associated ribbon graph whose quasi-trees correspond bijectively to …

2007-05-23abs ↗pdf ↗

Recently, Dasbach, Futer, Kalfagianni, Lin, and Stoltzfus extended the notion of a Tait graph by associating a set of ribbon graphs (or equivalently, embedded graphs) to a link diagram. Here we focus on Seifert graphs, which are the ribbon graphs of a knot or link diagram that arise from Seifert states. We provide a ch…

2011-06-21abs ↗pdf ↗

We introduce Khovanov homology for ribbon graphs and show that the Khovanov homology of a certain ribbon graph embedded on the Turaev surface of a link is isomorphic to the Khovanov homology of the link (after a grading shift). We also present a spanning quasi-tree model for the Khovanov homology of a ribbon graph.

2011-07-12abs ↗pdf ↗

This paper extends results of Hatcher and Vogtmann's work "Cerf Theory for Graphs" to ribbon graphs. Given an orientable, punctured and basepointed surface Sigma, we prove that the space of ribbon graphs that can be drawn in Sigma is filtered by simplicial complexes. The k-th simplicial complex is (k-1)-dimensional, (k…

2013-02-04abs ↗pdf ↗

Oriented ribbon graphs (dessins d'enfant) are graphs embedded in oriented surfaces. The Bollobás-Riordan-Tutte polynomial is a three-variable polynomial that extends the Tutte polynomial to oriented ribbon graphs. A quasi-tree of a ribbon graph is a spanning subgraph with one face, which is described by an ordered chor…

2007-05-23abs ↗pdf ↗

Random subsurfaces of hyperbolic surfaces equidistribute to ribbon graphs.

problem Distribution of shapes of complementary subsurfaces in moduli space.
method Study of shapes of complementary subsurfaces in moduli space as boundary lengths go to infinity.
result Random subsurfaces look like random ribbon graphs.

In this note, I discuss in some detail the dual version of the ribbon graph decomposition of the moduli spaces of Riemann surfaces with boundary and marked points, which I introduced in math.AG/0402015, and used in math.QA/0412149 to construct open-closed topological conformal field theories. This dual version of the r…

2006-01-06abs ↗pdf ↗

To each ribbon graph we assign a so-called L-space, which is a Lagrangian subspace in an even-dimensional vector space with the standard symplectic form. This invariant generalizes the notion of the intersection matrix of a chord diagram. Moreover, the actions of Morse perestroikas (or taking a partial dual) and Vassil…

2014-01-23abs ↗pdf ↗

For a ribbon graph GG we consider an alternating link LGL_G in the 3-manifold G×IG\times I represented as the product of the oriented surface GG and the unit interval II. We show that the Kauffman bracket [LG][L_G] is an evaluation of the recently introduced Bollobas-Riordan polynomial RGR_G. This results generalizes t…

2004-04-27abs ↗pdf ↗

A full Mealy automaton is associated with a graph and a square complex, which contains an anti-torus if and only if the automaton is bi-reversible and the graph is aperiodic.

problem Determining the existence of anti-tori in square complexes associated with Mealy automata
method Associating a graph and a square complex with a Mealy automaton and proving the equivalence between bi-reversibility and aperiodicity of the graph
result The square complex contains an anti-torus if and only if the automaton is bi-reversible and the graph is aperiodic

Let nn be a nonnegative integer, we use ribbon nn-graph diagrams and the Yamada polynomial skein relations to construct an algebra Yn{\mathcal Y}_n which is shown to be closely related to the Temerley-Lieb Algebra. We prove that the algebra Y2{\mathcal Y}_2 is isomorphic to some quotient of a three variables polynomi…

2012-03-27abs ↗pdf ↗

Graph neural networks have become one of the most important techniques to solve machine learning problems on graph-structured data. Recent work on vertex classification proposed deep and distributed learning models to achieve high performance and scalability. However, we find that the feature vectors of benchmark datas…

2019-05-23abs ↗pdf ↗

While convolutional neural networks (CNNs) have recently made great strides in supervised classification of data structured on a grid (e.g. images composed of pixel grids), in several interesting datasets, the relations between features can be better represented as a general graph instead of a regular grid. Although re…

2018-10-31abs ↗pdf ↗

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

problem Constructing triangulations for Heegaard splittings and related 3-manifolds.
method Algorithm using Regina to generate triangulations from combinatorial presentations of Heegaard diagrams.
result Triangulations with cutwidth bounded by 4g24g-2 for genus-gg Heegaard splittings.

This survey paper begins with the description of the duality between arc systems and ribbon graphs embedded in a punctured surface. Then we explain how to cellularize the moduli space of curves in two different ways: using Jenkins-Strebel differentials and using hyperbolic geometry. We also briefly discuss how these tw…

2007-05-12abs ↗pdf ↗

Alternating links bound rational homology balls if their chessboard lattice is cubiquitous.

problem When do alternating links bound rational homology balls?
method Heegaard Floer homology and flows on planar graphs.
result The normalized determinant of the link's chessboard lattice is a necessary and sufficient condition for the link to bound a rational homology ball.

A new approach to Morse theory using folded ribbon trees.

problem Applying Morse theory on symmetric products of surfaces.
method Introducing an A-infinity category with objects as κ-tuples of Morse functions, and showing conditions for the endomorphism to be a Hecke algebra.
result The endomorphism of a specific type of κ-tuple of Morse functions on T*R^2 is the Hecke algebra associated to the symmetric group.

A family of one-vertex triangulations of 3-manifolds, layered-triangulations, is defined. Layered-triangulations are first described for handlebodies and then extended to all 3-manifolds via Heegaard splittings. A complete and detailed analysis of layered-triangulations is given in the cases of the solid torus and lens…

2006-03-25abs ↗pdf ↗

The study embeds graphs on translation surfaces, proving essential-systolic embeddings and estimating surface genera.

problem Embedding graphs on translation surfaces with specific properties.
method Proving essential-systolic embeddings and estimating surface genera.
result Finite graphs admit essential-systolic embeddings on translation surfaces with estimated genera.

We consider the extension of classical 2-dimensional topological quantum field theories to Klein topological quantum field theories which allow unorientable surfaces. We approach this using the theory of modular operads by introducing a new operad governing associative algebras with involution. This operad is Koszul an…

2010-03-30abs ↗pdf ↗