Related papers: Curves That Must Be Retraced

We show that a general canonical curve is uniquely determined by the finite set of hyperplanes cutting theta-characteristics on it. Geometrical and combinatorial properties of the moduli space of stable spin curves are proved, which play an…

We prove that there exists $M>0$ such that for any closed rectifiable curve $\Gamma$ in Hilbert space, almost every point in $\Gamma$ is contained in a countable union of $M$ chord-arc curves whose total length is no more than $M$ times the…

We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propagate completely have natural parameters which make them…

We solve a randomized version of the following open question: is there a strictly convex, bounded curve \gamma in the plane such that the number of rational points on \gamma, with denominator $n$, approaches infinity with $n$? Although this…

The computation of short paths in graphs with arc lengths is a pillar of graph algorithmics and network science. In a more diverse world, however, not every short path is equally valuable. For the setting where each vertex is assigned to a…

A simple closed curve $\gamma$ in the real projective plane $P^2$ is called anti-convex if for each point $p$ on the curve, there exists a line which is transversal to the curve and meets the curve only at $p$. We shall prove the relation…

The geometry of the moduli space of stable spin curves is studied, with emphasis on its combinatorial properties. In this context, the standard graph theoretic framework is not just a book-keeping device: some purely combinatorial results…

While self-similar sets have no tangents at any single point, self-affine curves can be smooth. We consider plane self-affine curves without double points and with two pieces. There is an open subset of parameter space for which the curve…

We provide new results and new proofs of results about the torsion of curves in $\mathbb{R}^3$. Let $\gamma$ be a smooth curve in $\mathbb{R}^3$ that is the graph over a simple closed curve in $\mathbb{R}^2$ with positive curvature. We give…

We give examples of sequences of smooth non-isotrivial curves for every genus at least two, defined over a rational function field of positive characteristic, such that the (finite) number of rational points of the curves in the sequence…

We present a matrix-based algorithm for deciding if the parametrization of a curve or a surface is invertible or not, and for computing the inverse of the parametrization if it exists.

The purpose of this note is to prove that there is an algebraic stack U parameterizing all curves. The curves that appear in the algebraic stack U are allowed to be arbitrarily singular, non-reduced, disconnected, and reducible. We also…

It is shown that for a given infinite graph $G$ on countably many vertices, and a compact, infinite set of real numbers $\Lambda$ there is a real symmetric matrix $A$ whose graph is $G$ and its spectrum is $\Lambda$. Moreover, the set of…

Symmetry is a common feature of many combinatorial problems. Unfortunately eliminating all symmetry from a problem is often computationally intractable. This paper argues that recent parameterized complexity results provide insight into…

Let $x=t^n$, $y=\sum_{i=1}^{\infty}a_it^i$ be a parametrisation of the germ of a complex plane analytic curve $\Gamma$ at the origin. Then $\Gamma$ has the implicit equation $f(x,y)=0$ in the neighbourhood of the origin, where $f=\sum…

Every irreducible outer automorphism of the free group of rank r is topologically represented by an irreducible train track map $f$ on some graph $\Gamma$ of rank r. Moreover, $f$ can always be written as a composition of folds and a graph…

The {\em metric dimension} of a graph $\Gamma$ is the least number of vertices in a set with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex. We consider the Grassmann graph…

Let $\Gamma$ be a finite simple graph. If for some integer $n\geqslant 4$, $\Gamma$ is a $K_n$-free graph whose complement has an odd cycle of length at least $2n-5$, then we say that $\Gamma$ is an $n$-exact graph. For a finite group $G$,…

We prove that a planar $C^2$-regular boundary $\Gamma$ can always be parameterized with its closest point projection $\pi$ over a certain collection of edges $\Gamma_h$ in an ambient triangulation, by making simple assumptions on the…

If $\Gamma$ is a graph for which every edge is in exactly one clique of order $\omega$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $\Gamma$. We discover many general…