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.

169,341 papers · 148 categories

Trend · papers per month

78156234312 · Jun 202019922001200920182026
48 results for non-orientable minimal surfaces

Adapts complex analytic methods to study non-orientable minimal surfaces.

problem Study of non-orientable conformal minimal surfaces in Rn\mathbb{R}^n.
method Develops complex analytic methods from first principles.
result Proves real analytic Banach manifold for conformal minimal immersions.

Minimal stretch factor for non-orientable surfaces is small.

problem Finding the minimal stretch factor for pseudo-Anosov homeomorphisms on non-orientable surfaces.
method Adapting Thurston's theory of fibered faces for non-orientable 3-manifolds.
result The minimal stretch factor is asymptotically on the order of 1/g.

Disproves polyhedral immersions of two specific triangulations on a non-orientable surface.

problem Proving non-existence of polyhedral immersions for triangulated surfaces.
method Developed method to disprove existence of polyhedral immersions in R^3.
result Two vertex-minimal, neighborly triangulations of a non-orientable surface are not realizable as polyhedral surfaces in R^3.

Paper finds a minimal set of Dehn twists to generate twist subgroup of non-orientable surfaces.

problem Finding a minimal set of Dehn twists to generate the twist subgroup of non-orientable surfaces.
method Used Dehn twists and an argument from Hirose [5] to find a minimal generating set.
result Found a generating set with one less element than the lower bound.

This paper calculates the non-orientable 4-genus for knots with 10 crossings.

problem Determining the non-orientable 4-genus for knots with a specific number of crossings.
method Calculating the minimal first Betti number of non-orientable surfaces smoothly embedded in a 4-ball with boundary the knot.
result The non-orientable 4-genus for knots with 10 crossings has been calculated.

A spine is constructed for a non-orientable surface's decorated Teichmüller space.

problem Constructing a spine for a non-orientable surface's decorated Teichmüller space.
method Building on Harer's work, constructing a spine and computing its dimension, showing equivariance with the pure mapping class group.
result A spine is constructed with minimal dimension for a punctured non-orientable surface.

We investigate constraints on embeddings of a non-orientable surface in a 44-manifold with the homology of M×IM \times I, where MM is a rational homology 33-sphere. The constraints take the form of inequalities involving the genus and normal Euler class of the surface, and either the Ozsváth--Sazbó dd-invariants or …

2013-10-31abs ↗pdf ↗

Study on minimal surfaces with closed curvature lines in 3D space.

problem Investigating complete non-orientable minimal surfaces with specific curvature properties.
method Analyzing complete non-orientable minimal surfaces of finite total curvature in R3\mathbb{R}^3 with ends foliated by closed lines of curvature.
result There are no such surfaces with one end, proving a rigid situation.

The article improves and extends a heuristic for realizing surfaces with few vertices.

problem Realizing triangulated orientable and non-orientable surfaces with minimal vertices.
method Polyhedral embeddings and immersions of triangulated 2-manifolds with few vertices.
result Obtained numerous symmetric realizations of non-orientable surfaces with minimal vertices.

Study curves in non-orientable surfaces with specific intersection properties.

problem Enumerate and understand curves in non-orientable surfaces with intersection constraints.
method Generalized construction of Malestein-Rivin-Theran to non-orientable surfaces.
result Lower bound for maximum number of curves in generic non-orientable surface.

We give a concrete example of an infinite sequence of (pn,qn)(p_n, q_n)-lens spaces L(pn,qn)L(p_n, q_n) with natural triangulations T(pn,qn)T(p_n, q_n) with pnp_n taterahedra such that L(pn,qn)L(p_n, q_n) contains a certain non-orientable closed surface which is fundamental with respect to T(pn,qn)T(p_n, q_n) and of minimal crosscap number among a…

2008-09-10abs ↗pdf ↗

The paper studies singularities in mean curvature flow and bounds on minimal surface total curvature.

problem Understanding singularities in mean curvature flow and bounds on minimal surface total curvature.
method Mean curvature flow and geometric analysis.
result The largest number k for which a minimal surface with total curvature less than k is a disk is greater than 3π.

Study on topological complexity and homotopy cofiber for non-orientable surfaces.

problem Understanding topological properties of non-orientable surfaces.
method Analysis of Lusternik-Schnirelmann category and topological complexity.
result Topological complexity of non-orientable surfaces of genus >3 is four.

We construct compact arbitrary Euler characteristic orientable and non-orientable minimal surfaces in the Berger spheres. Besides we show an interesting family of surfaces that are minimal in every Berger sphere, characterizing them by this property. Finally we construct, via the Daniel correspondence, new examples of …

2010-07-07abs ↗pdf ↗

Analog of Kauffman bracket for non-orientable knots in thickened surface.

problem Defining an invariant for non-orientable knots in a non-orientable surface.
method Proposes an analog of the Kauffman bracket polynomial with modified sign rules.
result Polynomial is an isotopy invariant and independent of classical Kauffman for orientable covers.

Study on loops on non-orientable surfaces, determining cardinality and order.

problem Determining the cardinality and order of maximal complete 1-systems of loops on non-orientable surfaces.
method Proved the cardinality of maximal systems of arcs pairwise-intersecting at most once on a non-orientable surface is 2χ(χ+1)2|χ|(|χ|+1), and used this to determine the cardinality of maximal complete 1-systems of loops.
result Exact cardinality of maximal complete 1-systems of loops on punctured projective planes is determined.

Study homology groups for non-orientable surfaces with boundary.

problem Determine the first homology group for mapping class groups of non-orientable surfaces.
method Calculate the first homology group with twisted coefficients.
result Explicitly determined the first homology group for various mapping class groups.

The crosscap number of a knot in the 3-sphere is the minimal genus of non-orientable surface bounded by the knot. We determine the crosscap numbers of torus knots.

2002-07-23abs ↗pdf ↗

This paper provides an infinite presentation for a subgroup of mapping class groups of non-orientable surfaces.

problem Finite presentations for mapping class groups of non-orientable surfaces.
method Using Stukow's finite presentation and Birman exact sequences.
result An infinite presentation for the twist subgroup of the mapping class group of a compact non-orientable surface.

Paper finds a normal generating set for Torelli group of non-orientable surfaces.

problem Finding a normal generating set for the Torelli group of non-orientable surfaces.
method Explicit construction using BSCC and BP maps.
result An explicit normal generating set for the Torelli group of genus-gg compact non-orientable surfaces with bb boundary components.

Study Farrell cohomology for non-orientable surfaces, classifying subgroup conjugacy.

problem Determine the pp-primary component of Farrell cohomology for non-orientable surfaces.
method Classify subgroups of order pp using topological equivalence adapted to surfaces with marked points.
result Determine the pp-primary component of Farrell cohomology for non-orientable surfaces.

Study shortest non-separating curves on non-orientable surfaces, proving NP-hardness and tractability.

problem Computing shortest non-separating simple closed curves on non-orientable surfaces.
method Developed tools for computing shortest curves, proving NP-hardness and tractability.
result Proved NP-hardness and fixed-parameter tractability for computing shortest orienting curves, and polynomial-time algorithm for non-orienting curves.