Related papers: Polygonal Chains Cannot Lock in 4D

Let $G$ be a connected graph and $L(G)$ the set of all integers $k$ such that $G$ contains a spanning tree with exactly $k$ leaves. We show that for a connected graph $G$, the set $L(G)$ is contiguous. It follows from work of Chen, Ren, and…

We prove that deciding whether the edge set of a graph can be partitionned into two spanning trees with orientation constraints is NP-complete. If P $\neq$ NP then this disproves a conjecture of Recski.

In this paper we investigate the discrete version of the classical hanging chain problem. We generalize the problem, by allowing for arbitrary mass and length of each link. We show that the shape of the chain can be obtained by solving a…

We consider the problem of finding an optimal piecewise linear path (polygonal line) connecting two given points with the possibility of making n turns at some points (the absolute value of each turn angle does not exceed a prescribed…

We show that the training problem of a deep linear neural network under the squared loss admits an exact convex reformulation in a lifted space over a generalized completely positive cone. The reformulation has the same optimal value as the…

If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex…

It has recently been shown that the problem of testing global convexity of polynomials of degree four is {strongly} NP-hard, answering an open question of N.Z. Shor. This result is minimal in the degree of the polynomial when global…

Let $G=(V,E)$ be a simple, unweighted, connected graph. Let $d(u,v)$ denote the distance between vertices $u,v$. A resolving set of $G$ is a subset $S$ of $V$ such that knowing the distance from a vertex $v$ to every vertex in $S$ uniquely…

In the Metric Dimension problem, one asks for a minimum-size set $R$ of vertices such that for any pair of vertices of the graph, there is a vertex from $R$ whose two distances to the vertices of the pair are distinct. This problem has…

In a rooted tree, we call a vertex {\em balanced} if it is at equal distance from all its descendant leaves. We count balanced vertices in three different tree varieties. For decreasing binary trees, we can prove that the probability that a…

In the first part of this work the classical and statistical aspects of the dynamics of an inextensible chain in three dimensions are investigated. In the second part the special case of a chain admitting only fixed angles with respect to…

In this note we consider $2$-dimensional lattice random walks killed at leaving a wedge with opening $\alpha\in(0,\pi]$. Assuming that the walk cannot jump over the boundary of the wedge we prove that there exists a harmonic polynomial if…

Let $C_{k_1}, \ldots, C_{k_n}$ be cycles with $k_i\geq 2$ vertices ($1\le i\le n$). By attaching these $n$ cycles together in a linear order, we obtain a graph called a polygon chain. By attaching these $n$ cycles together in a cyclic…

We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have…

The complete set of solutions of two dimensional classical string theory are constructed for any curved spacetime. They describe folded strings moving in curved spacetime. Surprizing stringy behavior becomes evident at singularities such as…

This article demonstrates that convolutional operation can be converted to matrix multiplication, which has the same calculation way with fully connected layer. The article is helpful for the beginners of the neural network to understand…

Herein, we describe new methods to produce colloidal particle chains of three stiffness regimes that can be observed on a single-particle level, that is, on the level of the monomers that make up the chain; the chains can even be observed…

We concern the problem of modifying the edge lengths of a tree in minimum total cost so that the prespecified $p$ vertices become the $p$-maxian with respect to the new edge lengths. This problem is called the inverse $p$-maxian problem on…

Let P be a cyclic n-gon with n\ge3, the central angles \th_0,...,\th_{n-1} in (-\pi,\pi], and the winding number w:=(\th_0+...+\th_{n-1})/(2\pi). The vertices of P are assumed to be all distinct from one another. It is then proved that P is…

A string action is considered in four spacetime dimensions which is obtained by dimensionally reducing the ten dimensional effective action. The equations of motion admit string like solutions. The symmetry properties of the four…