Related papers: Proximity Induced by Order Relations
While Random Matrix Theory has successfully modeled many quantities of families of L-functions, it frequently cannot see the family's arithmetic. In some situations this requires an extended theory that inserts arithmetic factors depending…
We define coarse proximity structures, which are an analog of small-scale proximity spaces in the large-scale context. We show that metric spaces induce coarse proximity structures, and we construct a natural small-scale proximity…
The variety $\mathbf{I}$ of implication zroupoids was defined and investigated by Sankappanavar ([7]) as a generalization of De Morgan algebras. Also, in [7], several new subvarieties of $\mathbf{I}$ were introduced, including the…
The notion of interval order was introduced by Norbert Wiener \cite{wie} in order to clarify the relation between the notion of an instant of time and that of a period of time. This was a problem on which Bertrand Russell \cite{rus} worked…
Two subanalytic subsets of R^n are called s-equivalent at a common point P if the Hausdorff distance between their intersections with the sphere centered at P of radius r vanishes of order greater than s when r tends to 0. In this paper we…
We study the complexity with respect to Borel reducibility of the relations of isometry and isometric embeddability between ultrametric Polish spaces for which a set $D$ of possible distances is fixed in advance. These are, respectively, an…
A well-quasi-order is an order which contains no infinite decreasing sequence and no infinite collection of incomparable elements. In this paper, we consider graph classes defined by excluding one graph as contraction. More precisely, we…
We are interested in characterizing which classes of finite graphs are well-quasi-ordered by the induced subgraph relation. To that end, we devise an algorithm to decide whether a class of finite graphs well-quasi-ordered by the induced…
We present a new method for embedding a causal set into Minkowski spacetime. The method is similar to a previously presented method, but is simpler and provides better embedding results. The method uses spacetime volumes to define causal…
In this paper, we use theory of rough set to study graphs using the concept of orbits. We investigate the indiscernibility partitions and approximations of graphs induced by orbits of graphs. We also study rough membership functions,…
Following an approach presented by N. Frantzikinakis, B. Host and B. Kra, we show that the parameters in the multidimensional Szemer\'edi theorem for closest integer polynomials have non-empty intersection with the set of shifted primes…
Sequential measurements of non-commuting observables produce order effects that are well-known in quantum physics. But their conceptual basis, a significant measurement interaction, is relevant for far more general situations. We argue that…
Analogical reasoning depends fundamentally on the ability to learn and generalize about relations between objects. We develop an approach to relational learning which, given a set of pairs of objects…
Proximity graphs are used in several areas in which a neighborliness relationship for input data sets is a useful tool in their analysis, and have also received substantial attention from the graph drawing community, as they are a natural…
In relation triplet extraction (RTE), recognizing unseen relations for which there are no training instances is a challenging task. Efforts have been made to recognize unseen relations based on question-answering models or relation…
Relation classification aims to extract semantic relations between entity pairs from the sentences. However, most existing methods can only identify seen relation classes that occurred during training. To recognize unseen relations at test…
A well-defined distance on the parameter space is key to evaluating estimators, ensuring consistency, and building confidence sets. While there are typically standard distances to adopt in a continuous space, this is not the case for…
We consider the relative configurational entropy per cell S_Delta as a measure of the degree of spatial disorder for systems of finite-sized objects. It is highly sensitive to deviations from the most spatially ordered reference…
We investigate four partial orderings on the space of quantum measurements (i.e on POVMs or positive operator valued measures), describing four notions of coarse/fine-ness of measurement. These are the partial orderings induced by: (1)…
We present a new approach to approximate nearest-neighbor queries in fixed dimension under a variety of non-Euclidean distances. We are given a set $S$ of $n$ points in $\mathbb{R}^d$, an approximation parameter $\varepsilon > 0$, and a…