Related papers: Sodalite Network: Height and Spherical Content (Co…
Skeletal polyhedra and polygonal complexes in ordinary Euclidean 3-space are finite or infinite 3-periodic structures with interesting geometric, combinatorial, and algebraic properties. They can be viewed as finite or infinite 3-periodic…
What is the dimension of a network? Here, we view it as the smallest dimension of Euclidean space into which nodes can be embedded so that pairwise distances accurately reflect the connectivity structure. We show that a recently proposed…
Metric dimension is an essential parameter in graph theory that aids in addressing issues pertaining to information retrieval, localization, network design, and chemistry through the identification of the least possible number of elements…
We investigate a network model based on an infinite regular square lattice embedded in the Euclidean plane where the node connection probability is given by the geometrical distance of nodes. We show that the degree distribution in the…
We study the connection between the theory of spherical designs and the question of extrema of the height function of lattices. More precisely, we show that a full-rank n-dimensional Euclidean lattice, all layers of which hold a spherical…
Natural and man-made transport webs are frequently dominated by dense sets of nested cycles. The architecture of these networks, as defined by the topology and edge weights, determines how efficiently the networks perform their function.…
Skeletal polyhedra and polygonal complexes are finite or infinite periodic structures in 3-space with interesting geometric, combinatorial, and algebraic properties. These structures can be viewed as finite or infinite periodic graphs…
Higher order networks are able to characterize data as different as functional brain networks, protein interaction networks and social networks beyond the framework of pairwise interactions. Most notably higher order networks include…
3D-facets of the Delone cells representing the deep and shallow holes of the root lattice D6 which tile the six-dimensional Euclidean space in an alternating order are projected into three-dimensional space. They are classified into six…
Domain wall networks on the surface of a soliton are studied in a simple theory. It consists of two complex scalar fields, in (3+1)-dimensions, with a global U(1) x Z_n symmetry, where n>2. Solutions are computed numerically in which one of…
It is shown that there are examples of distinct polyhedra, each with a Hamiltonian path of edges, which when cut, unfolds the surfaces to a common net. In particular, it is established for infinite classes of triples of tetrahedra.
Icosahedron and dodecahedron can be dissected into tetrahedral tiles projected from 3D-facets of the Delone polytopes representing the deep and shallow holes of the root lattice D_6. The six fundamental tiles of tetrahedra of edge lengths 1…
The symmetries of surfaces which can be embedded into the symmetries of the 3-dimensional Euclidean space $\mathbb{R}^3$ are easier to feel by human's intuition. We give the maximum order of finite group actions on $(\mathbb{R}^3, \Sigma)$…
Geodesic nets on Riemannian manifolds form a natural class of stationary objects generalizing geodesics. Yet almost nothing is known about their classification or general properties even when the ambient Riemannian manifold is the Euclidean…
We investigate the common underlying discrete structures for various smooth and discrete nets. The main idea is to impose the characteristic properties of the nets not only on elementary quadrilaterals but also on larger parameter…
The two-dimensional surface of a bi-axial ellipsoid is characterized by the lengths of its major and minor axes. Longitude and latitude span an angular coordinate system across. We consider the egg-shaped surface of constant altitude above…
A periodic lattice in Euclidean 3-space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
Archimedean lattices constitute a unique family of two-dimensional tilings formed from regular polygons arranged with uniform vertex configurations. While the kagome and snub square lattices, the simplest members of the Archimedean lattice…
Let T be a triangulation of S^3 containing a link L in its 1-skeleton. We give an explicit lower bound for the number of tetrahedra of T in terms of the bridge number of L. Our proof is based on the theory of almost normal surfaces.
Knowing which parts of a complex system have identical roles simplifies computations and reveals patterns in its network structure. Group theory has been applied to study symmetries in unweighted networks. However, in real-world weighted…