相关论文: Algorithms for Contractibility of Compressed Curve…

In this paper, an algorithm for determining 3-colorability, i.e. the decision problem (YES/NO), in planar graphs is presented. The algorithm, although not exact (it could produce false positives) has two very important features: (i) it has…

We initiate a general study of what we call orientation completion problems. For a fixed class C of oriented graphs, the orientation completion problem asks whether a given partially oriented graph P can be completed to an oriented graph in…

We prove a version of Gromov's compactness theorem for pseudo-holomorphic curves which holds locally in the target symplectic manifold. This result applies to sequences of curves with an unbounded number of free boundary components, and in…

Constrained coding is a fundamental field in coding theory that tackles efficient communication through constrained channels. While channels with fixed constraints have a general optimal solution, there is increasing demand for parametric…

In the classic polyline simplification problem we want to replace a given polygonal curve $P$, consisting of $n$ vertices, by a subsequence $P'$ of $k$ vertices from $P$ such that the polygonal curves $P$ and $P'$ are as close as possible.…

Let $(\Sigma,\mathbb{M},\mathbb{P})$ be a surface with marked points $\mathbb{M}\subseteq \partial\Sigma\neq\varnothing$ and punctures $\mathbb{P}\subseteq\Sigma\setminus\partial\Sigma$. In this paper we show that for every curve $\gamma$…

We find a sharp bound for the order of the automorphism group of a stable curve of genus $g$ with $3g-3$ nodes, and a sharp bound for the order of the automorphism group of such a curve with all smooth components. Combined with the results…

We consider the problem of deciding whether an input graph G admits a topological embedding into a two-dimensional simplicial complex C. This problem includes, among others, the embeddability problem of a graph on a surface and the…

We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3-list-coloring. Our algorithms are based on a constraint satisfaction (CSP) formulation of these problems; 3-SAT is equivalent to…

We study pseudo-classical knots in the non-orientable thickening of a non-orientable surface, specifically knots that are orientation-preserving paths in a non-orientable $3$-manifold of the form (non-orientable surface) $\times$ $[0, 1]$.…

The presence of task constraints imposes a significant challenge to motion planning. Despite all recent advancements, existing algorithms are still computationally expensive for most planning problems. In this paper, we present Constrained…

Let P be a polygonal curve in R^d of length n, and S be a point-set of size k. We consider the problem of finding a polygonal curve Q on S such that all points in S are visited and the Fr\'echet distance from $P$ is less than a given…

The conformal nature of smooth curves in $\mathbb{R}^3$ is characterised by conformal length, curvature and torsion. We present a derivation of these conformal parameters via a limiting process using inscribed polygons with circular edges .…

In the last decades, many mathematicians have studied the curl operator in compact three-manifolds , mainly the structure of its spectrum and some isoperimetric problems associated with it. In this paper, we will see that all the compact…

Abstract notions of convexity over the vertices of a graph, and corresponding notions of halfspaces, have recently gained attention from the machine learning community. In this work we study monophonic halfspaces, a notion of graph…

In this manuscript we introduce a method to measure entanglement of curves in 3-space that extends the notion of knot and link polynomials to open curves. We define the bracket polynomial of curves in 3-space and show that it has real…

Many NP-hard graph problems become easy for some classes of graphs. For example, coloring is easy for bipartite graphs, but NP-hard in general. So we can ask question like when does a hard problem become easy? What is the minimum…

We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…

The circuit evaluation problem (also known as the compressed word problem) for finitely generated linear groups is studied. The best upper bound for this problem is $\mathsf{coRP}$, which is shown by a reduction to polynomial identity…

A non-singular connected algebraic curve $A$ in a simply connected algebraic surface $X$ can be knotted so that its homology class and the fundamental group of its complement in $X$ is preserved, provided $A$ is sufficiently complex (not…