Related papers: Connecting Polygonizations via Stretches and Twang…

The self-assembly of functionalized (patchy) particles with directional interactions into target structures is still a challenge, despite the significant experimental advances on their synthesis. The self-assembly pathways are typically…

We present an algorithm to unfold any triangulated 2-manifold (in particular, any simplicial polyhedron) into a non-overlapping, connected planar layout in linear time. The manifold is cut only along its edges. The resulting layout is…

We show that the maximal number of singular moves required to pass between any two regularly homotopic planar or spherical curves with at most n crossings, grows quadratically with respect to n. Furthermore, this can be done with all curves…

We construct $(2n+1)\times (2n+1)$ matrices corresponding to a motion of points on the plane from the point of view of Delaunay triangulations. We define a homomorphism from the pure braid group on ($n+3$) strands to the general linear…

We examine the question of whether a collection of random walks on a graph can be coupled so that they never collide. In particular, we show that on the complete graph on n vertices, with or without loops, there is a Markovian coupling…

For any orbifold M, we explicitly construct a simplicial complex S(M) from a given triangulation of the `coarse' underlying space together with the local isotropy groups of M. We prove that, for any local system on M, this complex S(M) has…

We consider a certain sequence of random walks. The state space of the n-th random walk is the set of all strict partitions of n (that is, partitions without equal parts). We prove that, as n goes to infinity, these random walks converge to…

In this paper, orthogonal projection along a geodesic to the chosen k-plane is introduced using edge and Gram matrix of an n-simplex in hyperbolic or spherical n-space. The distance from a point to k-plane is obtained by the orthogonal…

We introduce the polytope of pointed pseudo-triangulations of a point set in the plane, defined as the polytope of infinitesimal expansive motions of the points subject to certain constraints on the increase of their distances. Its…

Recently there has been renewed interest in signed distance bound representations due to their unique properties for 3D shape modelling. This is especially the case for deep learning-based bounds. However, it is beneficial to work with…

For a finite set $S$ of points in the plane and a graph with vertices on $S$ consider the disks with diameters induced by the edges. We show that for any odd set $S$ there exists a Hamiltonian cycle for which these disks share a point, and…

Temporal graphs are graphs where the edge set can change in each time step, and the vertex set stays the same. Exploration of temporal graphs whose snapshot in each time step is a connected graph, called connected temporal graphs, has been…

We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…

We investigate the trajectories of point charges in the background of finite-action vacuum solutions of Maxwell's equations known as knot solutions. More specifically, we work with a basis of electromagnetic knots generated by the so-called…

Deciding whether a family of disjoint axis-parallel line segments in the plane can be linked into a simple polygon (or a simple polygonal chain) by adding segments between their endpoints is NP-hard.

In this paper, we present a polynomial dynamic programming algorithm that tests whether a $n$-vertex directed tree $T$ has an upward planar embedding into a convex point-set $S$ of size $n$. Further, we extend our approach to the class of…

We consider two or more simple symmetric walks on some graphs, e.g. the real line, the plane or the two dimensional comb lattice, and investigate the properties of the distance among the walkers.

In this paper we describe a well-chosen discrete moving frame and their associated invariants along projective polygons in $\RP^n$, and we use them to write explicit general expressions for invariant evolutions of projective $N$-gons. We…

A linkage is a finite graph with lengths assigned to each edge. A planar realization is a map to the plane which preserves edge lengths. It can be thought of as a mechanical device formed from stiff rods and rotating joints. We look at the…

The global stability of oscillator networks has attracted much recent attention. Ordinarily, the oscillators in such studies are motionless; their spatial degrees of freedom are either ignored (e.g. mean field models) or inactive (e.g…