Related papers: On the 3-distortion of a path

It is shown that every complete n-vertex simple topological graph has at least Omega(n^{1/3}) pairwise disjoint edges, and these edges can be found in polynomial time. This proves a conjecture of Pach and T\'oth.

We derive exactly the number of Hamiltonian paths H(n) on the two dimensional Sierpinski gasket SG(n) at stage $n$, whose asymptotic behavior is given by $\frac{\sqrt{3}(2\sqrt{3})^{3^{n-1}}}{3} \times (\frac{5^2 \times 7^2 \times…

In this paper Witten type deformation of osp(1/2) algbera is introduced and its realization and matrix representation are obtained. The matrix representation is shown to be possible only when the dimension is odd.

The well known formulas express the curvature and the torsion of a curve in $R^3$ in terms of euclidean invariants of its derivatives. We obtain expressions of this kind for all curvatures of curves in $R^n$. It follows that a curve in…

Verifying a conjecture of Petkov{\v{s}}ec, we prove that the lettericity of an n-vertex path is precisely $\left\lfloor \frac{n+4}{3}\right\rfloor$.

We introduce and study a new graph representation where vertices are embedded in three or more dimensions, and in which the edges are drawn on the projections onto the axis-parallel planes. We show that the complete graph on $n$ vertices…

We study "tricolor percolation" on the regular tessellation of R^3 by truncated octahedra, which is the three-dimensional analog of the hexagonal tiling of the plane. We independently assign one of three colors to each cell according to a…

Let $\mathbf{p}$ be a configuration of $n$ points in $\mathbb{R}^d$ for some $n$ and some $d \ge 2$. Each pair of points defines an edge, which has a Euclideanlength in the configuration. A path is an ordered sequence of the points, and a…

As an extension of Polya's classical result on random walks on the square grids ($\Z^d$), we consider a random walk where the steps, while still have unit length, point to different directions. We show that in dimensions at least 4, the…

We consider the complexity of Delaunay triangulations of sets of points in R^3 under certain practical geometric constraints. The spread of a set of points is the ratio between the longest and shortest pairwise distances. We show that in…

Given a set S of n points in R^D, and an integer k such that 0 <= k < n, we show that a geometric graph with vertex set S, at most n - 1 + k edges, maximum degree five, and dilation O(n / (k+1)) can be computed in time O(n log n). For any…

We consider the tree-reduced path of symmetric random walk on $\ZZ^{d}$. It is interesting to ask about the number of turns $T_n$ in the reduced path after $n$ steps. This question arises from inverting signature for lattice paths. We show…

In this paper we study the integrability of 3-d Bohmian trajectories of a system of quantum harmonic oscillators. We show that the initial choice of quantum numbers is responsible for the existence (or not) of an integral of motion which…

This note constructs sharp obstructions for stabilized symplectic embeddings of an ellipsoid into a ball, in the case when the initial four-dimensional ellipsoid has `eccentricity' of the form 3n-1 for some integer n.

We prove that, with high probability, any $2$-edge-colouring of a random tournament on $n$ vertices contains a monochromatic path of length $\Omega(n / \sqrt{\log n})$. This resolves a conjecture of Ben-Eliezer, Krivelevich and Sudakov and…

A separating path system for a graph $G$ is a collection $\mathcal{P}$ of paths in $G$ such that for every two edges $e$ and $f$ in $G$, there is a path in $\mathcal{P}$ that contains $e$ but not $f$. We show that every $n$-vertex graph has…

Graphs of bounded degeneracy are known to contain induced paths of order $\Omega(\log \log n)$ when they contain a path of order $n$, as proved by Ne\v{s}et\v{r}il and Ossona de Mendez (2012). In 2016 Esperet, Lemoine, and Maffray…

We show that the perturbative expansion of the two-level correlation function, $R(\omega)$, in disordered conductors can be understood semiclassically in terms of self-intersecting particle trajectories. This requires the extension of the…

Let X be a path-connected topological space admitting a universal cover. Let Homeo(X,a) denote the group of homeomorphisms of X preserving degree one cohomology class a. We investigate the distortion in Homeo(X,a). Let g be an element of…

In new progress on conjectures of Stein, and Addario-Berry, Havet, Linhares Sales, Reed and Thomass\'e, we prove that every oriented graph with all in- and out-degrees greater than 5k/8 contains an alternating path of length k. This…