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

1122 · Jul 201519922001200920182026
32 results for multisection

Multisections generalize Heegaard splittings and trisections to higher dimensions.

problem Decomposing higher-dimensional manifolds into 1-handlebodies with specific intersection properties.
method Considering multisections of higher-dimensional smooth or PL closed orientable manifolds, and associating diagrams to them.
result Multisection diagrams uniquely determine manifolds in all dimensions up to 6.

Study of curves in rational surfaces using multisections and torus actions.

problem Understanding curves in rational surfaces using multisections and torus actions.
method Analysis of multisections of embedded surfaces in rational 4-manifolds with torus actions.
result Every smooth, complex curve in CP^1 × CP^1 can be put in efficient bridge position with respect to a genus one 4-section.

The study shows manifolds with special generic maps also have nice multisections.

problem Characterizing manifolds with special generic maps and multisections.
method Analyzing manifolds with special generic maps and their properties, and showing how these maps restrict the differentiable structures of spheres and manifolds.
result Manifolds admitting special generic maps also admit nice generalized multisections.

Characterizes Lefschetz fibrations and multisections via monodromy factorizations.

problem Classifying Lefschetz fibrations and multisections.
method Using monodromy factorizations and Hurwitz equivalence.
result Two Lefschetz fibrations with multisections are isomorphic if and only if their monodromy factorizations are related by a finite collection of modifications.

New invariant defined for Weinstein domains, related to Kirby-Thompson's invariant.

problem Defining a symplectic invariant for Weinstein domains.
method Contact cut graph, Lefschetz fibrations, multisections with divides.
result Definition of Weinstein L\mathcal{L}-invariant and its relation to Kirby-Thompson's invariant.

In this paper we use continuous family of multisections of the moduli space of pseudo holomorphic discs to partially improve, in the case of real coefficient, the construction of Lagrangian Floer cohomology of which the author developed jointly with Oh-Ohta-Ono. Namely we associate cyclically symmetric filtered A infin…

2009-07-24abs ↗pdf ↗

Revisits and proves a reparametrization theorem for multi-valued graphs in higher codimension.

problem Analyzing multi-valued sections of vector bundles and proving a reparametrization theorem.
method Develops properties of QQ-multisections and provides a geometric proof.
result Elementary and purely geometric proof of a reparametrization theorem for multi-valued graphs.

SDP algorithm for community detection in unbalanced networks.

problem Community detection in networks with latent community structure.
method Semidefinite programming (SDP) algorithm for exact recovery of communities.
result Achieves exact recovery of latent communities up to information-theoretic limits.

Cieliebak, Mundet i Riera and Salamon recently formulated a definition of branched submanifold of Euclidean space in connection with their discussion of multivalued sections and the Euler class. This note proposes an intrinsic definition of a weighted branched manifold Z that is obtained from the usual definition of or…

2005-09-28abs ↗pdf ↗

New tools classify symplectic fillings of contact 3-manifolds.

problem Classifying symplectic fillings of contact 3-manifolds.
method Spinal open book decompositions and bordered Lefschetz fibrations.
result Symplectic fillings of contact 3-manifolds are deformation equivalent to complements of positive multisections in bordered Lefschetz fibrations.

Semidefinite programming solves community detection in stochastic block models.

problem Identifying community-like structures in graphs with varying probabilities of connections.
method Semidefinite programming (SDP) algorithms for exact recovery in the Stochastic Block Model (SBM).
result SDP-based algorithms achieve exact recovery in the SBM with high probability under certain conditions.

Study symplectic fillings of sandwiched singularities.

problem Contrast deformation theory and symplectic topology of Milnor fibers.
method Develop an analog of de Jong--van Straten's theory in the symplectic setting using spinal open books and nearly Lefschetz fibrations.
result Minimal symplectic fillings of links are generated by certain immersed disk arrangements.