中文
相关论文

相关论文: The geodesic complexity of n-dimensional Klein bot…

200 篇论文

The topological complexity TC(X) is a homotopy invariant which reflects the complexity of the problem of constructing a motion planning algorithm in the space X, viewed as configuration space of a mechanical system. In this paper we…

代数拓扑 · 数学 2008-06-26 Michael Farber , Mark Grant

We prove that the topological complexity of (a motion planning algorithm on) the complement of generic complex essential hyperplane arrangement of $n$ hyperplanes in an $r$-dimensional linear space is min$\{n+1,2r\}$.

几何拓扑 · 数学 2007-05-23 Sergey Yuzvinsky

We study the $\mathbb Z_2$-zero-divisor cup-length, denoted by $\operatorname{zcl}_{\mathbb Z_2}(\widetilde G_{n,3})$, of the Grassmann manifolds $\widetilde G_{n,3}$ of oriented $3$-dimensional vector subspaces in $\mathbb R^n$. Some lower…

代数拓扑 · 数学 2025-10-29 Uroš A. Colović , Branislav I. Prvulović , Marko Radovanović

The goal of the article is to provide different explicit quantifications of the non density of simple closed geodesics on hyperbolic surfaces. In particular, we show that within any embedded metric disk on a surface, lies a disk of radius…

几何拓扑 · 数学 2018-06-05 Peter Buser , Hugo Parlier

Let M be a compact manifold of dimension n with a strictly convex projective structure. We consider the geodesic flow of the Hilbert metric on it, which is known to be Anosov. We prove that its topological entropy is less than n-1, with…

动力系统 · 数学 2009-04-17 Mickaël Crampon

We determine topological complexity of a series of finite spaces which is weakly homotopy equivalent to a circle $S^1$, and give a finite space $X$ satisfying the inequality tc$(X) <$ cat$(X {\times} X)$. This answers two conjectures on…

代数拓扑 · 数学 2023-02-14 Ryusei Yoshise

In this paper we study some cube packing problems. In particular we are interested in compact subsets of $\mathbb{R}^n,n\geq 2$, which contain boundaries of cubes with all side lengths in $(0,1)$. We show here that such sets must have lower…

经典分析与常微分方程 · 数学 2018-01-10 Han Yu

We prove the following conjecture recently formulated by Jakobson, Nadirashvili and Polterovich \cite{JNP}: For any Riemannian metric $g$ on the Klein bottle $\mathbb{K}$ one has $$\lambda\_1 (\mathbb{K}, g) A (\mathbb{K}, g)\le 12 \pi…

度量几何 · 数学 2007-05-23 Ahmad El Soufi , Hector Giacomini , Mustapha Jazar

How hard is it to program $n$ robots to move about a long narrow aisle such that only $w$ of them can fit across the width of the aisle? In this paper, we answer that question by calculating the topological complexity of $\text{conf}(n,w)$,…

代数拓扑 · 数学 2026-02-26 Nicholas Wawrykow

For real projective spaces, (a) the Euclidean immersion dimension, (b) the existence of axial maps, and (c) the topological complexity are known to be three facets of the same problem. But when it comes to embedding dimension, the classical…

代数拓扑 · 数学 2014-10-01 Jesus Gonzalez , Peter Landweber

We compute the $k$-width of a round $2$-sphere for $k=1,\ldots,8$ and we use this result to show that unstable embedded closed geodesics can arise with multiplicity as a min-max critical varifold.

微分几何 · 数学 2016-02-29 Nicolau Sarquis Aiex

Together with the Moebius strip, the Klein bottle is one of the intriguing objects in the universe of geometry, sometimes appearing in non-mathematical contexts too. Until now, several parametrizations of it as a surface immersed in…

微分几何 · 数学 2009-09-30 Gregorio Franzoni

The m-thick part of the modular surface X is the smallest compact subsurface of X with horocycle boundary containing all the closed geodesics which wind around the cusp at most m times. The m-thick parts form a compact exhaustion of X. We…

几何拓扑 · 数学 2023-11-28 Ara Basmajian , Mingkun Liu

The percolation threshold and wrapping probability $R_{\infty}$ for the two-dimensional problem of continuum percolation on the surface of a Klein bottle have been calculated by the Monte Carlo method with the Newman--Ziff algorithm for…

无序系统与神经网络 · 物理学 2015-06-09 V. D. Borman , A. M. Grekhov , V. N. Tronin , I. V. Tronin

We find the minimum number $k=\mu'(\Sigma)$ for any surface $\Sigma$, such that every $\Sigma$-embeddable non-bipartite graph is not $k$-extendable. In particular, we construct the so-called bow-tie graphs $C_6\bowtie P_n$, and show that…

组合数学 · 数学 2015-01-23 Hongliang Lu , David G. L. Wang

Using known results about their integral cohomology ring, we prove that the topological complexity of the space of n-gons in R^3 with prescribed side lengths equals 2n-5, assuming that the space is nonempty and does not contain any…

代数拓扑 · 数学 2015-07-07 Donald M. Davis

Motivated by applications of algebraic geometry, we introduce the Galois width, a quantity characterizing the complexity of solving algebraic equations in a restricted model of computation allowing only field arithmetic and adjoining…

代数几何 · 数学 2025-03-25 Timothy Duff

We consider $L^2$ minimizing geodesics along the group of volume preserving maps $SDiff(D)$ of a given 3-dimensional domain $D$. The corresponding curves describe the motion of an ideal incompressible fluid inside $D$ and are (formally)…

偏微分方程分析 · 数学 2010-11-05 Yann Brenier

We give a short proof of the contractibility of the space of geodesic triangulations with fixed combinatorial type of a convex polygon in the Euclidean plane. Moreover, for any $n>0$, we show that there exists a space of geodesic…

几何拓扑 · 数学 2020-08-04 Yanwen Luo

We give a short proof of the fact that there are no measurable subsets of Euclidean space (in dimension d > 2), which, no matter how translated and rotated, always contain exactly one integer lattice point. In dimension d=2 (the original…

经典分析与常微分方程 · 数学 2007-05-23 Mihail N. Kolountzakis , Michael Papadimitrakis