Related papers: Approximations of Maximal and Principal Ideal
We formulate problems of tight closure theory in terms of projective bundles and subbundles. This provides a geometric interpretation of such problems and allows us to apply intersection theory to them. This yields new results concerning…
Rough set is mainly concerned with the approximations of objects through an equivalence relation on a universe. Matroid is a combinatorial generalization of linear independence in vector spaces. In this paper, we define a parametric set…
Completely prime right ideals are introduced as a one-sided generalization of the concept of a prime ideal in a commutative ring. Some of their basic properties are investigated, pointing out both similarities and differences between these…
Rough sets were proposed to deal with the vagueness and incompleteness of knowledge in information systems. There are may optimization issues in this field such as attribute reduction. Matroids generalized from matrices are widely used in…
An ideal is a classical object of study in the field of algebraic number theory. In maximal quadratic orders of number fields, ideals usually represented by the $\mathbb Z$-basis. This form of representation is used in most of the…
Many classical ring-theoretic results state that an ideal that is maximal with respect to satisfying a special property must be prime. We present a "Prime Ideal Principle" that gives a uniform method of proving such facts, generalizing the…
We study the ring extensions R \subseteq T having the same set of prime ideals provided Nil(R) is a divided prime ideal. Some conditions are given under which no such T exist properly containing R. Using idealization theory, the examples…
Using the idea of quasi-ideals of $P$-regular nearrings, the concept of bi-ideals of $P$-regular nearrings is generalized, which is an extension of the concept of quasi-ideals of $P$-regular nearrings and some interesting characterizations…
Up-directed rough sets are introduced and studied by the present author in earlier papers. This is extended by her in two different granular directions in this research, with a surprising algebraic semantics. The granules are based on ideas…
Ideals in the ring of power series in three variables can be classified based on algebra structures on their minimal free resolutions. The classification is incomplete in the sense that it remains open which algebra structures actually…
We observe that the class of left and right artinian left and right morphic rings agrees with the class of artinian principal ideal rings. For $R$ an artinian principal ideal ring and $G$ a group, we characterize when $RG$ is a principal…
The test ideal $\tau(R)$ of a ring $R$ of prime characteristic is an important object in the theory of tight closure. In this paper, we study a generalization of the test ideal, which is the ideal $\tau(\a^t)$ associated to a given ideal…
Fuzzy rough set theory can be used as a tool for dealing with inconsistent data when there is a gradual notion of indiscernibility between objects. It does this by providing lower and upper approximations of concepts. In classical fuzzy…
We continue the study of ideal convergence for sequences $(x_n)$ with values in a topological space $X$ with respect to a family $\{F_\eta:\eta\in X\}$ of subsets of $X$ with $\eta\in F_\eta$, where each $F_\eta$ measures the allowed…
In the set of continuous functions C(X,Y) where Y has a topology close to being discrete, there is an equivalence relation on X which characterizes the quasi-components of X. If Y satisfies weak algebraic conditions with a single binary…
The study of mereology (parts and wholes) in the context of formal approaches to vagueness can be approached in a number of ways. In the context of rough sets, mereological concepts with a set-theoretic or valuation based ontology acquire…
We present a constructive universal approximation theorem for learning machines equipped with joint-group-equivariant feature maps, called the joint-equivariant machines, based on the group representation theory. ``Constructive'' here…
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,…
Motivated by the application problem of sensor fusion the author introduced the concept of graded set. It is reasoned that in classification problem arising in an information system (represented by information table), a novel set called…
Robust and distributionally robust optimization are modeling paradigms for decision-making under uncertainty where the uncertain parameters are only known to reside in an uncertainty set or are governed by any probability distribution from…