Related papers: Betweenness Structures of Small Linear Co-Size
Trilinear mappings appear naturally when performing spatial isogeometric discretizations of degree $p = 1$. Among them, birational maps are characterized by the property that both the mapping and the associated inverse map are rational and…
This work is devoted to the study of the symmetries of (quasi)periodic architectured materials. For this purpose, the weaker symmetry criterion of indistinguishability is used. It relies on a statistical description of the mesostructure and…
Persistent homology is a popular and useful tool for analysing finite metric spaces, revealing features that can be used to distinguish sets of unlabeled points and as input into machine learning pipelines. The famous stability theorem of…
Hypergraphs serve as an effective tool widely adopted to characterize higher-order interactions in complex systems. The most intuitive and commonly used mathematical instrument for representing a hypergraph is the incidence matrix, in which…
Metric dimensions and metric basis are graph invariants studied for their use in locating and indexing nodes in a graph. It was recently established that for bicyclic graph of type-III ($\Theta $-graphs), the metric dimension is $3$ only,…
Spaces of quasi-invariant measures supplied with different topologies are studied. Their embeddings, projective decompositions, conditions for their metrizability are investigated. Theorems about convergence of nets of quasi-invariant…
Recent advances in the theory of metric measures spaces on the one hand, and of sub-Riemannian ones on the other hand, suggest the possibility of a "great unification" of Riemannian and sub-Riemannian geometries in a comprehensive framework…
Graph representations of solid state materials that encode only interatomic distance lack geometrical resolution, resulting in degenerate representations that may map distinct structures to equivalent graphs. Here we propose a hypergraph…
We study hierarchical segmentation in the framework of edge-weighted graphs. We define ultrametric watersheds as topological watersheds null on the minima. We prove that there exists a bijection between the set of ultrametric watersheds and…
Non-split almost complex supermanifolds and non-split Riemannian supermanifolds are studied. The first obstacle for a splitting is parametrized by group orbits on an infinite dimensional vector space. Further it is shown that non-split…
We present a new framework for multi-view geometry in computer vision. A camera is a mapping between $\mathbb{P}^3$ and a line congruence. This model, which ignores image planes and measurements, is a natural abstraction of traditional…
Betweenness centrality is a widely-used measure in the analysis of large complex networks. It measures the potential or power of a vertex to control the communication over the network under the assumption that information primarily flows…
Mixed 3-structures are odd-dimensional analogues of paraquaternionic structures. They appear naturally on lightlike hypersurfaces of almost paraquaternionic hermitian manifolds. We study invariant and anti-invariant submanifolds in a…
In this paper, we consider the minimal doubly resolving set problem in Hamming graphs, hypercubes and folded hypercubes. We prove that the minimal doubly resolving set problem in hypercubes is equivalent to the coin weighing problem. Then…
Understanding the structure of minor-free metrics, namely shortest path metrics obtained over a weighted graph excluding a fixed minor, has been an important research direction since the fundamental work of Robertson and Seymour. A…
The ternary betweenness relation of a tree, B(x,y,z) expresses that y is on the unique path between x and z. This notion can be extended to order-theoretic trees defined as partial orders such that the set of nodes larger than any node is…
The problem of construction of a general ihomogeneous solution of $D$-dimensional Einstein equations in the vicinity of a cosmological singularity is considered. It is shown that near the singularity a local behavior of metric functions is…
We survey problems and results from combinatorial geometry in normed spaces, concentrating on problems that involve distances. These include various properties of unit-distance graphs, minimum-distance graphs, diameter graphs, as well as…
Consider a real line equipped with a (not necessarily intrinsic) distance. We deal with the minimum-weight perfect matching problem for a complete graph whose points are located on the line and whose edges have weights equal to distances…
We study a measure-theoretic notion of connectedness for sets of finite perimeter in the setting of doubling metric measure spaces supporting a weak $(1,1)$-Poincar\'{e} inequality. The two main results we obtain are a decomposition theorem…