English
Related papers

Related papers: Topological equivalences for one-parameter bifurca…

200 papers

The criteria for determining graph isomorphism are crucial for solving graph isomorphism problems. The necessary condition is that two isomorphic graphs possess invariants, but their function can only be used to filtrate and subdivide…

Graphics · Computer Science 2025-08-19 Chuanfu Hu , Aimin Hou

We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…

Discrete Mathematics · Computer Science 2015-12-31 Vivek S. Nittoor

The problem of detecting the bifurcation set of polynomial mappings $\mathbb{ C}^m \to \mathbb{ C}^k$, $m\ge 2$, $m\ge k\ge 1$, has been solved in the case $m=2$, $k=1$ only. Its solution, which goes back to the 1970s, involves the…

Algebraic Geometry · Mathematics 2018-06-25 Cezar Joita , Mihai Tibar

Let $f:G\rightarrow H$ be a homomorphism of groups, we construct a topological space $X_f$ such that its group of homeomorphisms is isomorphic to $G$, its group of homotopy classes of self-homotopy equivalences is isomorphic to $H$ and the…

Algebraic Topology · Mathematics 2021-04-16 Pedro J. Chocano , Manuel A. Morón , Francisco R. Ruiz del Portal

This article presents a novel approach to identifying and classifying intersections for semantic and topological mapping. More specifically, the proposed novel approach has the merit of generating a semantically meaningful map containing…

Robotics · Computer Science 2023-05-12 Scott Fredriksson , Akshit Saradagi , George Nikolakopoulos

The Harmonic Mapping Problem asks when there exists a harmonic homeomorphism between two given domains. It arises in the theory of minimal surfaces and in calculus of variations, specifically in hyperelasticity theory. We investigate this…

Complex Variables · Mathematics 2011-09-28 Tadeusz Iwaniec , Leonid V. Kovalev , Jani Onninen

The regular structures of a generic 4D symplectic map with a mixed phase space are organized by one-parameter families of elliptic 1D-tori. Such families show prominent bends, gaps, and new branches. We explain these features in terms of…

Chaotic Dynamics · Physics 2016-07-04 Franziska Onken , Steffen Lange , Roland Ketzmerick , Arnd Bäcker

We introduce a new class of possibly noncompact n-dimensional manifolds without boundary associated to finite data which we call topological automata. This class is large enough to contain many interesting examples of open 2-dimensional and…

Geometric Topology · Mathematics 2024-04-03 Sylvain Maillot

For mappings in metric spaces satisfying one inequality with respect to modulus of families of curves, there is proved a lightness of the uniform limit of these mappings. It is proved that, the uniform limit of these mappings is light…

Metric Geometry · Mathematics 2018-01-31 E. A. Sevost'yanov , S. A. Skvortsov

We solve the isomorphism problem for the whole class of Lins-Mandel gems (graphs encoded manifolds). We also present certain homeomorphisms of branched cyclic coverings of two-bridge hyperbolic links. As a consequence, we prove that, in in…

Geometric Topology · Mathematics 2007-05-23 Sostenes Lins , Michele Mulazzani

By introducing various topologies on the homotopy groups of a topological space, some researchers make these well known notions in algebraic topology more useful and powerful. In this paper, first we recall and review some known topologies…

Algebraic Topology · Mathematics 2026-02-25 Naghme Shahami , Behrooz Mashayekhy

In Gromov's treatise Partial Differential Relations (volume 9 of Ergebnisse der Mathematik und ihrer Grenzgebiete (3), 1986), a continuous map between Riemannian manifolds is called isometric if it preserves the length of rectifiable…

Analysis of PDEs · Mathematics 2014-08-29 Bernd Kirchheim , Emanuele Spadaro , Laszlo Szekelyhidi

We will describe some results regarding the algorithmic nature of homeomorphism problems for manifolds; in particular, the following theorem. Theorem 1: Every PL or smooth simply connected manifold M^n of dimension n at least 5 can be…

Geometric Topology · Mathematics 2016-09-07 Alexander Nabutovsky , Shmuel Weinberger

The {\em topological symmetry group} of an embedding $\Gamma$ of an abstract graph $\gamma$ in $S^3$ is the group of automorphisms of $\gamma$ which can be realized by homeomorphisms of the pair $(S^3, \Gamma)$. These groups are motivated…

Geometric Topology · Mathematics 2023-06-26 Deion Elzie , Samir Fridhi , Blake Mellor , Daniel Silva , Robin Wilson

This expository note describes two convenient techniques in the context of homotopy type theory for proving and formalizing that a given map is an equivalence. The first technique decomposes the map as a series of basic equivalences, while…

Logic in Computer Science · Computer Science 2025-09-09 Tom de Jong

We study singularities of constant positive Gaussian curvature surfaces and determine the way they bifurcate in generic 1-parameter families of such surfaces. We construct the bifurcations explicitly using loop group methods. Constant…

Differential Geometry · Mathematics 2018-09-06 David Brander , Farid Tari

We prove that two proper holomorphic polynomial maps between bounded symmetric domains of classical type which preserve the origin are equivalent if and only if they are isotropically equivalent.

Complex Variables · Mathematics 2015-01-19 Aeryeogn Seo

The theory of complex trees is introduced as a new approach to study a broad class of self-similar sets. Systems of equations encoded by complex trees tip-to-tip equivalence relations are used to obtain one-parameter families of connected…

Dynamical Systems · Mathematics 2019-11-13 Bernat Espigule

In this paper we consider two connected closed Haken manifolds denoted by M^3 and N^3, with the same Gromov simplicial volume. We give a simple homological criterion to decide when a given map f: M^3-->N^3 between M^3 and N^3 can be changed…

Geometric Topology · Mathematics 2014-10-01 Pierre Derbez

Maximum bipartite matching is a fundamental algorithmic problem which can be solved in polynomial time. We consider a natural variant in which there is a separation constraint: the vertices on one side lie on a path or a grid, and two…

Data Structures and Algorithms · Computer Science 2023-03-20 Pasin Manurangsi , Erel Segal-Halevi , Warut Suksompong
‹ Prev 1 3 4 5 6 7 10 Next ›