Related papers: A Generalized Carpenter's Rule Theorem for Self-To…
The operation of transforming one spanning tree into another by replacing an edge has been considered widely, both for general and planar straight-line graphs. For the latter, several variants have been studied (e.g., edge slides and edge…
In this paper, we bridge this gap systematically by establishing an explicit correspondence between continuum topological field theory and microscopic lattice constructions of three-dimensional non-Abelian topological orders. While Wilson…
A temporal graph is a graph whose edges appear at certain points in time. These graphs are temporally connected (in class TC) if all vertices can reach each other by temporal paths (traversing the edges in chronological order). Reachability…
This paper presents graph theoretic conditions for the controllability and accessibility of bilinear systems over the special orthogonal group, the special linear group and the general linear group, respectively, in the presence of drift…
We consider general locally-interacting arbitrary-dimensional lattice spin systems that are gapped for any system size. We show under reasonable conditions that nondegenerate ground states of such systems obey the entanglement area law. In…
When a Coulombic fluid is confined between two parallel charged plates, an exact relation links the difference of ionic densities at contact with the plates, to the surface charges of these boundaries. It no longer applies when the…
Understanding collective phenomena calls for tractable descriptions of correlations in assemblies of strongly interacting constituents. Capturing the essence of their self-consistency is central. The parquet theory admits a maximum level of…
A closure system with the anti-exchange axiom is called a convex geometry. One geometry is called a sub-geometry of the other if its closed sets form a sublattice in the lattice of closed sets of the other. We prove that convex geometries…
We show that 4-connected plane triangulations can be redrawn such that edges are represented by straight segments and the vertices are covered by a set of at most $\sqrt{2n}$ lines each of them horizontal or vertical. The same holds for all…
Temporal networks are a class of time-varying networks, which change their topology according to a given time-ordered sequence of static networks (known as subsystems). This paper investigates the reachability and controllability of…
Autonomous systems typically leverage layered control architectures with a combination of discrete and continuous models operating at different timescales. As a result, layered systems form a new class of hybrid systems composed of systems…
The Whitney extension theorem is a classical result in analysis giving a necessary and sufficient condition for a function defined on a closed set to be extendable to the whole space with a given class of regularity. It has been adapted to…
Let $C$ be a closed cone with nonempty interior $C^\circ$ in a Banach space. Let $f:C^\circ \rightarrow C^\circ$ be an order-preserving subhomogeneous function with a fixed point in $C^\circ$. We introduce a condition which guarantees that…
Given a convex polyhedral surface P, we define a tailoring as excising from P a simple polygonal domain that contains one vertex v, and whose boundary can be sutured closed to a new convex polyhedron via Alexandrov's Gluing Theorem. In…
In this article, we introduce a new type of mapping contracting perimeters of triangles in a complete metric space and present related fixed point theorem. We study the metric completeness property of the underlying space in terms of fixed…
It is well known that if there exists a finite set of convex bodies on the plane with non-overlapping interiors, then there is at least one "extremal" one among them, i.e., some one which can be continuously "taken away to the infinity"…
We consider closed chains of circles $C_1,C_2,\ldots,C_n,C_{n+1}=C_1$ such that two neighbouring circles $C_i,C_{i+1}$ intersect or touch each other with $A_i$ being a common point. We formulate conditions such that a polygon with vertices…
Tverberg's theorem says that a set with sufficiently many points in $\mathbb{R}^d$ can always be partitioned into $m$ parts so that the $(m-1)$-simplex is the (nerve) intersection pattern of the convex hulls of the parts. The main results…
For a set $P$ of $n$ points in the plane in general position, a non-crossing spanning tree is a spanning tree of the points where every edge is a straight-line segment between a pair of points and no two edges intersect except at a common…
A linkage mechanism consists of rigid bodies assembled by joints which can be used to translate and transfer motion from one form in one place to another. In this paper, we are particularly interested in a family of spacial linkage…