Related papers: The complexity of pinning simple multiloops
This paper is devoted to advancing the theoretical understanding of the iterated immediate snapshot (IIS) complexity of the Weak Symmetry Breaking task (WSB). Our rather unexpected main theorem states that there exist infinitely many values…
In a statistical cluster or loop model such as percolation, or more generally the Potts models or O(n) models, a pinch point is a single bulk point where several distinct clusters or loops touch. In a polygon P harboring such a model in its…
On an orientable surface $S$, consider a collection $\Gamma$ of closed curves. The (geometric) intersection number $i_S(\Gamma)$ is the minimum number of self-intersections that a collection $\Gamma'$ can have, where $\Gamma'$ results from…
We study the complexity of symmetric assembly puzzles: given a collection of simple polygons, can we translate, rotate, and possibly flip them so that their interior-disjoint union is line symmetric? On the negative side, we show that the…
We present an efficient algorithm for a problem in the interface between clustering and graph embeddings. An embedding $\varphi:G\rightarrow M$ of a graph $G$ into a 2-manifold $M$ maps the vertices in $V(G)$ to distinct points and the…
In this note, we investigate the relation between double points and complex points of immersed surfaces in almost-complex 4-manifolds and show how estimates for the minimal genus of embedded surfaces lead to inequalities between the number…
Totally real immersions $f$ of a closed real surface $\Sigma$ in an almost complex surface $M$ are completely classified, up to homotopy through totally real immersions, by suitably defined homotopy classes $\frak{M}(f)$ of mappings from…
Let $ \B^{n+1} \subset \C^{n+1}$ be the unit ball in a complex Euclidean space, and let $ \Sigma^n = \partial \B^{n+1} = S^{2n+1}$. Let $ f: \Sigma^n \hook \Sigma^{N}$ be a local CR immersion.If $ N-n<2n-1$, the asymptotic vectors of the…
Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…
Geometric embedding of graphs in a point set in the plane is a well known problem. In this paper, the complexity of a variant of this problem, where the point set is bounded by a simple polygon, is considered. Given a point set in the plane…
We establish the existence of a non-trivial, branched immersion of a closed Riemann surface $\Sigma$ with constant mean curvature (CMC) $H$ into any closed, orientable 3-manifold $\mathcal{M}$, for almost every prescribed value of $H$. The…
In this paper we study the complexity of the following problems: Given a colored graph X=(V,E,c), compute a minimum cardinality set S of vertices such that no nontrivial automorphism of X fixes all vertices in S. A closely related problem…
Graph labeling problems have been widely studied in the last decades and have a vast area of application. In this work, we study the recently introduced S-labeling problem, in which the nodes get labeled using labels from 1 to |V | and for…
Let $N$ be a compact, connected, nonorientable surface of genus $g$ with $n$ boundary components, and $\mathcal{C}(N)$ be the complex of curves of $N$. Suppose that $g + n \leq 3$ or $g + n \geq 5$. If $\lambda : \mathcal{C}(N) \rightarrow…
In the packing-constrained point covering problem, PC^2, one seeks configurations of points in the plane that cannot all be covered by a packing arrangement of unit disks. We consider in particular the problem of finding the minimum number…
Given two triangulations of a convex polygon, computing the minimum number of flips required to transform one to the other is a long-standing open problem. It is not known whether the problem is in P or NP-complete. We prove that two…
In this paper we consider an inverse problem of determining a minimal surface embedded in a Riemannian manifold. We show under a topological condition that if $\Sigma$ is a $2$-dimensional embedded minimal surface, then the knowledge of the…
To establish a unified framework for studying both discrete and continuous coupling distributions, we introduce the {\it binomial} spin glass, a class of models where the couplings are sums of $m$ identically distributed Bernoulli random…
We compute the complexity (logarithm of the number of TAP states) associated with minima and index-one saddle points of the TAP free energy. Higher-index saddles have smaller complexities. The two leading complexities are equal, consistent…
An obstacle $K \subset \R^n,\: n \geq 3,$ $n$ odd, is called trapping if there exists at least one generalized bicharacteristic $\gamma(t)$ of the wave equation staying in a neighborhood of $K$ for all $t \geq 0.$ We examine the…