Related papers: On the 3-distortion of a path

Orientation estimation is a fundamental task in 3D shape analysis which consists of estimating a shape's orientation axes: its side-, up-, and front-axes. Using this data, one can rotate a shape into canonical orientation, where its…

In this paper we merge recent developments on exact algorithms for finding an ordering of vertices of a given graph that minimizes bandwidth (the BANDWIDTH problem) and for finding an embedding of a given graph into a line that minimizes…

Given a hypergraph $H$, the size-Ramsey number $\hat{r}_2(H)$ is the smallest integer $m$ such that there exists a graph $G$ with $m$ edges with the property that in any colouring of the edges of $G$ with two colours there is a…

Given $n$ pairwise openly disjoint triangles in 3-space, their vertical depth relation may contain cycles. We show that, for any $\varepsilon>0$, the triangles can be cut into $O(n^{3/2+\varepsilon})$ connected semi-algebraic pieces, whose…

The well-known Eulerian path problem can be solved in polynomial time (more exactly, there exists a linear time algorithm for this problem). In this paper, we model the problem using a string matching framework, and then initiate an…

We introduce an invariant linked to some foundational questions in geometric measure theory and provide bounds on this invariant by decomposing an arbitrary cycle into uniformly rectifiable pieces. Our invariant measures the difficulty of…

We study the number $N\_n$ of open paths of length $n$ in supercritical oriented percolation on $\Zd \times \N$, with $d \ge 1$. We prove that on the percolation event $\{\inf N\_n\textgreater{}0\}$, $N\_n^{1/n}$ almost surely converges to…

We explore the geometric interpretation of the twisted index of 3d ${\mathcal N} =4$ gauge theories on $S^1\times \Sigma$ where $\Sigma$ is a closed Riemann surface. We focus on a rich class of supersymmetric quiver gauge theories that have…

A Hamiltonian embedding is an embedding of a graph $G$ such that the boundary of each face is a Hamiltonian cycle of $G$. It is shown that the hypercube graph $Q_n$ admits such an embedding on an orientable surface when $n$ is a power of 2.…

We prove that for certain families of semi-algebraic convex bodies in 3 dimensions, the convex hull of $n$ disjoint bodies has $O(n\lambda_s(n))$ features, where $s$ is a constant depending on the family: $\lambda_s(n)$ is the maximum…

In 2012, Ne\v{s}et\v{r}il and Ossona de Mendez proved that graphs of bounded degeneracy that have a path of order $n$ also have an induced path of order $\Omega(\log \log n)$. In this paper we give an almost matching upper bound by…

We consider the following question: Given $n$ lines and $n$ circles in $\mathbb{R}^3$, what is the maximum number of intersection points lying on at least one line and on at least one circle of these families. We prove that if there are no…

It is shown that one can count $k$-edge paths in an $n$-vertex graph and $m$-set $k$-packings on an $n$-element universe, respectively, in time ${n \choose k/2}$ and ${n \choose mk/2}$, up to a factor polynomial in $n$, $k$, and $m$; in…

A conjecture of the first two authors is that $n$ matchings of size $n$ in any graph have a rainbow matching of size $n-1$. We prove a lower bound of $\frac{2}{3}n-1$, improving on the trivial $\frac{1}{2}n$, and an analogous result for…

We study the following problem: Given $k$ paths that share the same vertex set, is there a simultaneous geometric embedding of these paths such that each individual drawing is monotone in some direction? We prove that for any dimension $d…

The study of graph discrepancy problems, initiated by Erd\H{o}s in the 1960s, has received renewed attention in recent years. In general, given a $2$-edge-coloured graph $G$, one is interested in embedding a copy of a graph $H$ in $G$ with…

The distortion of a curve measures the maximum arc/chord length ratio. Gromov showed any closed curve has distortion at least pi/2 and asked about the distortion of knots. Here, we prove that any nontrivial tame knot has distortion at least…

We show the validity of Nachman's procedure (Ann. Math. 128(3):531-576, 1988) for reconstructing a conductivity function $\gamma$ in a smooth bounded domain $\Omega \subset \mathbb{R}^n$ ($n\geq 3$) from its Dirichlet-to-Neumann map…

An oriented graph is called $k$-anti-traceable if the subdigraph induced by every subset with $k$ vertices has a hamiltonian anti-directed path. In this paper, we consider an anti-traceability conjecture. In particular, we confirm this…

What is the path of minimum expected length for escaping a planar convex region Omega? We rigorously obtain best 2-segment and 3-segment solutions when Omega is an infinite strip, and numerically examine 2-segment solutions when Omega is a…