Related papers: On hybrid order dimension
It is demonstrated via a numerical experiment (a Monte Carlo simulation) in the context of three-dimensional site-diluted Heisenberg spin systems that a functional dependence of the Binder ratio ($V_4$) on the order parameter correlation…
Split preorders are preordering relations on a domain whose composition is defined in a particular way by splitting the domain into two disjoint subsets. These relations and the associated composition arise in categorial proof theory in…
Many topological data analysis (TDA) pipelines compute large collections of persistence diagrams, yet vectorizations and kernel methods discard the rank-induced implication relations among persistence intervals that are essential for…
The $\mathsf{HYBRID}$ model was introduced as a means for theoretical study of distributed networks that use various communication modes. Conceptually, it is a synchronous message passing model with a local communication mode, where in each…
The dual of a map is a fundamental construction on combinatorial maps, but many other combinatorial objects also possess their notion of duality. For instance, the Tamari lattice is isomorphic to its order dual, which induces an involution…
The existence of a well-behaved dimension of a finite von Neumann algebra (see [19]) has lead to the study of such a dimension of finite Baer *-rings (see [26]) that satisfy certain *-ring axioms (used in [9]). This dimension is closely…
This work generalizes the binary search problem to a $d$-dimensional domain $S_1\times\cdots\times S_d$, where $S_i=\{0, 1, \ldots,n_i-1\}$ and $d\geq 1$, in the following way. Given $(t_1,\ldots,t_d)$, the target element to be found, the…
This paper is devoted to a new approach of the arithmetic of intervals. We present the set of intervals as a normed vector space. We define also a four-dimensional associative algebra whose product gives the product of intervals in any…
Each family $\mathcal{M}$ of means has a natural, partial order (point-wise order), that is $M \le N$ iff $M(x) \le N(x)$ for all admissible $x$. In this setting we can introduce the notion of interval-type set (a subset $\mathcal{I}…
We define interval spacing as the difference in the order statistics of data over a gap of some width. We derive its density, expected value, and variance for uniform, exponential, and logistic variates. We show that interval spacing is…
The paper is devoted to modal properties of the ternary strict betweenness relation as used in the development of various systems of geometry. We show that such a relation is non-definable in a basic similarity type with a binary operator…
Let $G$ be a connected graph of order $n$.The Wiener index $W(G)$ of $G$ is the sum of the distances between all unordered pairs of vertices of $G$. In this paper we show that the well-known upper bound $\big( \frac{n}{\delta+1}+2\big) {n…
Magnitude, obtained as a special case of Euler characteristic of enriched category, represents a sense of the size of metric spaces and is related to classical notions such as cardinality, dimension, and volume. While the studies have…
We construct a monadic second-order sentence that characterizes the ternary relations that are the betweenness relations of finite or infinite partial orders. We prove that no first-order sentence can do that. We characterize the partial…
In order theory, partially ordered sets are only equipped with one relation which decides the entire structure/Hasse diagram of the set. In this paper, we have presented how partially ordered sets can be studied under simultaneous partially…
An interval $k$-graph is the intersection graph of a family $\mathcal{I}$ of intervals of the real line partitioned into at most $k$ classes with vertices adjacent if and only if their corresponding intervals intersect and belong to…
This paper introduces an order proximity on a collection of objects induced by a partial order using the Smirnov closeness measure on a Sz\'{a}z relator space. A Sz\'{a}z relator is a nonempty family of relations defined on a nonvoid set…
The metric dimension has been introduced independently by Harary, Melter and Slater in 1975 to identify vertices of a graph G using its distances to a subset of vertices of G. A resolving set X of a graph G is a subset of vertices such…
Interval-valued information systems are generalized models of single-valued information systems. By rough set approach, interval-valued information systems have been extensively studied. Authors could establish many binary relations from…
We study online interval scheduling in the irrevocable setting, where each interval must be immediately accepted or rejected upon arrival. The objective is to maximize the total length of accepted intervals while ensuring that no two…