Related papers: Approximations of Maximal and Principal Ideal
In this paper, we introduce and study two new classes of commutative rings, namely semi transitional rings and transitional rings, which extend several classical ideas arising from rings of continuous functions and their variants. A general…
Not all approximations arise from information systems. The problem of fitting approximations, subjected to some rules (and related data), to information systems in a rough scheme of things is known as the \emph{inverse problem}. The inverse…
The fuzzy rough approximation operator serves as the cornerstone of fuzzy rough set theory and its practical applications. Axiomatization is a crucial approach in the exploration of fuzzy rough sets, aiming to offer a clear and direct…
In this paper, we consider the problem of how to establish algebraic structures on nearness approximation spaces. Essentially, our approach is to define the nearness ring, nearness ideal and nearness ring of all weak cosets by considering…
A rational approximation by a ratio of polynomial functions is a flexible alternative to polynomial approximation. In particular, rational functions exhibit accurate estimations to nonsmooth and non- Lipschitz functions, where polynomial…
This paper investigates the mining of class association rules with rough set approach. In data mining, an association occurs between two set of elements when one element set happen together with another. A class association rule set (CARs)…
The classical "generalized principal ideal theorems" of Macaulay, Eagon-Northcott, and others give sharp bounds on the heights of determinantal ideals in arbitrary rings. But in regular local rings (or graded polynomial rings) these are far…
In reinforcement learning (RL) theory, the concept of most confusing instances is central to establishing regret lower bounds, that is, the minimal exploration needed to solve a problem. Given a reference model and its optimal policy, a…
This book is a rigorous and conceptually oriented introduction to ring theory. The emphasis is on structural understanding rather than encyclopedic coverage: rings are studied through ideals, homomorphisms, quotients, and universal…
In this paper we investigate some properties of ideals in group algebras of finite groups over fields. First, we highlight an important link between their dimension, their minimal Hamming distance and the group order. This is a generalized…
Can there be a structure space-type theory for an arbitrary class of ideals of a ring? The ideal spaces introduced in this paper allows such a study and our theory includes (but not restricted to) prime, maximal, minimal prime, strongly…
Let $\Sigma (X,\mathbb{C})$ denote the collection of all the rings between $C^*(X,\mathbb{C})$ and $C(X,\mathbb{C})$. We show that there is a natural correlation between the absolutely convex ideals/ prime ideals/maximal…
The concept of I-statistical convergence of a double sequence was first introduced and study by Das et. el [2]. Here in this paper we discuss some results on rough ideal statistical convergence and also we introduce the notion of rough…
We investigate exponential ideals within the context of exponential polynomial rings over exponential fields. We establish two distinct notions of maximality for exponential ideals and explore their relationship to primeness. These three…
The problem of computing the dimension of a left/right ideal in a group algebra F[G] of a finite group G over a field F is considered. The ideal dimension is related to the rank of a matrix originating from a regular left/right…
The aim of this work is to study duality of fractional ideals with respect to a fixed ideal and to investigate the relationship between value sets of pairs of dual ideals in admissible rings, a class of rings that contains the local rings…
Recently, we have endowed various categories of groups with topologies. The purpose of this paper is to introduce on these categories others topologies which are statistically more suitable to study well-known problems in groups theory. We…
Most problems in Machine Learning cater to classification and the objects of universe are classified to a relevant class. Ranking of classified objects of universe per decision class is a challenging problem. We in this paper propose a…
In the first section of the present work, we introduce the concept of pseudocomplementation for semirings and show semiring version of some known results in lattice theory. We also introduce semirings with pc-functions and prove some…
We develop a corrective mechanism for neural network approximation: the total available non-linear units are divided into multiple groups and the first group approximates the function under consideration, the second group approximates the…