Related papers: Descriptive Proximities I: Properties and interpla…
The set of open subsets in a proximity space (X,{\zeta}) forms a topological system that enables the definition of proximal and descriptive topological groups. This framework naturally extends to proximal and descriptive topological rings…
This paper introduces an extension of descriptive intersection and provides a framework for descriptive unions of nonempty sets. Fibre bundles provide structures that characterize spatially near as well as descriptively near sets, their…
This is a survey on the ongoing development of a descriptive theory of represented spaces, which is intended as an extension of both classical and effective descriptive set theory to deal with both sets and functions between represented…
This paper aims to examine the version of the topological group structure in proximity and especially descriptive proximity spaces, that is, the concepts of proximal group and descriptive proximal group are introduced. In addition, the…
Rough set theory is a new mathematical approach to imperfect knowledge. The notion of rough sets is generalized by using an arbitrary binary relation on attribute values in information systems, instead of the trivial equality relation. The…
This article introduces descriptive fixed sets and their properties in descriptive proximity spaces viewed in the context of planar ribbon complexes. These fixed sets are a byproduct of descriptive proximally continuous maps that spawn…
This report consists of two parts. The first part is a brief exposition of classical descriptive set theory. This part introduces some fundamental concepts, motivations and results from the classical theory and ends with a section on the…
Nearness theory comes into play in homotopy theory because the notion of closeness between points is essential in determining whether two spaces are homotopy equivalent. While nearness theory and homotopy theory have different focuses and…
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…
Establishing dense correspondences across image pairs is essential for tasks such as shape reconstruction and robot manipulation. In the challenging setting of matching across different categories, the function of an object, i.e., the…
: In studies of discrete structures, functions are frequently used that express proximity, but are not metrics. We consider a class of such functions that is characterized by a normalization condition and an inequality that plays the same…
Usually, density functional models are considered approximations to density functional theory, However, there is no systematic connection between the two, and this can make us doubt about a linkage. This attitude can be further enforced by…
The focus of this article is on the detection and classification of patterns based on groupoids. The approach hinges on descriptive proximity of points in a set based on the neighborliness property. This approach lends support to image…
Feature selection is an important problem in high-dimensional data analysis and classification. Conventional feature selection approaches focus on detecting the features based on a redundancy criterion using learning and feature searching…
The purpose of this paper is to give a survey on the notions of distance between subsets either of a metric space or of a measure space, including definitions, a classification, and a discussion of the best-known distance functions, which…
Approximation theory is concerned with the ability to approximate functions by simpler and more easily calculated functions. The first question we ask in approximation theory concerns the {\it possibility of approximation}. Is the given…
In this study, Devaney's chaos conditions are revisited within the framework of descriptive proximity. The concepts of descriptive transitivity, the density of descriptive periodic objects, and descriptive sensitivity are defined. The most…
Optimization problems, generalized equations, and the multitude of other variational problems invariably lead to the analysis of sets and set-valued mappings as well as their approximations. We review the central concept of set-convergence…
The kernel of analysis, to me anyway, is the following idea: A point is arbitrarily close to a set if every neighborhood of the point intersects the set. Defining ``arbitrarily close'' in this way provides a foundation for classical results…
Using ideas from synthetic topology, a new approach to descriptive set theory is suggested. Synthetic descriptive set theory promises elegant explanations for various phenomena in both classic and effective descriptive set theory.…