Approaches 4D Schoenflies via pseudo-isotopy.
problem Smooth 4D Schoenflies conjecture.
method Pseudo-isotopy theory.
result Offers new approach to 4D Schoenflies.
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
48 results for “Schoenflies problem”
BiLipschitz mappings can be extended to preserve area.
problem Extending biLipschitz mappings to preserve area.
method Proving biLipschitz mappings can be extended to biLipschitz mappings preserving area.
result BiLipschitz mappings can be extended to preserve area.
There is a relation between the generalized Property R Conjecture and the Schoenflies Conjecture that suggests a new line of attack on the latter. The approach gives a quick proof of the genus 2 Schoenflies Conjecture and suffices to prove the genus 3 case, even in the absence of new progress on the generalized Propert…
The stable Andrews-Curtis conjecture in combinatorial group theory is the statement that every balanced presentation of the trivial group can be simplified to the trivial form by elementary moves corresponding to "handle-slides" together with "stabilization" moves. Schoenflies conjecture is the statement that the compl…
New examples of Schoenflies balls are produced using a 5D approach.
problem Identifying Schoenflies balls that are not standard.
method Using a 5-dimensional perspective, algebraic and geometric handle cancellation.
result New examples of Schoenflies balls not known to be standard are produced.
We show that both, the Jordan curve theorem and the Schoenflies theorem extend to non-metric manifolds (at least in the two-dimensional context), and conclude by some dynamical applications à la Poincaré-Bendixson.
3D Schoenflies theorem for simply-connected 2-complexes.
problem Embedding simply-connected 2-complexes in 3-space uniquely.
method Proving a 3-dimensional Schoenflies theorem for 3-connected link graphs.
result Essentially unique locally flat embedding into 3-sphere.
The paper connects diffeomorphism groups and sphere embeddings, proving a group structure.
problem Understanding the homotopy types of diffeomorphism groups and sphere embeddings.
method Cerf's upgraded proof, scanning maps, canceling handles, Embedding Calculus.
result The monoid of Schoenflies spheres forms a group under connect-sum.
In this paper we prove a new version of the Schoenflies extension theorem for collared domains in Euclidean n-space: for 1 < p < n, locally bi-Lipschitz homeomorphisms between collared domains with locally p-integrable, second-order weak derivatives admit homeomorphic extensions of the same regularity. Moreover, the th…
This paper describes a method to construct standard 4-balls from homotopy 4-balls in .
problem The problem is whether every homotopy 4-ball in is standard.
method The approach is to use Stein surfaces and pseudoconvex domains to construct a diffeomorphic domain that is the union of three pseudoconvex domains, ensuring it is a standard 4-ball.
result The construction method ensures that the domain is a standard 4-ball, providing a compelling reimbedding construction for homotopy 4-balls in .
This paper gives a complete proof of the result announced in the title.
This is the announcement of an alternative approach to the 3-dimensional Poincaré Conjecture, different from Perelman's big and spectacular breakthrough. No claim concerning the other parts of the Thurston Geometrization Conjecture, come with our purely 4-dimensional line of argument.
Involutions on S^4math.GT
The paper classifies involutions on S^4, proving linearities under certain conditions.
problem Classifying involutions on S^4 with specific fixed-point sets.
method Combining surgery theory, Schoenflies theorem, and equivariant topology.
result Linear involutions on S^4 with 1-dimensional fixed-point sets are proven.
Classifies manifolds and discrete subgroups of Lie groups using descriptive set theory.
problem Classifying manifolds and discrete subgroups of Lie groups.
method Descriptive set theory and Borel complexity computations.
result Complexity of homeomorphism problems for manifolds and conjugacy relations for subgroups.
This is an expository paper giving a proof of the existence and uniqueness of smooth structures (hence also PL structures) on topological surfaces. Most published proofs rely on the topological Schoenflies theorem, but here we use instead the Kirby torus trick. This has the advantage of reducing the point-set topology …
Calegari's 4-spheres from fibered knots are proven standard.
problem Proving Calegari's 4-spheres from fibered knots are standard.
method 5-dimensional handlebody techniques and mapping class groups of 3-dimensional handlebodies.
result All Calegari's homotopy 4-spheres from fibered knots are diffeomorphic to the standard 4-sphere.
We give a general treatment of the somewhat unfamiliar operation on manifolds called Connected Sum at Infinity, or CSI for short. A driving ambition has been to make the geometry behind the well definition and basic properties of CSI as clear and elementary as possible. CSI then yields a very natural and elementary pro…
We show that a smooth embedding of a closed 3-manifold in S^3 x R can be isotoped so that every generic level divides S^3 x t into two handlebodies (i.e., is Heegaard) provided the original embedding has a unique local maximum with respect to the R coordinate. This allows uniqueness of embeddings to be studied via the …
Smooth flows with surgery approximate weak mean curvature flows with spherical and neck-pinch singularities.
problem Approximating weak mean curvature flows with singularities using smooth flows.
method Combining Choi-Haslhofer-Hershkovits and Choi-Haslhofer-Hershkovits-White work on canonical neighbourhoods and barriers to flows with surgery.
result Smooth flows with surgery can approximate weak mean curvature flows with spherical and neck-pinch singularities.
Low-entropy surfaces can be flowed into spheres and cylinders.
problem Proving mean curvature flow for low-entropy hypersurfaces.
method Low-entropy density drop argument and recent work on hypersurfaces.
result Closed hypersurfaces with entropy ≤ 2 can be flowed into spherical and cylindrical shapes.
In a recent paper, {\it Algorithms for Deforming and Contracting Simply Connected Discrete Closed Manifolds (II)}, we discussed two algorithms for deforming and contracting a simply connected discrete closed manifold into a discrete sphere. The first algorithm was a continuation of work that began in {\it Algorithms fo…
We prove a discrete Jordan-Brouwer-Schoenflies separation theorem telling that a (d-1)-sphere H embedded in a d-sphere G defines two different connected graphs A,B in G such a way that the intersection of A and B is H and the union is G and such that the complementary graphs A,B are both d-balls. The graph theoretic de…
We survey the status of some decision problems for 3-manifolds and their fundamental groups. This includes the classical decision problems for finitely presented groups (Word Problem, Conjugacy Problem, Isomorphism Problem), and also the Homeomorphism Problem for 3-manifolds and the Membership Problem for 3-manifold gr…
Optimal transport reformulates multiple quantile hedging problem.
problem Multiple quantile hedging problem in incomplete markets.
method Reformulated as Monge optimal transport problem, introduced Kantorovitch version, proved no duality gap.
result Multiple quantile hedging problem can be seen as semi-discrete optimal transport problem.
Solves four problems related to circle families in the plane.
problem Four basic problems of circle families in the plane.
method Solves all four basic problems of circle families in the plane.
result All four basic problems are solved.
Solves four problems related to sphere families in 3D space.
problem Four basic problems of sphere families in Euclidean 3-space.
method Solves all four basic problems of sphere families in Euclidean 3-space.
result All four basic problems are solved.
Extremals for a series of sub-Finsler problems with 2-dimensional control via convex trigonometrymath.OC
The paper solves optimal control problems for various convex sets using convex trigonometry.
problem Optimal control problems with 2D convex compact sets.
method Using convex trigonometry to derive extremals for various problems.
result Geodesics in multiple sub-Finsler problems are derived.
This paper is a tutorial for eigenvalue and generalized eigenvalue problems. We first introduce eigenvalue problem, eigen-decomposition (spectral decomposition), and generalized eigenvalue problem. Then, we mention the optimization problems which yield to the eigenvalue and generalized eigenvalue problems. We also prov…
This paper solves the Christoffel problem in hyperbolic space and its equivalent on spheres.
problem Prescribing curvatures for convex hypersurfaces in hyperbolic space.
method Proving a full rank theorem to establish the existence of solutions.
result Existence of solutions to the Christoffel problem and its equivalent Nirenberg-Kazdan-Warner problem on spheres.
In the present paper, the primal-dual problem consisting of the investment risk minimization problem and the expected return maximization problem in the mean-variance model is discussed using replica analysis. As a natural extension of the investment risk minimization problem under only a budget constraint that we anal…
Study proves only origin-centered spheres solve certain curvature problems.
problem Proving uniqueness of solutions to curvature problems.
method Using the Heintze-Karcher inequality, the study proves the uniqueness of smooth, strictly convex solutions to a class of Minkowski type problems.
result Only origin-centered spheres solve isotropic and -Gaussian-Minkowski problems.
MathChat uses LLM agents to solve challenging math problems through conversational problem-solving.
problem Solving math problems expressed in natural language.
method MathChat is a conversational framework combining an LLM agent and a user proxy agent for collaborative problem-solving.
result MathChat improves tool-using prompting methods by 6% on difficult math problems.
The paper solves a generalized Christoffel-Minkowski problem using a curvature flow.
problem Solving the (p,q)-Christoffel-Minkowski problem.
method Investigating the problem via an expanding curvature flow.
result Existence and uniqueness of smooth solutions to the (p,q)-Christoffel-Minkowski problem.
Globally solving the Gromov-Wasserstein problem for point clouds in low dimensional Euclidean spacesmath.OC
Paper solves Gromov-Wasserstein for point clouds efficiently.
problem Quantifying similarity between two formations or shapes.
method Reformulates QAP as low-rank concave quadratic optimization problem.
result Global solution for large-scale problems with thousands of points.
The paper explains how microlocal analysis solves geometric inverse problems.
problem Recovering geometric information from boundary measurements.
method Microlocal analysis applied to three inverse problems.
result Microlocal techniques solve specific inverse problems in Riemannian geometry.
Proves NP and co-NP status for knot core recognition in solid torus.
problem Determining if a knot is the core of a solid torus.
method Alternate proof and corollary of Hopf link recognition problem.
result Proves NP and co-NP status for solid torus core recognition problem.
The min-max problem, also known as the saddle point problem, is a class of optimization problems which minimizes and maximizes two subsets of variables simultaneously. This class of problems can be used to formulate a wide range of signal processing and communication (SPCOM) problems. Despite its popularity, most exist…
A Decomposition Method for LQ Conditional McKean-Vlasov Control Problems with Random Coefficientsmath.OC
A new method solves complex control problems with random coefficients.
problem Solving LQ McKean-Vlasov control problems with random coefficients.
method Decomposes the problem into two decoupled stochastic optimal control problems.
result The sum of optimal controls of auxiliary problems equals the original problem's optimal control.
Some group theory problemsmath.GR
This is a survey of some problems in geometric group theory which I find interesting. The problems are from different areas of group theory. Each section is devoted to problems in one area. It contains an introduction where I give some necessary definitions and motivations, problems and some discussions of them. For ea…
We present updates to the problems on Hirzebruch's 1954 problem list focussing on open problems, and on those where substantial progress has been made in recent years. We discuss some purely topological problems, as well as geometric problems about (almost) complex structures, both algebraic and non-algebraic, about co…
New method solves generalized Minkowski problem for torsional rigidity.
problem Generalized Minkowski problem for torsional rigidity.
method Flow method
result Existence of solutions for general measures.
We present 27 problems encountered in automating the translation of movie/TV show subtitles. We categorize each problem in one of the three categories viz. problems directly related to textual translation, problems related to subtitle creation guidelines, and problems due to adaptability of machine translation (MT) eng…
Solves Brezis' first open problem on ball solutions.
problem Existence of solutions to Brezis-Nirenberg problem on a 3D ball.
method Building on sign-changing solutions to the Yamabe problem.
result Infinitely many sign-changing, nonradial solutions found.
Classical knot recognition problem solved in NP with exponential time algorithm.
problem Determining if a virtual knot is classical.
method Proved NP membership and provided an exponential time algorithm.
result Classical knot recognition problem is in NP.
Ranking problems, also known as preference learning problems, define a widely spread class of statistical learning problems with many applications, including fraud detection, document ranking, medicine, credit risk screening, image ranking or media memorability. In this article, we systematically review different types…
Paper solves four problems of pseudo-circle envelopes in Minkowski plane.
problem Four problems of pseudo-circle envelopes in Minkowski plane.
method Solutions to four basic problems.
result Solved four problems of pseudo-circle envelopes in Minkowski plane.
In this paper, we address the inverse problem, or the statistical machine learning problem, in Markov random fields with a non-parametric pair-wise energy function with continuous variables. The inverse problem is formulated by maximum likelihood estimation. The exact treatment of maximum likelihood estimation is intra…
Conference compiles problems on foliations and diffeomorphisms.
problem Challenges in foliations and diffeomorphism groups.
method Compilation of problems from conference participants.
result Compilation of 20+ problems on foliations and diffeomorphisms.