Related papers: On Haar meager sets
Soft set theory and rough set theory are mathematical tools to deal with uncertainties. In [3], authors combined these concepts and introduced soft rough sets. In this paper, we introduce the concepts of soft rough graphs, vertex and edge…
In this research a new algebraic semantics of rough set theory including additional meta aspects is proposed. The semantics is based on enhancing the standard rough set theory with notions of 'relative ability of subsets of approximation…
If and only if each point of a set of the phase-space is in the topological hull of a trajectory running through any other point of this set, we call this set a quasiergodic set. But which are these so defined quasiergodic sets in the case…
The renormalization method is specifically aimed at connecting theories describing physical processes at different length scales and thereby connecting different theories in the physical sciences. The renormalization method used today is…
In this article, a comprehensive study is made on the continuity, compactness, and spectrum of the lower triangular terraced matrix, introduced by H. C. Rhaly, Jr. [Houston J. Math. 15(1): 137-146, 1989], acting on the weighted null…
In this paper the group structure of the $p$-adic ball and sphere are studied. The dynamical system of isometry defined on invariant sphere is investigated. We define the binary operations $\oplus$ and $\odot$ on a ball and sphere…
The theory of integration over R is rich with techniques as well as necessary and sufficient conditions under which integration can be performed. Of the many different types of integrals that have been developed since the days of Newton and…
The emerging field of Nominal Computation Theory is concerned with the theory of Nominal Sets and its applications to Computer Science. We investigate here the impact of nominal sets on the definition of Cellular Automata and on their…
Semantic relation prediction aims to mine the implicit relationships between objects in heterogeneous graphs, which consist of different types of objects and different types of links. In real-world scenarios, new semantic relations…
The concept of breakdown point was introduced by Hampel [Ph.D. dissertation (1968), Univ. California, Berkeley; Ann. Math. Statist. 42 (1971) 1887-1896] and developed further by, among others, Huber [Robust Statistics (1981). Wiley, New…
Study of soft sets was first proposed by Molodtsov in 1999 to deal with uncertainty in a non-parametric manner. The researchers did not pay attention to soft set theory at that time but now the soft set theory has been developed in many…
This paper presents a finding that leveraging the hierarchical structures among labels for relationships and objects can substantially improve the performance of scene graph generation systems. The focus of this work is to create an…
Many empirical networks are intrinsically polyadic, with interactions occurring within groups of agents of arbitrary size. There are, however, few flexible null models that can support statistical inference for such polyadic networks. We…
Since 2023, through the detailed examination of numerous concrete examples, the author and his collaborators have identified a recurring pattern. Building upon this observation, they introduced the concept of the normalized remainder. They…
In the context of categories equipped with a structure of nullhomotopies, we introduce the notion of homotopy torsion theory. As special cases, we recover pretorsion theories as well as torsion theories in multi-pointed categories and in…
We introduce a method for constructing collections of subsets of $\mathbb{R}^{n}$, using an iterated function system, a set $T,$ and a cost function. We refer to these collections as tilings. The special case where $T$ is the central open…
In topological dynamics, tame and null systems arise naturally in the study of low-complexity aperiodic behaviour, yet providing concrete and easily testable conditions to establish their existence in a canonical class of systems is often…
Wearable computing and context awareness are the focuses of study in the field of artificial intelligence recently. One of the most appealing as well as challenging applications is the Human Activity Recognition (HAR) utilizing smart…
Biclustering structures in data matrices were first formalized in a seminal paper by John Hartigan (1972) where one seeks to cluster cases and variables simultaneously. Such structures are also prevalent in block modeling of networks. In…
Time-continuous dynamical systems defined on graphs are often used to model complex systems with many interacting components in a non-spatial context. In the reverse sense attaching meaningful dynamics to given 'interaction diagrams' is a…