English
Related papers

Related papers: Directed topological complexity of spheres

200 papers

We prove that if a complete connected $n$-dimensional Riemannian manifold $M$ has radial sectional curvature at a base point $p\in M$ bounded from below by the radial curvature function of a two-sphere of revolution $\widetilde M$ belonging…

Differential Geometry · Mathematics 2016-07-19 Nathaphon Boonnam

We obtain an explicit formula for the best lower bound for the higher topological complexity, TC_k(P^n), of real projective space implied by mod 2 cohomology.

Algebraic Topology · Mathematics 2017-09-20 Donald M Davis

The classic result by Fortune, Hopcroft, and Wyllie [TCS~'80] states that the directed disjoint paths problem is NP-complete even for two pairs of terminals. Extending this well-known result, we show that the directed disjoint paths problem…

Discrete Mathematics · Computer Science 2025-07-17 Matthias Bentert , Dario Cavallaro , Amelie Heindl , Ken-ichi Kawarabayashi , Stephan Kreutzer , Johannes Schröder

In analogy to classical spherical t-design points, we introduce the concept of t-design curves on the sphere. This means that the line integral along a t-design curve integrates polynomials of degree t exactly. For low degrees we construct…

Metric Geometry · Mathematics 2023-06-26 Martin Ehler , Karlheinz Gröchenig

We prove a topological extension of Dirac's theorem suggested by Gowers in 2005: for any connected, closed surface $\mathscr{S}$, we show that any two-dimensional simplicial complex on $n$ vertices in which each pair of vertices belongs to…

Combinatorics · Mathematics 2022-06-14 Agelos Georgakopoulos , John Haslegrave , Richard Montgomery , Bhargav Narayanan

The combination of words ``discrete curvature'' is only an apparent contradiction. In this survey we describe curvature notions associated with polygons, polyhedral surfaces, and with abstract polyhedral manifolds. Several theorems about…

Differential Geometry · Mathematics 2025-02-14 Ivan Izmestiev

We prove the formula $TC(G\ast H)=\max\{TC(G), TC(H), cd(G\times H)\}$ for the topological complexity of the free product of discrete groups with cohomological dimension >2.

Algebraic Topology · Mathematics 2017-11-02 Alexander Dranishnikov , Rustam Sadykov

The work develops further the theory of the following inversion problem, which plays the central role in the rapidly developing area of thermoacoustic tomography and has intimate connections with PDEs and integral geometry: {\it Reconstruct…

Classical Analysis and ODEs · Mathematics 2011-08-04 Yuri A. Antipov , Ricardo Estrada , Boris Rubin

Let $X$ be a compact real algebraic set of dimension $n$. We prove that every Euclidean continuous map from $X$ into the unit $n$-sphere can be approximated by regulous map. This strengthens and generalizes previously known results.

Algebraic Geometry · Mathematics 2017-06-16 Maciej Zieliński

We establish a stable homotopy-theoretic version of a recent result of Farber and Weinberger on the fibrewise topological complexity of sphere bundles and prove, by closely parallel methods, a similar result for real, complex and…

Algebraic Topology · Mathematics 2023-05-23 M. C. Crabb

Let N(n, t) be the minimal number of points in a spherical t-design on the unit sphere S^n in R^{n+1}. For each n >= 3, we prove a new asymptotic upper bound N(n, t) <= C(n)t^{a_n}, where C(n) is a constant depending only on n, a_3 <= 4,…

Numerical Analysis · Mathematics 2008-11-04 Andriy V. Bondarenko , Maryna S. Viazovska

We consider strongly-connected directed networks of identical synchronous, finite-state processors with in- and out-degree uniformly bounded by a network constant. Via a straightforward extension of Ostrovsky and Wilkerson's Backwards…

Distributed, Parallel, and Cluster Computing · Computer Science 2007-05-23 Darin Goldstein

We consider the problem of decomposing the edges of a directed graph into as few paths as possible. There is a natural lower bound for the number of paths needed in an edge decomposition of a directed graph $D$ in terms of its degree…

Combinatorics · Mathematics 2021-09-29 Alberto Espuny Díaz , Viresh Patel , Fabian Stroh

The edge-to-edge tilings of the sphere by congruent polygons, where all edges are straight, have been completely classified. We classify the curvilinear version of the similar triangular tilings, where the edges may not be straight, and…

Combinatorics · Mathematics 2026-01-14 Keyi Jin , Linming Lu , Erxiao Wang , Lijuan Wu , Min Yan

We classify edge-to-edge tilings of the sphere by congruent almost equilateral pentagons, in which four edges have the same length. Together with our earlier classifications of edge-to-edge tilings of the sphere by congruent equilateral…

Combinatorics · Mathematics 2024-02-09 Hoi Ping Luk , Min Yan

We consider the curve graph in the cases where it is not a Farey graph, and show that its Gromov boundary is linearly connected. For a fixed center point c and radius r, we define the sphere of radius r to be the induced subgraph on the set…

Geometric Topology · Mathematics 2024-08-07 Alex Wright

We have identified some necessary conditions for the existence of rigid sphere designs. In particular, we have successfully resolved the conjecture proposed by [Ban87]; Given fixed positive integers t and d, we show that there exist only…

Combinatorics · Mathematics 2024-03-26 Yuhi Kamio

The optical conductivity for the surface excitations for a Topological Insulator as a function of the chemical potential and disorder is considered. Due to the time reversal symmetry the chiral metallic surface states are protected against…

Mesoscale and Nanoscale Physics · Physics 2013-02-19 D. Schmeltzer , K. Ziegler

We develop a recursive formula for counting the number of rectangulations of a square, i.e the number of combinatorially distinct tilings of a square by rectangles. Our formula specializes to give a formula counting generic rectangulations,…

Combinatorics · Mathematics 2012-09-11 Jim Conant , Tim Michaels

Let $E$ be a smooth cubic. A plane curve $D$ is said to be an $n$-contact curve to $E$ if the intersection multiplicities at each intersection point between $E$ and $D$ is $n$. In this note, we give an algorithm to produce $n$-contact…

Algebraic Geometry · Mathematics 2020-09-01 Ai Takahashi , Hiro-o Tokunaga
‹ Prev 1 8 9 10 Next ›