Related papers: Digital Convex + Unimodular Mapping =8-Connected (…
For a family $\mathcal{C}$ of properly embedded curves in the 2-dimensional disk $\mathbb{D}^{2}$ satisfying certain uniqueness properties, we consider convex polygons $P\subset \mathbb{D}^{2}$ and define a metric $d$ on $P$ such that…
In a separably connected space any two points are contained in a separable connected subset. We show a mechanism that takes a connected bounded metric space and produces a complete connected metric space whose separablewise components form…
Site percolation in a distorted simple cubic lattice is characterized numerically employing the Newman-Ziff algorithm. Distortion is administered in the lattice by systematically and randomly dislocating its sites from their regular…
A theorem of Tietze and Nakamija, from 1928, asserts that if a subset X of R^n is closed, connected, and locally convex, then it is convex. We give an analogous "local to global convexity" theorem when the inclusion map of X to R^n is…
Motivated by the Weak Gravity Conjecture in the context of holography in AdS, it has been proposed that operators charged under global symmetries in CFTs, in three dimensions or higher, should satisfy certain convexity properties on their…
Convex geometries (Edelman and Jamison, 1985) are finite combinatorial structures dual to union-closed antimatroids or learning spaces. We define an operation of resolution for convex geometries, which replaces each element of a base convex…
A convex network can be defined as a network such that every connected induced subgraph includes all the shortest paths between its nodes. Fully convex network would therefore be a collection of cliques stitched together in a tree. In this…
In the framework of the so called link approach we study exact lattice supersymmetry for the simplest supersymmetric model: N=1 supersymmetry in D=1. The model is described by a lattice with spacing a/2, thus containing twice as many sites…
We model a set of point-to-point transports on a network as a system of polydisperse interacting self-avoiding walks (SAWs) over a finite square lattice. The ends of each SAW may be located both at random, uniformly distributed, positions…
A contractive condition is addressed for extended 2-cyclic self-mappings on the union of a finite number of subsets of a metric space which are allowed to have a finite number of successive images in the same subsets of its domain. It is…
Spatial coupling has recently emerged as a powerful paradigm to construct graphical models that work well under low-complexity message-passing algorithms. Although much progress has been made on the analysis of spatially coupled models…
We consider the probability that a dense wireless network confined within a given convex geometry is fully connected. We exploit a recently reported theory to develop a systematic methodology for analytically characterizing the connectivity…
The growing complexity of dynamical systems and advances in data collection necessitates robust data-driven control strategies without explicit system identification and robust synthesis. Data-driven stability has been explored in linear…
For a given graph whose edges are labeled with general real numbers, we consider the set of functions from the vertex set into the Euclidean plane such that the distance between the images of neighbouring vertices is equal to the…
Dyadic rationals are rationals whose denominator is a power of $2$. We define dyadic $n$-dimensional convex sets as the intersections with $n$-dimensional dyadic space of an $n$-dimensional real convex set. Such a dyadic convex set is said…
According to a 2002 theorem by Cardaliaguet and Tahraoui, an isotropic, compact and connected subset of the group $\operatorname{GL}^+(2)$ of invertible $2\times2-\,$matrices is rank-one convex if and only if it is polyconvex. In a 2005…
The simplest way to generate a lattice of convex sets is to consider an initial set of points and draw segments, triangles, and any convex hull from it, then intersect them to obtain new points, and so forth. The result is an infinite…
This paper studies the \emph{unimodular isomorphism problem} (UIP) of convex lattice polytopes: given two convex lattice polytopes $P$ and $P'$, decide whether there exists a unimodular affine transformation mapping $P$ to $P'$. We show…
We introduce a new type of homotopy relation for digitally continuous functions which we call ``strong homotopy.'' Both digital homotopy and strong homotopy are natural digitizations of classical topological homotopy: the difference between…
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in an undirected graph, subject to edge insertions and deletions.…