Related papers: Digital Convex + Unimodular Mapping =8-Connected (…
Contact graphs have emerged as an important tool in the study of translative packings of convex bodies. The contact number of a packing of translates of a convex body is the number of edges in the contact graph of the packing, while the…
A set of vertices $S$ resolves a graph if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The metric dimension of a graph is the minimum cardinality of a resolving set of the graph. Fix a connected…
In this paper, we propose a subnetwork decomposition/combination approach to investigate the single rate $2$-pair unicast problem. It is shown that the solvability of a $2$-pair unicast problem is completely determined by four specific link…
Polytope complexes are the generalisation of polygon meshes in geo-information systems (GIS) to arbitrary dimension, and a natural concept for accessing spatio-temporal information. Complexes of each dimension have a straight-forward…
Polytope theory has produced a great number of remarkably simple and complete characterization results for face-number sets or f-vector sets of classes of polytopes. We observe that in most cases these sets can be described as the…
A (convex) polytope $P$ is said to be $2$-level if for every direction of hyperplanes which is facet-defining for $P$, the vertices of $P$ can be covered with two hyperplanes of that direction. The study of these polytopes is motivated by…
A finite collection of unit vectors $S \subset \mathbb{R}^n$ is called a spherical two-distance set if there are two numbers $a$ and $b$ such that the inner products of distinct vectors from $S$ are either $a$ or $b$. We prove that if $a\ne…
Dyadic rationals are rationals whose denominator is a power of 2. A dyadic n-dimensional convex set is defined as the intersection with n-dimensional dyadic space of an n-dimensional real convex set. Such a dyadic convex set is said to be a…
We discuss the problem on the connectedness of various webs of lattice polytopes by introducing a geometric point of view from the toric Mori theory. To this end, we provide a combinatorial description of toric Sarkisov links in terms of…
A 2-component oriented link in $S^3$ is called weakly doubly slice if it is a cross-section of an unknotted sphere in $S^4$, and strongly doubly slice if it is a cross-section of a 2-component trivial spherical link in $S^4$. We give the…
We study the effect of positive correlations on the critical threshold of site and bond percolation in a square lattice with d = 2. We propose two algorithms for generating dependent lattices with minimal correlation length and non-negative…
Using digital topology approach, we construct digital models of closed surfaces as the intersection graphs of LCL covers of the surfaces. It is proved that digital models of closed surfaces are digital 2-dimensional surfaces preserving the…
We establish a new characterization for a conformal mapping of the unit disk $\mathbb{D}$ to be convex, and identify the mappings onto a half-plane or a parallel strip as extremals. We also show that, with these exceptions, the level sets…
A manifestly Lorentz-covariant calculus based on two matrix-coordinates and their associated derivatives is introduced. It allows formulating relativistic field theories in any even-dimensional spacetime. The construction extends a…
Multilayer infrastructure is often interdependent, with nodes in one layer depending on nearby nodes in another layer to function. The links in each layer are often of limited length, due to the construction cost of longer links. Here, we…
An equidistant polytope is a special equidistant set in the space $\mathbb{R}^n$ all of whose boundary points have equal distances from two finite systems of points. Since one of the finite systems of the given points is required to be in…
A recently developed Projection-based Digital Image Correlation (P-DVC) method is here extended to 4D (space and time) displacement field measurement and mechanical identification based on a single radiograph per loading step instead of…
By using the metric projection onto a closed self-dual cone of the Euclidean space, M. S. Gowda, R. Sznajder and J. Tao have defined generalized lattice operations, which in the particular case of the nonnegative orthant of a Cartesian…
In this work, we introduce and develop a theory of convex drawings of the complete graph $K_n$ in the sphere. A drawing $D$ of $K_n$ is convex if, for every 3-cycle $T$ of $K_n$, there is a closed disc $\Delta_T$ bounded by $D[T]$ such…
We show that in the framework of CAT(0) spaces, any convex combination of two mappings which are firmly nonexpansive -- or which satisfy the more general property $(P_2)$ -- is asymptotically regular, conditional on its fixed point set…