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,695 papers · 148 categories

Trend · papers per month

70140209279 · Jun 202019922001200920172026
48 results for plane graphs

Paper introduces clock moves for plane graphs and proves Alexander polynomial properties.

problem Alexander polynomial of plane graphs and unimodality of coefficients.
method Introduces clock moves for plane graphs and develops a spanning tree model of Alexander polynomial.
result Proves unimodal property of Alexander polynomial coefficients and confirms conjectures.

Study Morse functions on projective plane using Reeb graphs.

problem Investigate topological structure of Morse functions on projective plane.
method Use Reeb graphs to describe and prove properties of simple Morse functions on RP2\mathbb{R} P^2.
result Prove that Reeb graphs are a complete topological invariant for simple Morse functions on RP2\mathbb{R} P^2.

For any chord diagram on a circle there exists a complete graph on sufficiently many vertices such that any generic immersion of it to the plane contains a plane closed curve whose chord diagram contains the given chord diagram as a sub-chord diagram. For any generic immersion of the complete graph on six vertices to t…

2012-10-27abs ↗pdf ↗

The aim of this work is studying translating graphs by mean curvature flow in $\Real^3$. We prove non-existence of complete translating graphs over bounded domains in $\Real^2$. Furthermore, we show that there are only three types of complete translating graphs in $\Real^3$; entire graphs, graphs between two vertical p…

2012-12-27abs ↗pdf ↗

We give an explicit calculation of the Wu invariants for immersions of a finite graph into the plane and classify all generic immersions of a graph into the plane up to regular homotopy by the Wu invariant. This result is a generalization of the fact that two plane curves are regularly homotopic if and only if they hav…

2009-08-21abs ↗pdf ↗

Develops a method to construct entire minimal graphs of odd dimensions.

problem Constructing entire minimal graphs of odd dimensions and arbitrary codimensions.
method Evolving-plane ansatz reducing minimal surface system to geodesic equation on Grassmannian.
result Yields a rich family of explicit entire minimal graphs of odd dimension and arbitrary codimension.

The splitting number is effective to distinguish the embedded topology of plane curves, and it is not determined by the fundamental group of the complement of the plane curve. In this paper, we give a generalization of the splitting number, called the splitting graph. By using the splitting graph, we classify the embed…

2018-03-06abs ↗pdf ↗

Kronheimer-Mrowka's instanton homology dimension equals Tait colorings.

problem Calculating the dimension of a specific homology group for plane trivalent graphs.
method Using SO(3) instanton Floer homology, the dimension is shown to be equal to the number of Tait colorings.
result The dimension of J#(G) is equal to the number of Tait colorings of G.

The paper explores winding numbers of almost embeddings of a 4-vertex graph in the plane.

problem Understanding the winding numbers of almost embeddings of a 4-vertex graph in the plane.
method Constructing examples to show the only relation between the winding numbers of cycles in the graph.
result The sum of winding numbers is odd, and this is the only relation between them.

There is a well-known way to describe a link diagram as a (signed) plane graph, called its Tait graph. This concept was recently extended, providing a way to associate a set of embedded graphs (or ribbon graphs) to a link diagram. While every plane graph arises as a Tait graph of a unique link diagram, not every embedd…

2010-07-23abs ↗pdf ↗

Odd crossing numbers and even rotation numbers for cycles in plane immersions.

problem Analyzing crossing and rotation numbers of cycles in plane immersions of graphs.
method Generic immersions and Legendrian embeddings of graphs, focusing on cycles of specific lengths.
result Sum of rotation numbers of all 5-cycles is even, and sum of crossing numbers is odd.

We present formulae for computing the Yamada polynomial of spatial graphs obtained by replacing edges of plane graphs, such as cycle-graphs, theta-graphs, and bouquet-graphs, by spatial parts. As a corollary, it is shown that zeros of Yamada polynomials of some series of spatial graphs are dense in a certain region in …

2018-01-27abs ↗pdf ↗

Immersions of graphs to the projective plane are studied. A classification of immersions up to regular homotopy is given. A complete invariant of immersions up to regular homotopy is constructed. Equivalence classes are described.

2016-11-29abs ↗pdf ↗

Study Steklov eigenvalues on hyperbolic triangle-tiling graphs.

problem Analyzing Steklov eigenvalues on specific hyperbolic graph structures.
method Introduced a graph roughly isometric to hyperbolic plane, used discretization to transfer bounds.
result Steklov eigenvalues tend to zero proportionally to the inverse of the domain size.

Study inverse curve shortening flow on hyperbolic plane, classifying solitons.

problem Understanding the behavior of curves in hyperbolic geometry under a specific flow.
method Classifying solitons with respect to vector fields and studying their properties.
result Parabolic solitons are graphs on the y-axis, conformal solitons on the x-axis.

The ray graph is a Gromov hyperbolic graph on which the mapping class group of the plane minus a Cantor set acts by isometries. We give a description of the Gromov boundary of the ray graph in terms of cliques of long rays on the plane minus a Cantor set. As a consequence, we prove that the Gromov boundary of the ray g…

2016-08-16abs ↗pdf ↗

A mathematical paradox shows secant planes don't always form a tangent plane, but some analogies hold with a specific vector product.

problem Secant planes of a two-variable smooth function do not always form a tangent plane, even for simple polynomials.
method Analogies with the one-variable case are explored, using Clifford's geometric vector product.
result Some analogies with the one-variable case still hold in the multi-variable context with a specific vector product.

We consider here 6-regular plane graphs whose faces have size 1, 2 or 3. In Section 2 a practical enumeration method is given that allowed us to enumerate them up to 53 vertices. Subsequently, in Section 3 we enumerate all possible symmetry groups of the spheres that showed up. In Section 4 we introduce a new Goldberg-…

2010-07-27abs ↗pdf ↗

The paper defines invariants for almost graph embeddings and explores their properties.

problem Understanding the properties and limitations of almost graph embeddings in the plane.
method Introducing and analyzing integer invariants (winding number, Wu numbers) for almost embeddings.
result Some values of invariants are realizable for almost embeddings but not for embeddings.

A plane graph HH is a {\em plane minor} of a plane graph GG if there is a sequence of vertex and edge deletions, and edge contractions performed on the plane, that takes GG to HH. Motivated by knot theory problems, it has been asked if the plane minor relation is a well-quasi-order. We settle this in the affirmativ…

2019-05-06abs ↗pdf ↗

This paper discusses reformulations of the problem of coloring plane maps with four colors. We give a number of alternate ways to formulate the coloring problem including a tautological expansion similar to the Penrose Bracket, and an extension of the Penrose Bracket that counts colorings of arbitrary cubic graphs pres…

2015-11-21abs ↗pdf ↗

New examples of mixed-type zero-curvature graphs found.

problem Finding new examples of zero-curvature graphs in Lorentz-Minkowski space.
method Using Konderak's representation formula to construct entire zero-curvature graphs over specific planes.
result Existence of new types of entire zero-curvature graphs in mixed-type in Lorentz-Minkowski space.

A zigzag in a plane graph is a circuit of edges, such that any two, but no three, consecutive edges belong to the same face. A railroad in a plane graph is a circuit of hexagonal faces, such that any hexagon is adjacent to its neighbors on opposite edges. A graph without a railroad is called tight. We consider the zigz…

2002-12-27abs ↗pdf ↗

The study examines stationary integral varifolds near multiplicity 2 planes, proving regularity under specific conditions.

problem Understanding the structure of stationary integral varifolds near multiplicity 2 planes.
method Investigates the structure of varifolds close to planes with multiplicity 2, proving an ε-regularity theorem under certain conditions.
result In B1/2(0)B_{1/2}(0), VV is represented by the graph of a Lipschitz 2-valued function over P0P_0 with small Lipschitz constant; all tangent cones at singular points are unique and comprised of stationary unions of 4 half-planes.

The paper characterizes graph manifolds using fold maps and embeddability of polyhedra.

problem Understanding the global topologies of graph manifolds.
method Using fold maps into the plane and embeddability of polyhedra in 3-manifolds.
result Characterizes graph manifolds via fold maps and polyhedra embeddability.

We obtain a criterion for approximability by embeddings of piecewise linear maps of a circle to the plane, analogous to the one proved by Minc for maps of a segment to the plane. Theorem. Let S be a triangulation of a circle with s vertices. Let f be a simplicial map of the graph S to the plane. The map f is approximab…

2008-08-08abs ↗pdf ↗

Examines discrete curvature's relation to smooth curvature in 3 spaces.

problem Understanding how discrete curvature relates to smooth curvature in different spaces.
method Using specific triangular tilings of 3 types of spaces to examine curvatures.
result Discrete curvature can sense the smooth curvature of ambient space forms.

Paper extends Enami-Ozeki-Yamaguchi's work on planar quadrangulations.

problem Finding the maximum number of colors for proper anti-rainbow colorings on planar quadrangulations.
method Introducing half-monochromatic colorings for plane graphs with even polygonal faces and providing an upper bound in terms of the independence number.
result An upper bound on the maximum number of colors for half-monochromatic colorings is given in terms of the independence number.

We construct a Legendrian version of Envelope theory. A tangential family is a 1-parameter family of rays emanating tangentially from a smooth plane curve. The Legendrian graph of the family is the union of the Legendrian lifts of the family curves in the projectivized cotangent bundle PTR2PT^*\R^2. We study the singular…

2004-09-29abs ↗pdf ↗

We survey the construction and properties of the Yamada polynomial of spatial graphs and present the Yamada polynomial formulae for some classes of graphs. Then we construct an infinite family of spatial graphs for which roots of Yamada polynomials are dense in the complex plane.

2018-10-27abs ↗pdf ↗

A meander of order n is a simple closed curve in the plane which intersects a horizontal line transversely at 2n points. (Meanders which differ by an isotopy of the line and plane are considered equivalent.) Let Gamma_n be the Cayley graph of the symmetric group S_n as generated by all (n choose 2) transpositions. Let …

2006-06-08abs ↗pdf ↗