English
Related papers

Related papers: Eliminating higher-multiplicity intersections in t…

200 papers

Given two maps between smooth manifolds, the obstruction to removing their coincidences (via homotopies) is measured by minimum numbers. In order to determine them we introduce and study an infinite hierarchy of Nielsen numbers N_i, i = 0,…

Algebraic Topology · Mathematics 2014-10-01 Ulrich Koschorke

Numerous studies have reported two types of doubling of invariant closed curves (ICCs) in dynamical systems: (a) the creation of two disjoint ICCs such that iterations flip between them; and (b) the creation of a single ICC of double the…

Dynamical Systems · Mathematics 2025-09-17 Sayanho Biswas , Soumitro Banerjee , Viktor Avrutin , Iryna Sushko

Given n general points p_1, p_2,..., p_n \in P^r, it is natural to ask whether there is a curve of given degree d and genus g passing through them; by counting dimensions a natural conjecture is that such a curve exists if and only if \[n…

Algebraic Geometry · Mathematics 2019-04-29 Eric Larson

We establish that the relevant geometric data for the target space description of world sheet topological defects are submanifolds - which we call bi-branes - in the product M1 x M2 of the two target spaces involved. Very much like branes,…

High Energy Physics - Theory · Physics 2008-11-26 Jürgen Fuchs , Christoph Schweigert , Konrad Waldorf

For an integer $m\geq 1$, a combinatorial manifold $\widetilde{M}$ is defined to be a geometrical object $\widetilde{M}$ such that for $\forall p\in\widetilde{M}$, there is a local chart $(U_p,\phi_p)$ enable $\phi_p:U_p\to…

General Mathematics · Mathematics 2007-05-23 Linfan Mao

The problem of finding a point in the intersection of closed sets can be solved by the method of alternating projections and its variants. It was shown in earlier papers that for convex sets, the strategy of using quadratic programming (QP)…

Optimization and Control · Mathematics 2015-06-30 C. H. Jeffrey Pang

We consider the $n$-dimensional random temporal hypercube, i.e., the $n$-dimensional hypercube graph with its edges endowed with i.i.d. continuous random weights. We say that a vertex $w$ is accessible from another vertex $v$ if and only if…

Probability · Mathematics 2025-09-24 Austin Eide , Martijn Gösgens , Paweł Prałat

A discretisation of differential geometry using the Whitney forms of algebraic topology is consistently extended via the introduction of a pairing on the space of chains. This pairing of chains enables us to give a definition of the…

High Energy Physics - Theory · Physics 2007-05-23 Vivien de Beauce , Siddhartha Sen

A digraph is 2-regular if every vertex has both indegree and outdegree two. We define an embedding of a 2-regular digraph to be a 2-cell embedding of the underlying graph in a closed surface with the added property that for every…

Combinatorics · Mathematics 2017-06-12 Dan Archdeacon , Matt DeVos , Stefan Hannie , Bojan Mohar

We prove convergence of Goodwillie-Weiss' embedding calculus for spaces of embeddings into a manifold of dimension at most two, so in particular for diffeomorphisms between surfaces. We also relate the Johnson filtration of the mapping…

Algebraic Topology · Mathematics 2024-04-24 Manuel Krannich , Alexander Kupers

We compute the group of link homotopy classes of link maps of two 2-spheres into 4-space. It turns out to be free abelian, generated by geometric constructions applied to the Fenn-Rolfsen link map and detected by two self-intersection…

Geometric Topology · Mathematics 2019-08-15 Rob Schneiderman , Peter Teichner

We construct closed complex submanifolds of dimension three in C^5 which are differential complete intersections but not holomorphic complete intersections. We also prove a homotopy principle concerning the removal of intersections of…

Complex Variables · Mathematics 2007-05-23 Franc Forstneric

A systematic program is developed for analyzing and cancelling local anomalies on networks of intersecting orbifold planes in the context of M-theory. Through a delicate balance of factors, it is discovered that local anomaly matching on…

High Energy Physics - Theory · Physics 2009-10-07 Michael Faux , Dieter Luest , Burt A. Ovrut

There is the classical Radon theorem. Given integer $d \geq 1$ and $d+2$ points in d-dimensional space $R^d$. Then these points can be divided into two disjoint subsets whose convex hulls have a non-empty intersection. The original proof of…

Metric Geometry · Mathematics 2019-03-28 Egor Kolpakov

Various real-world problems consist of partitioning a set of locations into disjoint subsets, each subset spread in a way that it covers the whole set with a certain radius. Given a finite set S, a metric d, and a radius r, define a subset…

Data Structures and Algorithms · Computer Science 2023-02-08 Eran Rosenbluth

The first part of this paper exposits a simple geometric description of the Kirby-Siebenmann invariant of a 4--manifold in terms of a quadratic refinement of its intersection form. This is the first in a sequence of higher-order…

Geometric Topology · Mathematics 2016-01-20 James Conant , Rob Schneiderman , Peter Teichner

Interpolation of data on non-Euclidean spaces is an active research area fostered by its numerous applications. This work considers the Hermite interpolation problem: finding a sufficiently smooth manifold curve that interpolates a…

Numerical Analysis · Mathematics 2024-02-27 Axel Séguin , Daniel Kressner

This paper centers around two basic problems of topological coincidence theory. First, try to measure (with help of Nielsen and minimum numbers) how far a given pair of maps is from being loose, i.e. from being homotopic to a pair of…

Algebraic Topology · Mathematics 2007-05-23 Ulrich Koschorke

String theory in 4 dimensions has the unique feature that a topological term, the oriented self-intersection number, can be added to the usual action. It has been suggested that the corresponding theory of random surfaces wold be free from…

High Energy Physics - Theory · Physics 2009-10-28 P. Teotonio-Sobrinho

We consider the Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rectangle families, rectangle families $\calR$ where $R_1 \setminus R_2$…

Data Structures and Algorithms · Computer Science 2010-01-20 Reuven Bar-Yehuda , Danny Hermelin , Dror Rawitz
‹ Prev 1 4 5 6 7 8 10 Next ›