English
Related papers

Related papers: On the 3-distortion of a path

200 papers

We consider scattering by an obstacle in $\Real^d$, $d\geq 3 $ odd. We show that for the Neumann Laplacian if an obstacle has the same resonances as the ball of radius $\rho$ does, then the obstacle is a ball of radius $\rho$. We give…

Mathematical Physics · Physics 2008-01-07 T. J. Christiansen

We prove a type of systolic inequality for embeddings of $T^2$ in $\mathbb{R}^3$. In particular, a highly twisted $T^2$ embedded in $\mathbb{R}^3$ must contain a non-contractible loop of small $\mathbb{R}^3$-diameter.

Differential Geometry · Mathematics 2026-04-15 Sahana Vasudevan

We show that for any natural number $k \ge 1$, any oriented graph $D$ of minimum semidegree at least $(3k- 2)/4$ contains an antidirected path of length $k$. In fact, a slightly weaker condition on the semidegree sequence of $D$ suffices,…

Combinatorics · Mathematics 2024-02-07 Tereza Klimošová , Maya Stein

We consider the problem of distortion minimal morphing of $n$-dimensional compact connected oriented smooth manifolds without boundary embedded in $\R^{n+1}$. Distortion involves bending and stretching. In this paper, minimal distortion…

Differential Geometry · Mathematics 2010-11-17 Oksana Bihun , Carmen Chicone

Let OT_d(n) be the smallest integer N such that every N-element point sequence in R^d in general position contains an order-type homogeneous subset of size n, where a set is order-type homogeneous if all (d+1)-tuples from this set have the…

Combinatorics · Mathematics 2014-01-14 Andrew Suk

We consider the problem of morphing between two planar drawings of the same triangulated graph, maintaining straight-line planarity. A paper in SODA 2013 gave a morph that consists of $O(n^2)$ steps where each step is a linear morph that…

Computational Geometry · Computer Science 2014-11-25 Fidel Barrera-Cruz , Penny Haxell , Anna Lubiw

In the \emph{$k$-Diameter-Optimally Augmenting Tree Problem} we are given a tree $T$ of $n$ vertices as input. The tree is embedded in an unknown \emph{metric} space and we have unlimited access to an oracle that, given two distinct…

Data Structures and Algorithms · Computer Science 2023-05-30 Davide Bilò , Luciano Gualà , Stefano Leucci , Luca Pepè Sciarria

Cohen et al. conjectured that for every oriented cycle $C$ there exist an integer $f(C)$ such that every strong $f(C)$-chromatic digraph contains a subdivision of $C$. El Joubbeh confirmed this conjecture for Hamiltonian digraphs. Indeed,…

Combinatorics · Mathematics 2024-09-19 Abbas Alhakim , Mouhamad El Joubbeh

We consider mappings satisfying an upper bound for the distortion of families of curves. We establish lower bounds for the distortion of distances under such mappings. As applications, we obtain theorems on the discreteness of the limit…

Complex Variables · Mathematics 2024-11-07 Evgeny Sevost'yanov , Denys Romash , Nataliya Ilkevych

For a given real number $\alpha$, let us place the fractional parts of the points $0, \alpha, 2 \alpha,$ $ \cdots, (N-1) \alpha$ on the unit circle. These points partition the unit circle into intervals having at most three lengths, one…

Number Theory · Mathematics 2018-06-08 Valérie Berthé , Dong Han Kim

We bound the mean distance in a connected graph which is not a tree in function of its order $n$ and its girth $g$. On one hand, we show that mean distance is at most $\frac{n+1}{3}-\frac{g(g^2-4)}{12n(n-1)}$ if $g$ is even and at most…

Discrete Mathematics · Computer Science 2013-01-07 Siham Bekkai , Mekkia Kouider

We state an open problem in the theory of diversities: what is the worst case minimal distortion embedding of a diversity on $n$ points in $\ell_1$. This problem is the diversity analogue of a famous problem in metric geometry: what is the…

Metric Geometry · Mathematics 2017-12-07 David Bryant , Paul Tupper

There are very few explicit evaluations of path integrals for topological gauge theories in more than 3 dimensions. Here we provide such a calculation for the path integral representation of the Ray-Singer Torsion of a flat connection on a…

High Energy Physics - Theory · Physics 2024-02-23 Matthias Blau , Mbambu Kakona , George Thompson

In this article, we study rectifying curves in arbitrary dimensional Euclidean space. A curve is said to be a rectifying curve if, in all points of the curve, the orthogonal complement of its normal vector contains a fixed point. We…

Differential Geometry · Mathematics 2018-06-29 Stijn Cambie , Wendy Goemans , Iris Van den Bussche

Given an $n$-point metric space $(X,d_X)$, a tree cover $\mathcal{T}$ is a set of $|\mathcal{T}|=k$ trees on $X$ such that every pair of vertices in $X$ has a low-distortion path in one of the trees in $\mathcal{T}$. Tree covers have been…

Data Structures and Algorithms · Computer Science 2025-11-19 Yu Chen , Zihan Tan , Hangyu Xu

The set of osculating circles of a given curve in $\SS^3$ forms a curve in the set of oriented circles in $\SS^3$. We show that its "${\frac12}$-dimensional measure" with respect to the pseudo-Riemannian structure of the set of circles is…

Differential Geometry · Mathematics 2016-03-21 Rémi Langevin , Jun O'Hara

We introduce a space of $L^2$ vector fields with bounded mean oscillation whose normal component to the boundary is well-controlled. We establish its Helmholtz decomposition in the case when the domain is a perturbed $C^3$ half space in…

Analysis of PDEs · Mathematics 2023-05-10 Yoshikazu Giga , Zhongyang Gu

Let C_n be the origin-containing cluster in subcritical percolation on the lattice (1/n) Z^d, viewed as a random variable in the space Omega of compact, connected, origin-containing subsets of R^d, endowed with the Hausdorff metric delta.…

Probability · Mathematics 2007-05-23 Yevgeniy Kovchegov , Scott Sheffield

We consider critical points of the geometric obstacle problem on vectorial maps $u: \mathbb{B}^2 \subset \mathbb{R}^2 \to \mathbb{R}^N$ \[ \int_{\mathbb{B}^2} |\nabla u|^2 \quad \mbox{subject to $u \in \mathbb{R}^N \backslash…

Analysis of PDEs · Mathematics 2020-02-03 Sujin Khomrutai , Armin Schikorra

We show that the following algorithmic problem is decidable: given a $2$-dimensional simplicial complex, can it be embedded (topologically, or equivalently, piecewise linearly) in $\mathbf{R}^3$? By a known reduction, it suffices to decide…

Geometric Topology · Mathematics 2014-02-06 Jiří Matoušek , Eric Sedgwick , Martin Tancer , Uli Wagner
‹ Prev 1 8 9 10 Next ›